Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis

In the pickup and delivery problem (PDP) a fleet of vehicles must serve customers' requests, which consist of transporting objects from their origins to their destinations. We introduce the PDP with fixed partial routes (PDP-FPR), in which some partial routes are given, and the problem consists in obtaining a solution (a set of routes) that includes those partial routes. We have analyzed the complexity of determining whether or not a feasible solution exists for this problem as well as for some relaxations of it. Checking the feasibility of the PDP-FPR and some of its relaxations is shown to be NP-complete, whereas for other relaxations, the problem was proved to be polynomial-time solvable.

[1]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Gilles Pesant,et al.  Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming , 2011, Transp. Sci..

[4]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[5]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[6]  Gur Mosheiov,et al.  The Travelling Salesman Problem with pick-up and delivery , 1994 .

[7]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[8]  Gilbert Laporte,et al.  The Black and White Traveling Salesman Problem , 2006, Oper. Res..

[9]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[10]  Patrick Prosser,et al.  Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics , 2000, J. Heuristics.

[11]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[12]  Ravi Sethi,et al.  Complete register allocation problems , 1973, SIAM J. Comput..

[13]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[14]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[15]  Juan José Salazar González,et al.  The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.

[16]  Dario Pacciarelli,et al.  A Rollout Metaheuristic for Job Shop Scheduling Problems , 2004, Ann. Oper. Res..