A Novel Heuristic For The Traveling Salesman Problem: maxS

Öz

In this study, a new initial solution heuristic was proposed for the traveling salesman problem. The proposed maxS method is based on a new distance matrix obtained by normalizing the distance matrix of the problem being addressed according to the maximum row value. The proposed method was tested on 20 small and 11 large-scale problems, recommended by Hougardy and Zhong, which are difficult to solve optimally. The same problems were also solved by Greedy, Boruvka, Quick-Boruvka, Nearest-Neighborhood and Lin-Kernighan heuristics working on the Concorde software. Based on the comparisons, it is seen that the recommended maxS heuristic performance was better than that of Greedy and Nearest-Neighborhood heuristics and it showed a similar performance with Boruvka in small-scale problems. When the same comparisons were made for large-scale problems, maxS showed better performance than Quick Boruvka and Nearest-Neighborhood heuristics, on average. The maxS heuristic, which is very effective in terms of solution times, can be proposed as a promising initial solution method.

Anahtar Kelimeler

• Traveling Salesman Problem
• maxS
• Boruvka
• Nearest-Neighborhood
• Lin-Kernighan
• Initial Solutions

Gezgin Satici Problemi Için Yeni Bir Sezgisel:maxS

Öz

Bu çalışmada, gezgin satıcı problemi için yeni bir başlangıç çözüm sezgiseli önerilmiştir. Önerilen maxS metodu, üzerinde çalışılan problemin mesafe matrisinin maksimum satır değerine göre normalize edilmesiyle elde edilen yeni mesafe matrisi ile çalışır. Önerilen metot, Hougardy ve Zhong tarafından tavsiye edilen ve optimal çözümü zor olan 20 küçük ve 11 büyük ölçekte problem üzerinde test edilmiştir. Aynı problemler, Concorde yazılımı üzerinde çalışan Greedy, Boruvka, Quick-Boruvka, Nearest-Neighborhood and Lin-Kernighan sezgiselleri ile de çözülmüştür. Çözümler karşılaştırıldığında küçük ölçekli problemler için maxS sezgiselinin performansının Greedy ve Nearest-Neighborhood sezgisellerinden daha iyi olduğu ve Boruvka ile benzer performansta olduğu gözlenmiştir. Benzer karşılaştırmalar büyük ölçekli problemler için yapıldığında maxS, Quick Boruvka ve Nearest-Neighborhood sezgisellerinden ortalama olarak daha iyi performans göstermiştir. Çözüm zamanları açısından çok etkili olan maxS sezgiseli, gelecek vaadeden başlangıç çözüm yöntemi olarak önerilebilir.

Anahtar Kelimeler

• Gezgin Satıcı Problemi
• maxS
• Boruvka
• Nearest-Neighbourhood
• Lin-Kernighan
• başlangıç çözümü

Kaynakça

1. Matausek, J., Nesetril, J., 2008. An Invitation to Discrete Mathematics, (2nd edition). Oxford University Press, New York, USA.
2. Papadimitriou, C. H., Steiglitz, K., 1998. Combinatorial Optimization: Algorithms and Complexity, Dover Publications, New York, USA.
3. Cook, W.J., 2012. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, Princeton University Press, New Jersey, USA.
4. Gass, S.I., Assad, A.A., 2005. An Annotated Timeline of Operations Research: An Informal History, Kluwer Academic Publishers, New York, USA.
5. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, New York, USA.
6. Cook, W., “The Traveling Salesman Problem”, http://www.math.uwaterloo.ca/tsp/ history/milestone.html, Accessed:20/03/2019.
7. Kim, I.B., Shim, I.J., Zhang, M., 1998. Comparison of TSP algorithms, Project for Models in Facilities Planning and Materials Handling.
8. Helsgaun, K., 2000. “An effective implementation of the Lin–Kernighan traveling salesman heuristic”, European Journal of Operational Research, 126(1): 106–130.

9. Srour, A., Othman, Z.A., Hamdan, A.R., 2014. “A water flow-like algorithm for the travelling salesman problem”, Advances in Computer Engineering, Hindawi Publishing Corporation, 1-14.
10. Abid, M.M., Muhammad, I., 2015. “Heuristic approaches to solve traveling salesman problem”, TELKOMNIKA Indonesian Journal of Electrical Engineering, 15(2): 390-396.
11. Bostamam, J.M., Othman, Z., 2016. “Hybrid water flow-like algorithm with Tabu search for traveling salesman problem”, AIP Conference Proceedings 1761, 020058.
12. Kamarudin, A.A., Othman, Z.A., Sarim, H.M., 2016. “Improvement initial solution water flow like algorithm using simulated annealing for travelling salesman problem”, International Review of Management and Marketing, 6(8): 63-66.
13. Wu, G-H., Cheng, C-Y., Yang, H-I., Chena, C-T., 2018. “An improved water flow-like algorithm for order acceptance and scheduling with identical parallel machines”, Applied Soft Computing, 71, 1072-1084.
14. Demiriz, A., “Solving Traveling Salesman Problem by Ranking”, http://www.ayhandemiriz.com/SakaryaWebSite/papers/benelearn09.pdf, Accessed: 19/03/2019.
15. Lin, S., Kernighan, B.W., 1973. “An Effective Heuristic Algorithm for the Traveling-Salesman Problem”, Operations Research, 21(2): 498–516.
16. Karagül, K. (2019). A Novel Solution Approach for Travelling Salesman Problem: TPORT. DEUFMD, 21(63), 819-832
17. Karagül, K. (2019). A Novel Solution Approach for Travelling Salesman Problem Based on Hungarian Algorithm. Mühendislik Bilimleri ve Tasarım Dergisi , 7 (3) , 561-571 . DOI: 10.21923/jesd.523623
18. Karagül, K . (2019). Prüfer-Karagül Algorithm: A Novel Solution Approach for Travelling Salesman Problem. Mehmet Akif Ersoy Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi , 6 (2) , 452-470 . DOI: 10.30798/makuiibf.508842
19. Hougardy, S., Zhong, X., 2018. “Hard to Solve Instances of the Euclidean Traveling Salesman Problem”, arXiv:1808.02859 [cs.DM].
20. Helsgaun, K., “Lin-Kernighan-Helsgaun”, http://akira.ruc.dk/~keld/research/LKH/, Accessed:01/03/2019.
21. Hougardy, S., Zhong, X., “Hard to Solve Instances of the Euclidean Traveling Salesman Problem”, http://www.or.uni-bonn.de /~hougardy/HardTSPInstances.html, Accessed: 01/03/2019.
22. Karagul, K., Aydemir, E. and Tokat, S., 2016. Using 2-Opt based evolution strategy for travelling salesman problem. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 6(2), pp.103-113.
23. Şahin, Y. and Karagül, K.,2019. Solving Travelling Salesman Problem Using Hybrid Fluid Genetic Algorithm (HFGA). Pamukkale University Journal of Engineering Sciences, 25(1), pp.106-114.
24. Sahin, Y., Aydemir, E., Karagul, K., Tokat, S. and Oran, B., 2021. Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface. In Interdisciplinary Perspectives on Operations Management and Service Evaluation (pp. 94-113). IGI Global.
25. Aydemir, E., Karagül, K. And Tokat, S., Kapasite Kisitli Araç Rotalama Problemlerinde Başlangiç Rotalarinin Kurulmasi İçin Yeni Bir Algoritma. Mühendislik Bilimleri Ve Tasarım Dergisi, 4(3), Pp.215-226.