Trip-Based Path Algorithms Using the Transit Network HierarchyAlireza Khani, Mark D. Hickman, Hyunsoo Noh2014-07-26articleNetworks and Spatial Economics50 citationsclosedNo readable copy stored yet — this record is metadata only.Transportation Planning and OptimizationUrban Transport and AccessibilityTransportation and Mobility InnovationsAbstractNo abstract was published for this record.Citations in this libraryStored only when both papers are in the corpus — 50 citations exist upstream.References1989Optimal strategies: A new assignment model for transit networks1980Some developments in equilibrium traffic assignment1993Transit Assignment for Congested Public Transport Systems: An Equilibrium Model1988Equilibrium traffic assignment for large scale transit networks2002Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks2001A Doubly Dynamic Schedule-based Assignment Model for Transit Networks2008Schedule-based transit assignment model with travel strategies and capacity constraints2001A Modeling Framework for Passenger Assignment on a Transport Network with TimetablesCited by2018Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network2016Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale application2019An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability2016Modeling park-and-ride location choice of heterogeneous commuters2019Agent-Based Dynamic Traffic Assignment with Information Mixing2020A schedule-based timetable model for congested transit networks2022Modeling the effect of real-time crowding information (RTCI) on passenger distribution in trains2018A Subjective Optimal Strategy for Transit Simulation Models