Dynamic graph generation for the shortest path problem in time expanded networks
DOI10.1007/S10107-012-0610-3zbMATH Open1303.90116OpenAlexW2052118269MaRDI QIDQ2436645FDOQ2436645
Frank Fischer, Christoph Helmberg
Publication date: 25 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0610-3
Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Nominal and robust train timetabling problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Time-dependent scheduling
- Modeling and Solving the Train Timetabling Problem
- An Introduction to Network Flows over Time
- Railway track allocation: Models and methods
- Models for railway track allocation
- A survey of dynamic network flows
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
- Towards solving very large scale train timetabling problems by Lagrangian relaxation
- A column generation approach to train timetabling on a corridor
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Dynamic shortest paths minimizing travel times and costs
- The shortest path problem on large-scale real-road networks
- A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
- Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling
- Title not available (Why is that?)
Cited In (10)
- Branch-and-refine for solving time-expanded MILP formulations
- Layered graph approaches for combinatorial optimization problems
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- A minmax regret version of the time-dependent shortest path problem
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- A preconditioned iterative interior point approach to the conic bundle subproblem
Uses Software
This page was built for publication: Dynamic graph generation for the shortest path problem in time expanded networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436645)
