Research on TSP Solution Based on Improved Simulated Annealing Algorithm

DOI

10.2991/macmc-17.2018.27How to use a DOI?

Keywords

TSP Solution, Simulated Annealing Algorithm, Acceptable rule

Abstract

Travelling Salesman Problem (TSP) is a typical combinatorial optimization problem. The main idea of the problem is that given a number of cities and the distances between each city and tries to get the shortest path that visits each city exactly once and back to the starting point. This report introduces multiple arithmetic operators to improve the simulated annealing algorithm to apply in the solution of TSP. The result shows that the improved simulated annealing algorithm is effective and efficient.

Copyright

© 2018, 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  - Anzhi Qi
PY  - 2018/01
DA  - 2018/01
TI  - Research on TSP Solution Based on Improved Simulated Annealing Algorithm
BT  - Proceedings of the 2017 4th International Conference on Machinery, Materials and Computer (MACMC 2017)
PB  - Atlantis Press
SP  - 121
EP  - 124
SN  - 2352-5401
UR  - https://doi.org/10.2991/macmc-17.2018.27
DO  - 10.2991/macmc-17.2018.27
ID  - Qi2018/01
ER  -