Genetic Algorithm Based Solution for TSP on a Sphere

Aybars Uğur; Serdar Korukoğlu; Ali Çalıskan; Muhammed Cinsdikici; Ali Alp

doi:10.3390/mca14030219

You are currently viewing a new version of our website. To view the old version click .

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).

Article

1 December 2009

Genetic Algorithm Based Solution for TSP on a Sphere

and

Department of Computer Engineering, University of Ege,35100 Bornova-Izmir, Turkey

Department of Mathematics, Faculty of Science, University of Ege, 35100 Bornova-Izmir, Turkey

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

Version Notes

Order Reprints

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.

Keywords:

TSP; Genetic Algorithms; Spherical Geometry; Optimization

Article Metrics

Citations

Article Access Statistics

Journal Statistics

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

Elastic-Plastic Stress Analysis of Thermoplastic Matrix Laminated Composite Beams

The Effects of Duct Shape on the Nusselt Number