Next Article in Journal
The Effects of Duct Shape on the Nusselt Number
Previous Article in Journal
Elastic-Plastic Stress Analysis of Thermoplastic Matrix Laminated Composite Beams
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Articles in this Issue were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence. Articles are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
Open AccessArticle

Genetic Algorithm Based Solution for TSP on a Sphere

1
Department of Computer Engineering, University of Ege,35100 Bornova-Izmir, Turkey
2
Department of Mathematics, Faculty of Science, University of Ege, 35100 Bornova-Izmir, Turkey
3
International Computer Institute, University of Ege, 35100 Bornova-Izmir, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2009, 14(3), 219-228; https://doi.org/10.3390/mca14030219
Published: 1 December 2009
The Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial optimization problems. Various exact or approximation algorithms are devised for solving Euclidean TSP that determine the shortest route through a given set of points in 3-dimensional Euclidean space. In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a sphere. A Java-based interactive visualization tool is also developed using Java 3D and optimization results obtained for different problem sizes are presented.
Keywords: TSP; Genetic Algorithms; Spherical Geometry; Optimization TSP; Genetic Algorithms; Spherical Geometry; Optimization
MDPI and ACS Style

Uğur, A.; Korukoğlu, S.; Çalıskan, A.; Cinsdikici, M.; Alp, A. Genetic Algorithm Based Solution for TSP on a Sphere. Math. Comput. Appl. 2009, 14, 219-228.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop