Welcome to the InfoSci Platform
Reference Hub1
Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface

Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface

Yusuf Sahin, Erdal Aydemir, Kenan Karagul, Sezai Tokat, Burhan Oran
Copyright: © 2021 |Pages: 20
ISBN13: 9781799854425|ISBN10: 1799854426|ISBN13 Softcover: 9781799854432|EISBN13: 9781799854449
DOI: 10.4018/978-1-7998-5442-5.ch005
Cite Chapter Cite Chapter

MLA

Sahin, Yusuf, et al. "Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface." Interdisciplinary Perspectives on Operations Management and Service Evaluation, edited by Panagiotis Manolitzas, et al., IGI Global, 2021, pp. 94-113. https://doi.org/10.4018/978-1-7998-5442-5.ch005

APA

Sahin, Y., Aydemir, E., Karagul, K., Tokat, S., & Oran, B. (2021). Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface. In P. Manolitzas, C. Zopounidis, M. Talias, E. Grigoroudis, & N. Matsatsinis (Eds.), Interdisciplinary Perspectives on Operations Management and Service Evaluation (pp. 94-113). IGI Global. https://doi.org/10.4018/978-1-7998-5442-5.ch005

Chicago

Sahin, Yusuf, et al. "Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface." In Interdisciplinary Perspectives on Operations Management and Service Evaluation, edited by Panagiotis Manolitzas, et al., 94-113. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-7998-5442-5.ch005

Export Reference

Mendeley
Favorite

Abstract

Traveling salesman problem in which all the vertices are assumed to be on a spherical surface is a special case of the conventional travelling salesman problem. There are exact and approximate algorithms for the travelling salesman problem. As the solution time is a performance parameter in most real-time applications, approximate algorithms always have an important area of research for both researchers and engineers. In this chapter, approximate algorithms based on heuristic methods are considered for the travelling salesman problem on the sphere. Firstly, 28 test instances were newly generated on the unit sphere. Then, using various heuristic methods such as genetic algorithms, ant colony optimization, and fluid genetic algorithms, the initial solutions for solving test instances of the traveling salesman problem are obtained in Matlab®. Then, the initial heuristic solutions are used as input for the 2-opt algorithm. The performances and time complexities of the applied methods are analyzed as a conclusion.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.