Recent Models and Algorithms for One-to-One Pickup and Delivery Problems

Jean-Francois Cordeau, Gilbert Laporte, Stefan Røpke

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

1661 Downloads (Pure)

Abstract

In one-to-one Pickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people, in which case the problem is often called the dial-a-ride problem. In recent years, there have been several significant developments in the area of exact and heuristic algorithms for PDPs. The purpose of this article is to report on these developments. It contains two main sections devoted to single vehicle and multi-vehicle problems, respectively. Each section is subdivided into two parts, one on exact algorithms and one on heuristics.
Keyword: tabu search,Pickup and delivery,column generation,one-to-one,branch-and-cut,dial-a-ride
Original languageEnglish
Title of host publicationThe Vehicle Routing Problem : Latest Advances and New Challenges
EditorsBruce Golden, S. Raghavan, Edward Wasil
PublisherSpringer
Publication date2008
Pages327-357
ISBN (Print)978-0-387-77777-1
Publication statusPublished - 2008
Externally publishedYes

Fingerprint Dive into the research topics of 'Recent Models and Algorithms for One-to-One Pickup and Delivery Problems'. Together they form a unique fingerprint.

Cite this