New heuristic algorithm for traveling salesman problem

M. L. Shahab*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)


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%.

Original languageEnglish
Article number012038
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 31 May 2019
Event3rd International Conference on Mathematics; Pure, Applied and Computation, ICoMPAC 2018 - Surabaya, Indonesia
Duration: 20 Oct 2018 → …


Dive into the research topics of 'New heuristic algorithm for traveling salesman problem'. Together they form a unique fingerprint.

Cite this