An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem

References

• Desaulniers G., Desrosiers J., Erdmann A., Solomon M. M., Soumis F., Toth P., Vigo D. The VRP with pickup and delivery. The Vehicle Routing Problems (2001) (SIAM, Philadelphia, PA) 225–242Google Scholar
• Desrosiers J., Dumas Y., Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. (1986) 6:301–325Crossref, Google Scholar
• Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22Crossref, Google Scholar
• Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Oper. Res. (1989) 37:319–328Link, Google Scholar
• Ioachim I., Desrosiers J., Dumas Y., Solomon M. M., Villeneuve D. A request clustering algorithm for door-to-door handicapped “transportation.”. Transportation Sci. (1995) 29:63–78Link, Google Scholar
• Kalantari B., Hill A. V., Arora S. R. An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. (1985) 22:377–386Crossref, Google Scholar
• Laporte G., Norbert Y., Desrochers M. Optimal routing under capacity and distance restrictions. Oper. Res. (1985) 33:1050–1073Link, Google Scholar
• Madsen O. B. G., Ravn H. F., Rygaard J. M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. (1995) 60:193–208Crossref, Google Scholar
• Padberg M., Rinaldi G. An efficient algorithm for the minimum capacity cut problem. Math. Programming (1990) 47:19–36Crossref, Google Scholar
• Padberg M., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100Crossref, Google Scholar
• Psaraftis H. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Sci. (1980) 14:130–154Link, Google Scholar
• Psaraftis H. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Sci. (1983) 17:351–357Link, Google Scholar
• Ruland K. S., Rodin E. Y. The pickup and delivery problem: Faces and branch-and-cut algorithm. Comput. Math. Appl. (1997) 33(12):1–13Crossref, Google Scholar
• Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29:17–29Link, Google Scholar
• Savelsbergh M. W. P., Sol M. Drive: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
• Toth P., Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Sci. (1997) 31:60–71Link, Google Scholar