The splittable pickup and delivery problem with reloads
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]
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 2 (2008)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=210|
When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:2:y:2008:i:2:p:112-133. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.