Open AccessNew heuristic algorithm for traveling salesman problem
Author(s) -
Muhammad Luthfi Shahab
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1218/1/012038
Subject(s) - travelling salesman problem , heuristic , mathematical optimization , 2 opt , algorithm , computer science , null move heuristic , bottleneck traveling salesman problem , mathematics
Traveling salesman problem (TSP) is a basis for many bigger problems. If we can find an efficient method (that produce a good result in a short time) to solve the TSP, then we will also be able to solve many other problems. In this research, we proposed a new heuristic algorithm for TSP. We used 80 problems from TSPLIB to test the proposed heuristic algorithm. The proposed heuristic algorithm can find the best-known distance for 36 different TSPs. The average of all Goodness Value is 99.50%.