Full Article: PDF
Scientific Object Identifier: http://s-o-i.org/1.1/TAS-04-120-23
DOI: https://dx.doi.org/10.15863/TAS.2023.04.120.23
Language: English
Citation: Akhmet-Sultan, A., et al. (2023). Brief review of 20th century in development and accessibility of travelling salesman problem and TSPLIB. ISJ Theoretical & Applied Science, 04 (120), 130-136. Soi: http://s-o-i.org/1.1/TAS-04-120-23 Doi: https://dx.doi.org/10.15863/TAS.2023.04.120.23 |
Pages: 130-136
Published: 30.04.2023
Abstract: This paper provides a brief review of the 20th century in development and accessibility of the Traveling Salesman Problem (TSP) and TSPLIB. The TSP is a well-known NP-hard problem that has been studied extensively in the field of computer science and operations research. The problem involves finding the shortest possible route that a salesman can take to visit a given set of cities exactly once and return to the starting city. TSPLIB is a benchmark library that contains a collection of TSP instances that researchers and practitioners can use to test the performance of TSP algorithms. In this paper, we discuss the historical background of the TSP and its relevance to various fields, including logistics, transportation, and computer science. We then review the development of TSPLIB and the various improvements and additions made to it over the years. Finally, we provide a brief overview of some of the significant advancements in TSP algorithms that have occurred over the last century and their impact on the field. Overall, this paper provides a comprehensive overview of the TSP and TSPLIB's history and their impact on the development of algorithms for solving combinatorial optimization problems.
Key words: TSP, TSPLIB, logistics, review, publications, academic articles.
|
