RouteOpt: An Open-Source Modular Exact Solver for Vehicle Routing Problems

References

• Alibaba DAMO Academy Decision Intelligence Laboratory (2026) MindOpt: Optimization solver. Accessed May 13, 2026, https://www.alibabacloud.com/en/product/optimization_solver?_p_lc=1.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: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
• Balster I, Bulhões T, Munari P, Pessoa AA, Sadykov R (2023) A new family of route formulations for split delivery vehicle routing problems. Transportation Sci. 57(5):1359–1378.Link, Google Scholar
• Bulhoes T, Sadykov R, Uchoa E (2018a) A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93:66–78.Crossref, Google Scholar
• Bulhoes T, Pessoa A, Protti F, Uchoa E (2018b) On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46(4):389–392.Crossref, Google Scholar
• Chvátal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(4):305–337.Crossref, Google Scholar
• Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Sci. 6(1):80–91.Link, Google Scholar
• Errami N, Queiroga E, Sadykov R, Uchoa E (2024) Vrpsolvereasy: A Python library for the exact solution of a rich vehicle routing problem. INFORMS J. Comput. 36(4):956–965.Link, Google Scholar
• Gurobi Optimization LLC (2023) Gurobi 10.0 documentation. Accessed May 13, 2026, https://www.gurobi.com/documentation/10.0/refman/index.html.Google Scholar
• IBM Corporation (2023) IBM ILOG CPLEX Optimization Studio. Accessed May 13, 2026, https://www.ibm.com/docs/en/icos/22.1.0?topic=manuals-cplex-users-manual.Google Scholar
• Irnich S, Desaulniers G, Desrosiers J, Hadjar A (2010) Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS J. Comput. 22(2):297–313.Link, Google Scholar
• Kim H, Park J, Kwon C (2024) A neural separation algorithm for the rounded capacity inequalities. INFORMS J. Comput. 36(4):987–1005.Link, Google Scholar
• Lima I, Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A, Oliveira D, Queiroga E (2014) CVRPLib: Capacitated vehicle routing problem library. Accessed, http://vrp.galgos.inf.puc-rio.br/index.php/en/updates.Google Scholar
• Lin W, He Z, Jiang S, Ma F, Su Z, Lü Z (2026) Alkaid-SDVRP: An efficient open-source solver for the vehicle routing problem with split deliveries. INFORMS J. Comput. 38(1):150–164.Link, Google Scholar
• Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical report, Department of Management Science and Logistics, Aarhus School of Business and Social Sciences, Aarhus University, Aarhus, Denmark.Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100:423–445.Crossref, Google Scholar
• Martinelli R, Pecin D, Poggi M (2014) Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239(1):102–111.Crossref, Google Scholar
• Morabit M, Desaulniers G, Lodi A (2021) Machine-learning–based column selection for column generation. Transportation Sci. 55(4):815–831.Link, Google Scholar
• Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia), 53–84.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, Santos H (2017b) 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 (2021) Solving bin packing problems using VRPSolver models. Oper. Res. Forum 2:20.Crossref, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2018) Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J. Comput. 30(2):339–360.Link, Google Scholar
• Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math. Programming 183:483–523.Crossref, Google Scholar
• Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255–273.Crossref, Google Scholar
• Roberti R, Mingozzi A (2014) Dynamic ng-path relaxation for the delivery man problem. Transportation Sci. 48(3):413–424.Link, Google Scholar
• Sadykov R, Vanderbeck F (2021) BaPCod—A generic branch-and-price code. Technical report, Bordeaux-Sud-Ouest Inria Research Centre, 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
• Silva JMP, Uchoa E, Subramanian A (2024) Cluster branching for vehicle routing problems. Accessed May 13, 2026, https://optimization-online.org/?p=27150.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
• Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and swap* neighborhood. Comput. Oper. Res. 140:105643.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1):475–489.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3):611–624.Link, Google Scholar
• Wouda NA, Lan L, Kool W (2024) PYVRP: A high-performance VRP solver package. INFORMS J. Comput. 36(4):943–955.Link, Google Scholar
• Yang Y (2023) An exact price-cut-and-enumerate method for the capacitated multitrip vehicle routing problem with time windows. Transportation Sci. 57(1):230–251.Link, Google Scholar
• Yang Y (2025) Deluxing: Deep Lagrangian underestimate fixing for column-generation-based exact methods. Oper. Res. 73(3):1184–1207.Link, Google Scholar
• You Z (2025) RouteOpt documentation. Accessed May 13, 2026, https://zhengzhong-you.github.io/RouteOpt-Docs/rank1_cuts/r1c_index.html#id72.Google Scholar
• You Z, Yang Y (2026) RouteOpt: An open-source modular exact solver for vehicle routing problems, https://github.com/INFORMSJoC/2025.1415.Google Scholar
• You Z, Yang Y, Wang X, Yin W (2026) Two-stage learning to branch in branch-price-and-cut algorithms for solving vehicle routing problems exactly. Oper. Res., ePub ahead of print February 24, https://doi.org/10.1287/opre.2023.0615.Link, Google Scholar