Searching the Optimal Hamiltonian Cycle That is the Solution to the Traveling Salesman Problem
Boletim da Sociedade Paranaense de Matemática · 23.02.2026
DOI: 10.5269/bspm.79694 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 23.02.2026. Verfasst von Mohammed Shakir Mahdi Zabiba und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The traveling salesman problem is a major challenge for researchers in mathematics and computer science. The challenge lies in the nature of its solution, which requires finding the shortest route to visit several cities only once and return to the starting point. In fact, the difficulty of solving it increases significantly as the number of cities increases. This is because the number of possible solutions grows rapidly with increasing numbers of cities. Consequently, reaching the final solution requires a longer time, which makes it belongs to the category an NP-hard problem. Therefore, this paper studies the traveling salesman problem to attempt to develop a suitable approach to reach its final solution, given its significant importance in many areas of life. In this regard, this study resulted in the design of a new algorithm to solve the linear traveling salesman problem. While there is a slight similarity between the traveling salesman problem and assignment problems in terms of the nature of the solution, this played a significant role in the design of the new algorithm. Obviously, the methodology of the new algorithm is based on the Hungarian method used to find the optimal solution to assignment problems. This, in turn, contributed to the harvesting of the most feasible solutions to all issues of the traveling salesman problem when using the new algorithm. Despite the difficulty and complexity of solving this problem, the new algorithm was characterized by its efficiency in solving the traveling salesman problem in record time and effort.
Zitieren
APA
Zabiba, M. S. M., Al-Dallal, H. A. H. J., & Hassan, A. (2026). Searching the Optimal Hamiltonian Cycle That is the Solution to the Traveling Salesman Problem. Boletim da Sociedade Paranaense de Matemática. https://doi.org/10.5269/bspm.79694
Vancouver
Zabiba MSM, Al-Dallal HAHJ, Hassan A. Searching the Optimal Hamiltonian Cycle That is the Solution to the Traveling Salesman Problem. Boletim da Sociedade Paranaense de Matemática. 2026. doi:10.5269/bspm.79694
BibTeX
@article{Zabiba2026,
author = {Zabiba, Mohammed Shakir Mahdi and Al-Dallal, Hussein A. H. J. and Hassan, Atika},
title = {Searching the Optimal Hamiltonian Cycle That is the Solution to the Traveling Salesman Problem},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
doi = {10.5269/bspm.79694}
}
EUVIMED