{"title":"Comparison of three search algorithms for mobile trip planner for Eskisehir city","authors":"A. Aydin, Sedat Telçeken","doi":"10.1109/INISTA.2015.7276791","DOIUrl":null,"url":null,"abstract":"The comparison of three searching algorithms; A*, Ant Colony Optimization and Genetic Algorithms to solve the Traveler Salesman Problem for a mobile trip planning application for Eskisehir City, Turkey, is presented in this paper. The algorithms work on more than 30 point-of-interests and 150 sub-point-of-interests. The algorithms are compared with respect to their running times for scenarios with different number of point-of-interests. Experimental results show that the A* algorithm is 400-600% faster than the other algorithms. The mobile application calculates the best route trip planned according to the traveler's preferences on categorized points-of-interests. The mobile application also recommends alternative route plans during the trip when the traveler is ahead or behind the schedule.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INISTA.2015.7276791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The comparison of three searching algorithms; A*, Ant Colony Optimization and Genetic Algorithms to solve the Traveler Salesman Problem for a mobile trip planning application for Eskisehir City, Turkey, is presented in this paper. The algorithms work on more than 30 point-of-interests and 150 sub-point-of-interests. The algorithms are compared with respect to their running times for scenarios with different number of point-of-interests. Experimental results show that the A* algorithm is 400-600% faster than the other algorithms. The mobile application calculates the best route trip planned according to the traveler's preferences on categorized points-of-interests. The mobile application also recommends alternative route plans during the trip when the traveler is ahead or behind the schedule.