An Application on Mobile Devices with Android and IOS Operating Systems Using Google Maps APIs for the Traveling Salesman Problem

被引:3
作者
Ilhan, Ilhan [1 ]
机构
[1] Necmettin Erbakan Univ, Dept Mechatron Engn, Fac Engn & Architecture, TR-42090 Konya, Turkey
关键词
ALGORITHM;
D O I
10.1080/08839514.2017.1339983
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nowadays, the Traveling Salesman Problem (TSP) is one of the most studied combinational optimization problems that researchers study. Although it is easy to define, its solution is hard. Therefore, it is one of the NP-hard problems in the research literature. It can be used to solve real-life problems such as route planning and scheduling, and transportation and logistics applications. In this study, for TSP, an interface that can run on mobile devices using Android and IOS operating systems is developed. Real-world data are used online by the interface. Locations, and the distance between them, are obtained instantly by Google Maps APIs. Genetic (GA) and ant colony optimization (ACO) algorithms are used to solve the TSP. Furthermore, users have also been allowed to conduct trials for different parameter values. The application developed has been tested on two different datasets. The test results show that for the determination of the optimum route, the ACO algorithm is better than the GA. However, when considering the run times, GA works much faster than ACO.
引用
收藏
页码:332 / 345
页数:14
相关论文
共 25 条
[1]  
[Anonymous], ARTIFICIAL INTELLIGE
[2]  
[Anonymous], P FIKUSZ 89
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[4]  
[Anonymous], ERGEBNISSE MATH K
[5]  
[Anonymous], INT C AUT LANG PROGR
[6]  
[Anonymous], TRAVELING SALESMAN P
[7]  
[Anonymous], GLOB SMARTPH SHIPM G
[8]  
[Anonymous], INT J ENG COMPUTER
[9]  
[Anonymous], 1992, Ph.D. thesis
[10]   Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems [J].
Arora, S .
JOURNAL OF THE ACM, 1998, 45 (05) :753-782