A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
From MaRDI portal
Publication:1626744
Recommendations
- Shortest paths in piecewise continuous time-dependent networks
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Improved approximation for time-dependent shortest paths
Cited in
(11)- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Branch-and-refine for solving time-expanded MILP formulations
- Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary
- An iterative graph expansion approach for the scheduling and routing of airplanes
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Sparse dynamic discretization discovery via arc-dependent time discretizations
This page was built for publication: A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626744)
