Abstract

The basic building block of a schedule-based transit assignment problem is to find an optimal path for a passenger, given an origin node, a destination node and departure or arrival preferences. The schedule-based shortest time-dependent transit shortest path does not minimize always the total time of a trip; rather, it uses weight factors and preferences regarding departure and arrivals to determine the best path which satisfies the trip specifications. The algorithm, which is based on a label-setting scheme (Dijkstra, 1959) tracks both times (to determine the feasibility of a path) and cost (to determine the attractiveness of a path). This paper describes the model and the algorithm for this schedule-based deterministic temporal shortest path model.

Full Text

Published Version

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 call

Disclaimer: 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.