Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Authors:
Giovanni Righini;Matteo Salani
Affiliations:
Dipartimento di Tecnologie dell'Informazione, Universití degli Studi di Milano, via Bramante 65, 26013 Crema, Italy;Dipartimento di Tecnologie dell'Informazione, Universití degli Studi di Milano, via Bramante 65, 26013 Crema, Italy
Venue:
Discrete Optimization
Year:
2006

Citing 4
Cited 18

Set-covering-based algorithms for the capacitated VRP

The vehicle routing problem
Resource Constrained Shortest Paths

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Operations Research Letters

Formulations and exact algorithms for the vehicle routing problem with time windows

Computers and Operations Research
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

Computers and Operations Research
Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Computers and Operations Research
A Column Generation Algorithm for a Rich Vehicle-Routing Problem

Transportation Science
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Transportation Science
Constraint-specific recovery network for solving airline recovery problems

Computers and Operations Research
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

INFORMS Journal on Computing
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

INFORMS Journal on Computing
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem

Computers and Operations Research
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows

INFORMS Journal on Computing
Vehicle routing problem with time windows based on adaptive bacterial foraging optimization

ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
Optimal solutions for routing problems with profits

Discrete Applied Mathematics
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment

Transportation Science
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows

Transportation Science
A set-covering based heuristic algorithm for the periodic vehicle routing problem

Discrete Applied Mathematics
Solving elementary shortest-path problems as mixed-integer programs

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

When vehicle routing problems with additional constraints, such as capacity or time windows, are solved via column generation and branch-and-price, it is common that the pricing subproblem requires the computation of a minimum cost constrained path on a graph with costs on the arcs and prizes on the vertices. A common solution technique for this problem is dynamic programming. In this paper we illustrate how the basic dynamic programming algorithm can be improved by bounded bi-directional search and we experimentally evaluate the effectiveness of the enhancement proposed. We consider as benchmark problems the elementary shortest path problems arising as pricing subproblems in branch-and-price algorithms for the capacitated vehicle routing problem, the vehicle routing problem with distribution and collection and the capacitated vehicle routing problem with time windows.