Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis

Authors:
Gerardo Berbeglia;Gilles Pesant;Louis-Martin Rousseau
Affiliations:
Melbourne Business School, Carlton, 3053, Australia;Département de génie informatique et génie logiciel, École Polytechnique de Montréal, Montréal H3T 2A7, Canada;Département de mathématiques et de génie industriel, École Polytechnique de Montréal, Montréal H3T 2A7, Canada
Venue:
Transportation Science
Year:
2012

Citing 6
Cited 3

Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
Complete register allocation problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The one-commodity pickup-and-delivery travelling salesman problem

Combinatorial optimization - Eureka, you shrink!
Principles of Constraint Programming

Principles of Constraint Programming
The Black and White Traveling Salesman Problem

Operations Research
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Transportation Science

Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Transportation Science
Large neighborhood search for dial-a-ride problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Reoptimizing the rural postman problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the pickup and delivery problem (PDP) a fleet of vehicles must serve customers' requests, which consist of transporting objects from their origins to their destinations. We introduce the PDP with fixed partial routes (PDP-FPR), in which some partial routes are given, and the problem consists in obtaining a solution (a set of routes) that includes those partial routes. We have analyzed the complexity of determining whether or not a feasible solution exists for this problem as well as for some relaxations of it. Checking the feasibility of the PDP-FPR and some of its relaxations is shown to be NP-complete, whereas for other relaxations, the problem was proved to be polynomial-time solvable.