Abstract
Abstract In this paper we study two shortest paths problems in discrete dynamic hetWorks: the one-to-all for one departure time interval, and the all-to-one for all departure time intervals. Early results are revisited. New properties of these problems are established and exploited in developing solution algorithms. A new and simple solution algorithm for the all-to-one fastest paths problem for all departure time intervals is proposed. It is proved, analytically, that the new solution algorithm has an optimal running time complexity that equals the complexity of the problem. Computer implementations and experimental evaluations of four solution algorithms support analytical results and demonstrate the efficiency of the proposed algorithm. We expect our findings to be of major benefit to research and development activities in the field of dynamic management of large-scale transportation systems.
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.
