An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

References

• Baldacci R., Christofides N., Mingozzi A. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Ser. A (2008) 115(2):351–385Crossref, Google Scholar
• Boschetti M. A., Mingozzi A., Ricciardelli S. A dual ascent procedure for the set partitioning problem. Discrete Optim. (2008) 5(4):735–747Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming (1981a) 20(1):255–282Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks (1981b) 11(2):145–164Crossref, Google Scholar
• Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. (2006) 54(3):573–586Link, Google Scholar
• Cordeau J.-F., Laporte G., Ropke S., Golden B., Raghavan S., Wasil E. Recent models and algorithms for one-to-one pickup and delivery problems. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 327–357Crossref, Google Scholar
• Cordeau J.-F., Laporte G., Potvin J.-Y., Savelsbergh M. W. P., Barnhart C., Laporte G. Transportation on demand. Transportation (2007) (Elsevier, Amsterdam) 429–466Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Erdmann A., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with pickup and delivery. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 225–242Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40(2):342–354Link, Google Scholar
• Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54(1):7–22Crossref, Google Scholar
• Jepsen M., Petersen B., Spoorendonk S., Pisinger D. Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. (2008) 56(2):497–511Link, Google Scholar
• Li H., Lim A. A metaheuristic for the pickup and delivery problem with time windows. 13th IEEE Internat. Conf. Tools Artificial Intelligence, ICTAI-2001 (2001) DallasCrossref, Google Scholar
• Lu Q., Dessouky M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Sci. (2004) 38(4):503–514Link, Google Scholar
• Parragh S. N., Doerner K. F., Hartl R. F. A survey on pickup and delivery problems (Part I: Transportation between customers and depot). J. für Betriebswirtschaft (2008a) 58(1):21–51Crossref, Google Scholar
• Parragh S. N., Doerner K. F., Hartl R. F. A survey on pickup and delivery problems (Part II: Transportation between pickup and delivery locations). J. für Betriebswirtschaft (2008b) 58(2):81–117Crossref, Google Scholar
• Ropke S., Cordeau J.-F. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. (2009) 43(3):267–286Link, Google Scholar
• Ropke S., Cordeau J.-F., Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks (2007) 49(4):258–272Crossref, Google Scholar
• Savelsbergh M. W. P., Sol M. Drive: Dynamic routing of independent vehicles. Oper. Res. (1998) 46(4):474–490Link, Google Scholar