Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages
2014 ◽
Vol 2014
◽
pp. 1-17
◽
Keyword(s):
The traveling salesman problem (TSP) is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-the-art algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type) of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA) by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications.
2018 ◽
Vol 9
(1)
◽
pp. 18-23
2019 ◽
Vol 26
(2)
◽
pp. 219-247
◽
2020 ◽
2009 ◽
Vol 6
(1)
◽
pp. 97-102
◽
2020 ◽
2020 ◽
Vol 18
(2)
◽
pp. 1035
2020 ◽