An Algorithm for Loopless Optimum Paths Finding Agent System and Its Application to Multimodal Public Transit Network

The entire path deletion methods (EPDM) explore the K-th network transformation in order to prevent the predetermined K-1 number of path(s) from being re-searched in optimum path finding agent system. But, they show a critical drawback for the application in practical traffic network because loops, in which the same node and link are reappeared without limitation, can't be constrained. The purpose of this paper is to develop a method to selectively control loop-paths by applying link-label and to design the method to be utilized for analysis of intermodal transportation networks. For the fist purpose, this paper takes advantage of the link-label technique in optimum path agent. For the second purpose, the link-mode transformation technique is adopted to treat all modes passing through the same link as each separate link-feature is generated.