摘要
The tour construction heuristic that generates initial tours for the tour improvement heuristics plays an important role in solving the travelling salesman problem (TSP). With the help of an effective tour construction heuristic, the performance of a heuristic can be improved In this study we present a new tour construction algorithm, the construction priority (CP). We incorporate the performance of the CP into metaheuristics such as tabu search, genetic algorithm, space smoothing, and noising methods. The performance of the CP is empirically compared with the nearest neighbour (NN) approach. Extensive computational comparison shows that the CP is considerably more effective compared to NN.
学科与关键词
关键词
travelling salesmanheuristicslocal searchglobal search
- A Multi-Phase Method for Euclidean Traveling Salesman ProblemsHugo Pacheco-Valencia, Victor; Vakhania, Nodari*; Angel Hernandez-Mira, Frank; Alberto Hernandez-Aguilar, JoseAXIOMS, 2022, 11(9): 439.被引 1
- Information in the Traveling Salesman ProblemGilad Barach; Hugo Fort; Yoni Mehlman; Fredy ZypmanApplied Mathematics, 2012, 03(08): 926-930.
- An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman ProblemWang, Zicheng; Geng, Xiutang; Shao, Zehui*Journal of Computational and Theoretical Nanoscience, 2009, 6(7): 1680-1686.被引 27
