Skip to Content
  • Article
  • Open Access

1 December 2009

10 Pages

Genetic Algorithm Based Solution for TSP on a Sphere

,
,
,
and
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.

Abstract

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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.