Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules

1 references·16 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1971A probabilistic multipath traffic assignment model which obviates path enumeration843 cited

Cited by

2010Finding the K shortest paths in a schedule-based transit network67 cited
2003An extended model and procedural framework for planning multi-modal passenger journeys63 cited
2004Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services61 cited
2007Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network51 cited
2014Trip-Based Path Algorithms Using the Transit Network Hierarchy50 cited
2012An elastic demand schedule-based multimodal assignment model for the simulation of high speed rail (HSR) systems40 cited
2012A Multimodal Trip Planning System With Real-Time Traffic and Transit Information36 cited
2002Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems34 cited
1999A schedule‐based time‐dependent trip assignment model for transit networks33 cited
2001A schedule‐based dynamic transit network model — Recent advances and prospective future research33 cited
2012Intermodal Path Algorithm for Time-Dependent Auto Network and Scheduled Transit Service31 cited
2004The Schedule-Based Approach in Dynamic Transit Modelling: A General Overview30 cited

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

2007

A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search

29 cited

2019An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability29 cited

2007An algorithm for finding reasonable paths in transit networks27 cited

2012Dynamic journeying under uncertainty24 cited