Abstract
We present a practical algorithm that finds the shortest round trip route rounding arbitrary plural nodes on road network data that we made. This algorithm is based on our intuition. When we look at a road map and decide the shortest round trip routes, we should imagine a frame including all tour nodes. The frame is composed of a convex hull. The time complexity is compared between the proposed algorithm and a greedy method which is one of the approximation methods. The practice time of the above two methods and the Hopfield type neural network which is said to be effective for solving a travelling salesman problem, are compared among them each other, too. The accuracy of the proposed algorithm is then compared to an exhaustive search, the greedy method, and the Hopfield type neural network on road network data. From these results, it is shown that the proposed algorithm is effective for finding round trip routes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEJ Transactions on Electronics, Information and Systems
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.
