VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem

References

• Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math. Programming 120(2):347–380.Crossref, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Bulhoes T, Pessoa A, Protti F, Uchoa E (2018) On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46(4):389–392.Crossref, Google Scholar
• Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12:129–146.Crossref, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Damião CM, Silva JMP, Uchoa E (2023) A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. 4OR 21(1):47–71.Crossref, Google Scholar
• Errami N, Queiroga E, Sadykov R, Uchoa E (2023) VRPSolverEasy: A Python library for the exact solution of a rich vehicle routing problem. http://dx.doi.org/10.1287/ijoc.2023.0103.cd, https://github.com/INFORMSJoC/2023.0103.Google Scholar
• Freitas M, Silva JMP, Uchoa E (2023) A unified exact approach for clustered and generalized vehicle routing problems. Comput. Oper. Res. 149:106040.Crossref, Google Scholar
• Homberger J, Gehring H (1999) Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR Inform. Systems Oper. Res. 37(3):297–318.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. OR Spectrum 5(2):77–85.Crossref, Google Scholar
• Liguori PHPV, Mahjoub AR, Marques G, Sadykov R, Uchoa E (2023) Non-robust strong knapsack cuts for capacitated location-routing and related problems. Oper. Res. 71(5):1577–1595.Link, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Pecin D, Contardo C, Desaulniers G, Uchoa E (2017a) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3):489–502.Link, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E (2017b) Improved branch-cut-and-price for capacitated vehicle routing. Math. Programming Comput. 9(1):61–100.Crossref, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E, Santos H (2017c) Limited memory rank-1 cuts for vehicle routing problems. Oper. Res. Lett. 45(3):206–209.Crossref, Google Scholar
• Pessoa A, Sadykov R, Uchoa E (2018) Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2):530–543.Crossref, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math. Programming 183(1):483–523.Crossref, Google Scholar
• Polten L, Emde S (2022) Multi-shuttle crane scheduling in automated storage and retrieval systems. Eur. J. Oper. Res. 302(3):892–908.Crossref, Google Scholar
• Queiroga E, Sadykov R, Uchoa E (2021) A POPMUSIC matheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 136:105475.Crossref, Google Scholar
• Queiroga E, Frota Y, Sadykov R, Subramanian A, Uchoa E, Vidal T (2020) On the exact solution of vehicle routing problems with backhauls. Eur. J. Oper. Res. 287(1):76–89.Crossref, Google Scholar
• Roboredo M, Sadykov R, Uchoa E (2023) Solving vehicle routing problems with intermediate stops using VRPSolver models. Networks 81(3):399–416.Crossref, Google Scholar
• Røpke S (2012) Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. DTU Transport report, Department of Transport, Technical University of Denmark, Kongens Lyngby, Denmark.Google Scholar
• Sadykov R, Vanderbeck F (2021) BaPCod—A generic branch-and-price code. Technical Report No. HAL-03340548, Inria Bordeaux–Sud-Ouest, Talence, France.Google Scholar
• Sadykov R, Uchoa E, Pessoa A (2021) A bucket graph–based labeling algorithm with application to vehicle routing. Transportation Sci. 55(1):4–28.Link, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3):845–858.Crossref, Google Scholar
• Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140:105643.Crossref, Google Scholar
• Volte G, Bourreau E, Giroudeau R, Naud O (2023) Using VRPSolver to efficiently solve the differential harvest problem. Comput. Oper. Res. 149:106029.Crossref, Google Scholar