Abstract
Traveling around a city and making transit in certain areas is called a city tour. Furthermore, determining the optimal city tour route can be considered as a traveling salesman problem. There are many kinds of algorithms to solve this, one of which is the Genetic Algorithm (GA). In developing the City Tour application, a platform is needed to be taken to various places anywhere and anytime. Finally, we developed an application that runs on mobile devices. This application is built on the Android platform so that its use can be more efficient. Furthermore, it can be concluded that the GA applied to the Android-based City Tour Application is reliable to determine city tour routes; this is evidenced by comparing GA with the brute force method, where GA provides optimum results with less running time.
Highlights
Travelling is an activity that many people do every day
If we look at the computational discipline, determining the optimal city tour route can be considered as a traveling salesman problem
We developed an application that runs on mobile devices
Summary
Travelling is an activity that many people do every day. It is taken to meet the needs of tourism and work. If we look at the computational discipline, determining the optimal city tour route can be considered as a traveling salesman problem. Traveling Salesman Problem is a category of NP-Hard Problem where the problem is difficult to solve so that there are many variations of methods that can be used [1][2][3]. Traveling Salesman Problem (TSP) is a problem that is difficult to solve because many route combinations may occur along with the number of cities to be visited and must pay attention to the applicable rules [4]. One method often used to solve NP-Hard problems is an algorithm adapted from nature or an evolutionary algorithm. GA has developed iJIM ‒ Vol 15, No 14, 2021
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Interactive Mobile Technologies (iJIM)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.