Genetic Algorithm Based Solution for TSP on a Sphere
Makaleler > Tam Makale · 2009
Yazarlar: Aybars UĞUR, Mustafa Serdar KORUKOĞLU, Ali Çalıskan, Muhammed Cinsdikici, Ali Alp
Mathematical and Computational Applications, Uluslararası, 2009, cilt 14, ss 219-228
DOI: 10.3390/mca14030219
Özet
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.