Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
From MaRDI portal
Publication:1753599
DOI10.1016/j.ejor.2017.03.017zbMath1403.90212OpenAlexW2593783647MaRDI QIDQ1753599
Ann-Kathrin Rothenbächer, Christian Tilk, Timo Gschwind, Stefan Irnich
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.017
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (15)
A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits ⋮ The rainbow Steiner tree problem ⋮ Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Bidirectional labeling for solving vehicle routing and truck driver scheduling problems ⋮ Wasserstein distributionally robust shortest path problem ⋮ An exact reduction technique for the k-colour shortest path problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- On an exact method for the constrained shortest path problem
- Solving resource constrained shortest path problems with LP-based methods
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- Improved branch-cut-and-price for capacitated vehicle routing
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Vehicle Routing
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
This page was built for publication: Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
