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

DOI10.1016/J.COR.2010.02.005MaRDI QIDQ1761096zbMATH OpenOpenAlexFDO

Authors Wangtu Xu, Shiwei He, 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

\(K\) shortest pathsgeneralized costschedule-based transit networktime-window constraint

Mathematics Subject Classification ID

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

Recommendations

• Finding theKth shortest path in a time-schedule network
• Finding the K shortest paths in a time-schedule network with constraints on arcs
• Finding the first \(K\) shortest paths in a time-window network.
• The first K minimum cost paths in a time-schedule network
• Finding \(K\) shortest looping paths with waiting time in a time--window network

Cites work

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

Cited in

(16)

• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
• Computing and listing \(st\)-paths in public transportation networks
• 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
• Finding \(K\) shortest looping paths in a traffic-light network
• Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
• Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
• Dynamic threshold P systems with delay on synapses for shortest path problems
• Trip-based path algorithms using the transit network hierarchy
• Finding the K shortest paths in a time-schedule network with constraints on arcs
• The first K minimum cost paths in a time-schedule network
• Finding theKth shortest path in a time-schedule network
• Finding the K mean-standard deviation shortest paths under travel time uncertainty
• Finding the \(k\) shortest simple paths: time and space trade-offs
• Stochastic user equilibrium assignment in schedule-based transit networks with capacity constraints
• Navigating network availability: a shortest path approach to UAV traffic routing

Describes a project that uses

Uses Software

• TransCAD

This page was built for publication: Finding the \(K\) shortest paths in a schedule-based transit network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761096)