Solving TSP Based on the Improved Simulated Annealing Algorithm with Sequential Access Restrictions

DOI

10.2991/mcei-16.2016.127How to use a DOI?

Keywords

TSP problem; Combinatorial optimization; Sequential access restrictions; Clustering; Simulated annealing.

Abstract

TSP problem is a typical combinatorial optimization problem, which has been applied in many fields in real life. InÿtheÿsolutionÿofÿTSP, it is no doubt that it will reduce some unnecessary calculations if the approximate path is determined in advance. Sequential access restrictions combined with the properties of convex hull, gives roughly access order for TSP. Applying access restrictions to the path planning algorithm of TSP, clustering analysis the initial points with access restrictions, combing the clustering results with simulated annealing algorithm, and improving the transform rules of solutions in simulated annealing, an improvedÿsimulated annealing algorithm is proposed based on access restrictions was proposed. The proposed algorithm shortens the operation time, improves the convergence efficiency of the simulated annealing algorithm, and obtains a good experimental results.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lin Xiong
AU  - Shunxin Li
PY  - 2016/12
DA  - 2016/12
TI  - Solving TSP Based on the Improved Simulated Annealing Algorithm with Sequential Access Restrictions
BT  - Proceedings of the 2016 6th International Conference on Mechatronics, Computer and Education Informationization (MCEI 2016)
PB  - Atlantis Press
SP  - 610
EP  - 616
SN  - 1951-6851
UR  - https://doi.org/10.2991/mcei-16.2016.127
DO  - 10.2991/mcei-16.2016.127
ID  - Xiong2016/12
ER  -