Journal
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
Volume 2, Issue 2, Pages 112-133Publisher
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2008.017347
Keywords
transportation problem; mixed-integer linear program; multicommodity flow; metric inequalities; branch-and-cut
Ask authors/readers for more resources
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]
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available