An Improved Simulated Annealing Algorithm for Travelling Salesman Problem
DOI:
https://doi.org/10.3991/ijoe.v9i4.2822Abstract
Traveling salesman problem (TSP) is one well-known NP-Complete problem. The basic simulated annealing algorithm is improved with the four vertices and three lines inequality to search the optimal Hamiltonian circuit (OHC) or approximate OHC. The four vertices and three lines inequality is taken as the heuristic information to convert the local Hamiltonian paths in the Hamiltonian circuit (HC) into the local optimal Hamiltonian paths and the HC become shorter. The HCs are generated with the basic simulated algorithm first. Then the local Hamiltonian paths are changed into the local optimal Hamiltonian paths with the four vertices and three lines inequality. The algorithm of the improved simulated annealing is designed and tested with twenty TSP instances. The experimental results show that the better approximate OHCs are found than those searched with the basic simulated annealing algorithm under the same preconditions.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.