Genetic algorithm based solution for TSP on a sphere
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
Anahtar Kelimeler
Genetic algorithms, Optimization, Spherical geometry, TSP
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
14
Sayı
3
