Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Finding Shortest Time-Dependent Paths in Schedule-Based Transit Networks: A Label Setting Algorithm

6 references·4 citing·37 second hop

FromToDepth

this work references cited by second hop

References

2001A Modeling Framework for Passenger Assignment on a Transport Network with Timetables122 cited
1998Travel Behaviour Research: Updating the State of Play104 cited
1998Departure Time and Path Choice Models for Intercity Transit Assignment28 cited
1999A LARGE SCALE STOCHASTIC TIMETABLE-BASED TRANSIT ASSIGNMENT MODEL FOR ROUTE AND SUB-MODE CHOICES28 cited
1996A SYSTEM OF WITHIN-DAY DYNAMIC DEMAND AND ASSIGNMENT MODELS FOR SCHEDULED INTERCITY SERVICES23 cited
1998A modeling framework for the passenger assignment on a transport network with time-tables16 cited

Cited by

2019An assignment model for public transport networks with both schedule- and frequency-based services11 cited
2021Refined choice set generation and the investigation of multi-criteria transit route choice behavior10 cited
2008The schedule-based modeling of transportation systems: recent developments.10 cited
2017Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks9 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work