Thumbnail - Request a copy

The splittable pickup and delivery problem with reloads

Kerivin, Hervé; Lacroix, Mathieu; Mahjoub, Ali Ridha; Quilliot, Alain (2008), The splittable pickup and delivery problem with reloads, European Journal of Industrial Engineering, 2, 2, p. 112-133. http://dx.doi.org/10.1504/EJIE.2008.017347

Type
Article accepté pour publication ou publié
Date
2008
Journal name
European Journal of Industrial Engineering
Volume
2
Number
2
Publisher
Inderscience Enterprises Limited
Pages
112-133
Publication identifier
Metadata
Show full item record
Author(s)
Kerivin, Hervé
Lacroix, Mathieu cc
Mahjoub, Ali Ridha
Quilliot, Alain
Abstract (EN)
In this paper, we consider a variant of the Pickup and Delivery Problem (PDP), where any demand may be dropped off elsewhere other than its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid inequalities for the problem along with separation routines. Based on these results, we develop a branch-and-cut algorithm for the problem, and present some computational results.
Subjects / Keywords
Reloads; PDP; Pickup and delivery problem; Branch-and-cut; Metric inequalities; Multicommodity flow; Mixed-integer linear program; Transportation problems