PyVRP: a high-performance VRP solver package

Abstract

We introduce PyVRP, a Python package that implements hybrid genetic search in a state-of-the-art vehicle routing problem (VRP) solver. The package is designed for the VRP with time windows (VRPTW), but can be easily extended to support other VRP variants. PyVRP combines the flexibility of Python with the performance of C++, by implementing (only) performance critical parts of the algorithm in C++, while being fully customisable at the Python level. PyVRP is a polished implementation of the algorithm that ranked 1st in the 2021 DIMACS VRPTW challenge and, after improvements, ranked 1st on the static variant of the EURO meets NeurIPS 2022 vehicle routing competition. The code follows good software engineering practices, and is well-documented and unit tested. PyVRP is freely available under the liberal MIT license. Through numerical experiments we show that PyVRP achieves state-of-the-art results on the VRPTW and capacitated VRP. We hope that PyVRP enables researchers and practitioners to easily and quickly build on a state-of-the-art VRP solver.

arXiv commentPre-print of accepted paper in INFORMS Journal on Computing. 24 pages, 1 figure, 2 listings

Cited by in corpus (5)

• RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
• Spatial-temporal-demand clustering for solving large-scale vehicle routing problems with time windows
• An iterative sample scenario approach for the dynamic dispatch waves problem
• TuneNSearch: a hybrid transfer learning and local search approach for solving vehicle routing problems
• Learning to Sample in Variable Neighborhood Search Algorithm for Urban Cable Routing Optimization