Abstract
Many transportation systems can be suitably represented as Discrete Event Systems. This is the case of the multimodal urban transportation network considered in this paper. In the simulation tool designed to reproduce its functioning, a module is included which allows to find the best multimodal paths between any pair of nodes in the network. The basic algorithm is an ad-hoc modified version of the Dijkstra algorithm to find the shortest paths in an oriented graph. Such an algorithm is complicated to include some choices left to users, regarding the number of paths required, the maximum time to travel, and the modes of transport to use. Then, a heuristic algorithm to find the best multimodal paths in a network integrating public and private modes of transport is proposed.
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 callDisclaimer: 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.
