Author:
Li Hui, ,Zhang Mengyao,Zeng Chenbo
Abstract
<abstract><p>Traveling salesman problem is a widely studied NP-hard problem in the field of combinatorial optimization. Many and various heuristics and approximation algorithms have been developed to address the problem. However, few studies were conducted on the multi-solution optimization for traveling salesman problem so far. In this article, we propose a circular Jaccard distance based multi-solution optimization (CJD-MSO) algorithm based on ant colony optimization to find multiple solutions for the traveling salesman problem. The CJD-MSO algorithm incorporates "distancing" niching technique with circular Jaccard distance metric which are both proposed in this paper for the first time. Experimental results verify that the proposed algorithm achieves good performance on both quality and diversity of the optimal solutions.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference39 articles.
1. M. Dorigo, Traveling salesman problem, in IEEE International Conference Evolutionary Computation, (2013).
2. R. M. Al-Khatib, K. M. O. Nahar, SRT-GA: smart real-time system using a powerful genetic algorithm for school bus routing problem, in 2017 2nd International Conference on the Applications of Information Technology in Developing Renewable Energy Processes & Systems (IT-DREPS), (2017), 1–8. https://doi.org/10.1109/IT-DREPS.2017.8277816
3. S. Ma, Y. Hao, Research on the order picking optimization problem of the automated warehouse, in 2009 Chinese Control and Decision Conference, (2009), 990–993. https://doi.org/10.1109/CCDC.2009.5192816
4. T. Ghorpade, C. G. Corlu, Selective pick-up and delivery problem: a simheuristic approach, in 2020 Winter Simulation Conference (WSC), (2020), 1468–1479. https://doi.org/10.1109/WSC48552.2020.9384060
5. P. Kalita, B. Kalita, SCS and TSP in DNA sequencing, Int. J. Management It Eng., 3 (2013), 263–277.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献