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

Najib Errami (), Eduardo Queiroga (), Ruslan Sadykov () and Eduardo Uchoa ()
Additional contact information
Najib Errami: Inria Centre of the University of Bordeaux–Sud-Ouest, 33405 Talence, France
Eduardo Queiroga: Inria Centre of the University of Bordeaux–Sud-Ouest, 33405 Talence, France
Ruslan Sadykov: Inria Centre of the University of Bordeaux–Sud-Ouest, 33405 Talence, France
Eduardo Uchoa: Inria Centre of the University of Bordeaux–Sud-Ouest, 33405 Talence, France; Universidade Federal Fluminense–Engenharia de Produção, Niterói 24210-240, Brazil

INFORMS Journal on Computing, 2024, vol. 36, issue 4, 956-965

Abstract: The optimization community has made significant progress in solving vehicle routing problems (VRPs) to optimality using sophisticated branch-cut-and-price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. However, its complex underlying mathematical model makes it hardly accessible to routing practitioners. To address this, VRPSolverEasy provides a Python interface to VRPSolver that does not require any knowledge of mixed integer programming modeling. Instead, routing problems are defined in terms of familiar elements, such as depots, customers, links, and vehicle types. VRPSolverEasy can handle several popular VRP variants and arbitrary combinations of them.

Keywords: vehicle routing; transportation; exact algorithms; Python package (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2023.0103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:36:y:2024:i:4:p:956-965

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().