A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries

References

• Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40(2):226–234.Link, Google Scholar
• 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
• Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15:1–31.Crossref, Google Scholar
• Bruck BP, Iori M (2017) Non-elementary formulations for single vehicle routing problems with pickups and deliveries. Oper. Res. 65(6):1597–1614.Link, Google Scholar
• Castro MP, Cire AA, Beck JC (2020) An MDD-based Lagrangian approach to the multicommodity pickup-and-delivery TSP. INFORMS J. Comput. 32(2):263–278.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
• Dror M, Trudeau P (1989) Savings by split delivery routing. Transportation Sci. 23(2):141–145.Link, Google Scholar
• Dumitrescu I, Ropke S, Cordeau JF, Laporte G (2010) The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm. Math. Programming 121:269–305.Crossref, Google Scholar
• Gouveia L, Ruthmair M (2015) Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63:56–71.Crossref, Google Scholar
• Haddad MN, Martinelli R, Vidal T, Martins S, Ochi LS, Souza MJF, Hartl R (2018) Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. 270(3):1014–1027.Crossref, Google Scholar
• Hernández-Pérez H, Salazar-González JJ (2009) The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196(3):987–995.Crossref, Google Scholar
• Lai M, Battarra M, Di Francesco M, Zuddas P (2015) An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66:1222–1235.Crossref, Google Scholar
• Letchford AN, Salazar-González JJ (2016) Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Eur. J. Oper. Res. 251(1):74–84.Crossref, Google Scholar
• Nagy G, Wassan NA, Speranza MG, Archetti C (2015) The vehicle routing problem with divisible deliveries and pickups. Transportation Sci. 49(2):271–294.Link, Google Scholar
• Nowak M, Ergun Ö, White CC III (2008) Pickup and delivery with split loads. Transportation Sci. 42(1):32–43.Link, Google Scholar
• Nowak M, Ergun O, White CC III (2009) An empirical study on the benefit of split loads with the pickup and delivery problem. Eur. J. Oper. Res. 198(3):734–740.Crossref, Google Scholar
• Nowak M, Hewitt M, White CC III (2012) Precedence constrained pickup and delivery with split load. Internat. J. Logist. Res. Appl. 15(1):1–14.Crossref, Google Scholar
• Öncan T, Aksu DT, Şahin G, Şahin M (2011) A branch and cut algorithm for the multi-vehicle one-to-one pickup and delivery problem with split loads, IEEE Internat. Conf. Indust. Engrg Engrg Management (IEEE, Piscataway, NJ), 1864–1868.Google Scholar
• Parragh SN, de Sousa JP, Almada-Lobo B (2015) The dial-a-ride problem with split requests and profits. Transportation Sci. 49(2):311–334.Link, Google Scholar
• Parragh SN, Doerner K, Hartl RF (2008) A survey on pickup and delivery problems. J. Betriebswirtschaft 58:81–117.Crossref, Google Scholar
• Psaraftis H (2011) A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases. Eur. J. Oper. Res. 215(3):572–580.Crossref, Google Scholar
• Şahin M, Çavuşlar G, Öncan T, Şahin G, Aksu DT (2013) An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads. Transportation Res. Part C: Emerging Technol. 27:169–188.Crossref, Google Scholar
• Salazar-González JJ, Santos-Hernández B (2015) The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transportation Res. Part B: Methodological 75:58–73.Crossref, Google Scholar