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

Authors:
Stefan Ropke;Jean-François Cordeau
Affiliations:
Department of Transport, Technical University of Denmark, 2800 Kgs. Lyngby, Denmark;HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada
Venue:
Transportation Science
Year:
2009

Citing 28
Cited 12

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
The vehicle routing problem

The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP

The vehicle routing problem
Set-covering-based algorithms for the capacitated VRP

The vehicle routing problem
VRP with pickup and delivery

The vehicle routing problem
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Drive: Dynamic Routing of Independent Vehicles

Operations Research
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
A Metaheuristic for the Pickup and Delivery Problem with Time Windows

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Solving a Practical Pickup and Delivery Problem

Transportation Science
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases

Transportation Science
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

INFORMS Journal on Computing
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem

Transportation Science
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Transportation Science
Models and branch-and-cut algorithms for pickup and delivery problems with time windows

Networks
New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Operations Research
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows

Transportation Science
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

Mathematical Programming: Series A and B
Accelerated label setting algorithms for the elementary resource constrained shortest path problem

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

Discrete Optimization

Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation

Computers and Operations Research
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays

Discrete Applied Mathematics
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

Operations Research
Dynamic pickup and delivery with transfers

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
A matheuristic for the dial-a-ride problem

INOC'11 Proceedings of the 5th international conference on Network optimization
The pickup and delivery problem with cross-docking opportunity

ICCL'11 Proceedings of the Second international conference on Computational logistics
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment

Computers and Operations Research
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

OR Spectrum
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Networks
Solving vehicle routing problems using an enhanced clarke-wright algorithm: a case study

ICCL'12 Proceedings of the Third international conference on Computational Logistics
The Pickup and Delivery Problem with Cross-Docking

Computers and Operations Research
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the pickup and delivery problem with time windows vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and nonelementary shortest path problem. Valid inequalities are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the pickup and delivery problem with time windows are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm.