An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading

References

• Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2):414–426.Link, Google Scholar
• Battarra M, Cordeau J-F, Iori M (2014) Pickup-and-delivery problems for goods transportation. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia), 161–191.Crossref, Google Scholar
• Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(1):1–31.Crossref, Google Scholar
• Bomdorfer R (1998) Aspects of set packing, partitioning, and covering. PhD thesis, Technical University of Berlin, Berlin.Google Scholar
• Cherkesly M (2015) Le problème de tournées de véhicules avec cueillettes, livraisons, fenêtes de temps en contraintes de manutention. PhD thesis, École Polytechnique de Montréal, Montréal.Google Scholar
• Cherkesly M (2017) Discussion via email of the use of rounding for distances and travel times, February 1.Google Scholar
• Cherkesly M, Desaulniers G, Laporte G (2015) Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transportation Sci. 49(4):752–766.Link, Google Scholar
• Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573–586.Link, Google Scholar
• Cordeau J-F, Laporte G (2003) The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. Quart. J. Belgian French Italian Oper. Res. Soc. 1(2):89–101.Google Scholar
• Desrosiers J, Dumas Y, Soumis F (1988) The multiple vehicle dial-a-ride problem. Daduna JR, Wren A, eds. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, vol. 308 (Springer, Berlin), 15–27.Google Scholar
• Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport. Working paper, Les Cahiers du GERAD, HEC Montréal.Google Scholar
• Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1):7–22.Crossref, Google Scholar
• Gurobi Optimization (2017) Gurobi Optimizer Reference Manual, version 7.0. https://www.gurobi.com/documentation/7.0/refman/index.html.Google Scholar
• Ioachim I, Desrosiers J, Dumas Y, Solomon MM, Villeneuve D (1995) A request clustering algorithm for door-to-door handicapped transportation. Transportation Sci. 29(1):63–78.Link, Google Scholar
• Johnson DB (1975) Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1):77–84.Crossref, Google Scholar
• Lu Q, Dessouky M (2004) An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Sci. 38(4):503–514.Link, Google Scholar
• Parragh SN, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems, part I: Transportation between customers and depot. J. für Betriebswirtschaft 58(1):21–51.Crossref, Google Scholar
• Parragh SN, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems, part II: Transportation between pickup and delivery locations. J. Betriebswirtschaft 58(2):81–117.Crossref, Google Scholar
• Pollaris H, Braekers K, Caris A, Janssens GK, Limbourg S (2015) Vehicle routing problems with loading constraints: State-of-the-art and future directions. OR Spectrum 37(2):297–330.Crossref, Google Scholar
• Ropke S, Cordeau J-F (2009) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267–286.Link, Google Scholar
• Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258–272.Crossref, Google Scholar
• Savelsbergh M, Sol M (1998) Drive: Dynamic routing of independent vehicles. Oper. Res. 46(4):474–490.Link, Google Scholar
• Sedgewick R (2001) Algorithms in C, Part 5: Graph Algorithms, 3rd ed. (Addison Wesley Professional, Reading, MA).Google Scholar
• Szwarcfiter JL, Lauer PE (1976) A search strategy for the elementary cycles of a directed graph. BIT Numer. Math. 16(2):192–204.Crossref, Google Scholar
• Toth P, Vigo D (2014) Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (SIAM, Philadelphia).Crossref, Google Scholar