Abstract
Kediri is a transit city and has potential in the tourism sector. This potential will increase along with the number of tourists who come to the tourism object. To make it easier for tourists to visit tourist attractions in Kediri, a guide is needed that can be easily accessed by tourists to go to the desired tourist attractions. Therefore, a city tour modeling system needs to be made that can provide recommendations for optimum routes that can be passed to visit these tourist attractions. On the other hand, many computational studies have examined research on route optimization using the approach of traveling salesman problem and dynamic programming known as the appropriate method to solve these problems. However, the solutions provided are still in the form of studies that have not been implemented on a mobile device. Therefore, in this study, an application will be developed on an Android mobile device that is capable of solving the problem of modeling a city tour in Kediri based on dynamic programming. The application that was built was able to provide recommendations for a city tour route by determining the optimum route that connects tourist attractions to be visited using the traveling salesman problem concept. The test results show that the application features can work and the dynamic programming method applied is able to find the optimum city tour route even though it can only determine the route to connect 9 tourist sites due to the limited computing power on Android devices
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.