An Algorithm for Finding Round Trip Routes on Digital Road Maps

Abstract

A trend towards improving automobile usage from safety, economic, efficiency and convenience points of view has actively come about. One of these trends involves the usage of computerized road net works. As a part of this study, we have studied investigation of round trip routes for supporting transportation systems. This paper has proposed a practical algorithm that finds the shortest round trip tour rounding arbitrary plural nodes on digital road maps. This method is based on our intuition. When we look at the 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 accuracy of the proposed algorithm and that of the former method is compared on the digital road maps. The time complexity of above algorithms are compared, also. From these results, it is shown that the proposed algorithm is effective for the round trip routes algorithm.