A USER PREFERABLE K-SHORTEST PATH ALGORITHM FOR INTERMODAL NETWORK

抄録

This study discusses seamlessly integrating multiple modes of transportation networks and calculating the User Preferable K-Shortest paths in the network between origin and destination with a new algorithm based on improved Link Penalty. A projection method has been used to connect different networks. Three aspects of users’ preferences have been evaluated to set the rate of link penalties in each step that k-shortest paths will be generated. Link similarities are considered respectively in different mode and Partial Overlap has been introduced to be a criterion for iteration. Users can set their constraints and will get very precise and efficient travel information through GIS. Due to the simplification of the topological structure and flexibility of the k-shortest path algorithm, it’s very easy for developers to update their existing traveler information system.