Code and Data Repository for VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem
VRPSolverEasy是一个Python包，为VRPSolver提供简单接口，后者是车辆路径问题最先进的精确求解器，适合无运筹学背景的用户，支持多种标准VRP变体。
VRPSolverEasy is a Python package which provides a simple interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems (VRPs). The simplified interface is accessible for users without operations research background, meaning you do not need to know how to model your problem as an Integer Programming problem. As a price to pay for the simplicity, this interface is restricted to some standard VRP variants, which involve the following features and their combinations: capacitated vehicles customer time windows heterogeneous fleet multiple depots open routes optional customers with penalties parallel links to model transition time/cost trade-off incompatibilities between vehicles and customers customers with alternative locations and/or time windows To our knowledge, VRPSolver is the most efficient exact solver available for VRPs. Its particularity is to focus on finding and improving a lower bound on the optimal solution value of your instance. It is less efficient in finding feasible solutions but still can be better than available heuristic solvers for non-classic VRP variants.