The splittable pickup and delivery problem with reloads

H.L.M. Kerivin, M. Lacroix, A.R. Mahjoub and A. Quilliot

European Journal of Industrial Engineering, 2008, vol. 2, issue 2, 112-133

Abstract: 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. [Received 31 January 2007; Revised 08 August 2007; Accepted 02 October 2007]

Keywords: transportation problems; mixed-integer linear program; multicommodity flow; metric inequalities; branch-and-cut; pickup and delivery problem; PDP; reloads. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.inderscience.com/link.php?id=17347 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:2:y:2008:i:2:p:112-133

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().