Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation

11 references·1 citing·48 second hop

FromToDepth

this work references cited by second hop

References

1985Discrete Choice Analysis1,362 cited
2003Choice of Travel Mode in the Theory of Planned Behavior: The Roles of Past Behavior, Habit, and Reasoned Action1,303 cited
1996A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS449 cited
2004Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review233 cited
1996Cyclic flows, Markov process and stochastic traffic assignment197 cited
2008Traffic Estimation and Optimal Counting Location Without Path Enumeration Using Bayesian Networks122 cited
1997A probit-based stochastic user equilibrium assignment model106 cited
2012Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms32 cited
2011Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Data24 cited
2012Do People Use the Shortest Path? An Empirical Test of Wardrop's First Principle11 cited
2008The K Shortest Transit Paths Choosing Algorithm in Stochastic Transit Network10 cited

Cited by

2020A Smart Path Recommendation Method for Metro Systems With Passenger Preferences10 cited

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