Issue |
E3S Web Conf.
Volume 360, 2022
2022 8th International Symposium on Vehicle Emission Supervision and Environment Protection (VESEP2022)
|
|
---|---|---|
Article Number | 01097 | |
Number of page(s) | 7 | |
DOI | https://doi.org/10.1051/e3sconf/202236001097 | |
Published online | 23 November 2022 |
A quick Heuristic and a general search algorithm for traveling salesman problem
1 School of Software, Dalian University of Foreign Languages, Dalian 116044, China
2 School of Software, Dalian Jiaotong University, Dalian 116052, China
3 Institute of Systems Engineering, Dalian University of Technology, Dalian 116024, China
* Corresponding author: 13130001974@163.com
This paper puts forward a constructive heuristic algorithm called the method of inserting the minimum neighbor edge from outside to the center (IMNEFOTC) that can be applied to solve large-scale and ultra-large-scale travelling salesman problems. Through it and the randomized greedy heuristic algorithm (RGH) which greedy heuristic algorithm is modified, a general meta-heuristic search algorithm framework is built. The general search algorithm (GSA) is based on a set of initial solutions, and continuous 2-opt operations are performed, so as to search for solutions in better quality. The data from the experiment reveals that the performance of IMNEFOTC is better than the traditional greedy algorithm, and the GSA can obtain a pretty satisfactory solution in a reasonable range of time.
Key words: Traveling salesman problem / Greedy heuristic / 2-opt operation / Simulate annealing
© The Authors, published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0/).
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.