Finding the \(K\) shortest paths in a schedule-based transit network

DOI10.1016/j.cor.2010.02.005zbMath1251.90073OpenAlexW2048848130MaRDI QIDQ1761096

Shiwei He, Wangtu Xu, Rui Song, Sohail S. Chaudhry

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.02.005

zbMATH Keywords

schedule-based transit network\(K\) shortest pathstime-window constraintgeneralized cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Computing and listing \(st\)-paths in public transportation networks ⋮ Dynamic threshold P systems with delay on synapses for shortest path problems ⋮ Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network ⋮ Itinerary planning with time budget for risk-averse travelers ⋮ Stochastic user equilibrium assignment in schedule-based transit networks with capacity constraints ⋮ Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction

Uses Software

• TransCAD

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• \(k\)-shortest routing of trains on shunting yards
• The quickest path problem
• Finding the first \(K\) shortest paths in a time-window network.
• Finding \(K\) shortest looping paths in a traffic-light network
• Scheduling School Buses
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• An efficient algorithm for K shortest simple paths
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Deterministic network optimization: A bibliography
• Data Structures and Computer Science Techniques in Operations Research
• Finding the k Shortest Paths
• A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
• A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
• Fibonacci heaps and their uses in improved network optimization algorithms
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• Finding the K Shortest Loopless Paths in a Network