An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem

Authors:
Quan Lu;Maged Dessouky
Affiliations:
Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90089-0193;Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90089-0193
Venue:
Transportation Science
Year:
2004

Citing 3
Cited 6

An efficient algorithm for the minimum capacity cut problem

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
VRP with pickup and delivery

The vehicle routing problem

Air cargo pickup schedule for single delivery location

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

Transportation Science
A scatter search algorithm for solving vehicle routing problem with loading cost

Expert Systems with Applications: An International Journal
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

Operations Research
Local search heuristics for the probabilistic dial-a-ride problem

OR Spectrum
Optimizing local pickup and delivery with uncertain loads

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the multiple vehicle pickup and delivery problem (MVPDP) with the objective of minimizing the total travel cost and the fixed vehicle cost. Most of the optimization-based approaches for solving the MVPDP are developed for a restrictive hard time window or tight capacity environment that depend significantly on the reduction of the feasible solution space. We develop an alternative optimization solution approach for the MVPDP that does not require these constraints to be tight. The problem is formulated as a 0-1 integer-programming problem. A branch-and-cut algorithm is developed to optimally solve the problem. Four classes of valid inequalities for the MVPDP are proposed. By using the proposed solution approach, we were able to optimally solve problem instances of up to 5 vehicles and 17 customers on problems without clusters and up to 5 vehicles and 25 customers on problems with clusters within a stopping criterion of three CPU hours on a SUN Fire 4800 server.