New heuristic algorithm for traveling salesman problem

M. L. Shahab

doi:10.1088/1742-6596/1218/1/012038

New heuristic algorithm for traveling salesman problem

M. L. Shahab^*

^*Corresponding author for this work

Laboratory of Machine Learning and Big Data

Research output: Contribution to journal › Conference article › peer-review

3 Citations (Scopus)

Abstract

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 language	English
Article number	012038
Journal	Journal of Physics: Conference Series
Volume	1218
Issue number	1
DOIs	https://doi.org/10.1088/1742-6596/1218/1/012038
Publication status	Published - 31 May 2019
Event	3rd International Conference on Mathematics; Pure, Applied and Computation, ICoMPAC 2018 - Surabaya, Indonesia Duration: 20 Oct 2018 → …

Access to Document

10.1088/1742-6596/1218/1/012038

Cite this

@article{e08490ad6b50483289eb8711dc030f20,

title = "New heuristic algorithm for traveling salesman problem",

abstract = "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\%.",

author = "Shahab, \{M. L.\}",

note = "Publisher Copyright: {\textcopyright} Published under licence by IOP Publishing Ltd.; 3rd International Conference on Mathematics; Pure, Applied and Computation, ICoMPAC 2018 ; Conference date: 20-10-2018",

year = "2019",

month = may,

day = "31",

doi = "10.1088/1742-6596/1218/1/012038",

language = "English",

volume = "1218",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

number = "1",

}

TY - JOUR

T1 - New heuristic algorithm for traveling salesman problem

AU - Shahab, M. L.

N1 - Publisher Copyright: © Published under licence by IOP Publishing Ltd.

PY - 2019/5/31

Y1 - 2019/5/31

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

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

UR - https://www.scopus.com/pages/publications/85067800842

U2 - 10.1088/1742-6596/1218/1/012038

DO - 10.1088/1742-6596/1218/1/012038

M3 - Conference article

AN - SCOPUS:85067800842

SN - 1742-6588

VL - 1218

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

IS - 1

M1 - 012038

T2 - 3rd International Conference on Mathematics; Pure, Applied and Computation, ICoMPAC 2018

Y2 - 20 October 2018

ER -

New heuristic algorithm for traveling salesman problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this