Time depending shortest-path problems with applications to railway networks

DOI10.1016/0377-2217(94)E0349-GzbMath0903.90054MaRDI QIDQ1388936

Karl Nachtigall

Publication date: 5 January 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportationnetworksshortest pathspublic transportraillabel correcting methodtime depending transit network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items (8)

The constrained shortest path problem with stochastic correlated link travel times ⋮ Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting ⋮ Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems ⋮ A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks ⋮ Shortest paths in time-dependent FIFO networks ⋮ On the complexity of time-dependent shortest paths ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Vehicle dispatching with time-dependent travel times

Cites Work

• Unnamed Item
• On a multicriteria shortest path problem
• Linear and combinatorial optimization in ordered algebraic structures
• Minimax algebra
• Dioïds and semirings: Links to fuzzy sets and other applications
• Symmetric connection problems and their solution by bidirectional search
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• A New Polynomially Bounded Shortest Path Algorithm
• Properties of Labeling Methods for Determining Shortest Path Trees
• Shortest path algorithms using dynamic breadth‐first search

This page was built for publication: Time depending shortest-path problems with applications to railway networks