Vehicle Routing Web-based Solver
academic web-page
Solver
Branch-Cut-and-Price web-based exact solver is available at allgo.inria.fr/app/vehiclerouting.
It can solve instances (some are available below) of the following problems
- Capacitated Vehicle Routing Problem
- Distance Constrained Capacitated Vehicle Routing Problem
- Heterogeneous Vehicle Routing Problem
- Multi Depot Vehicle Routing Problem
- Site Dependent Vehicle Routing Problem
- Capacitated Vehicle Routing Problem with Time Windows
Extension to other Vehicle Routing variants can be considered by request to
ruslan(point)sadykov(at)inria(point)fr.
Academic use only.
Paper
The solver is an implementation of the Branch-Cut-and-Price algorithm described in the paper:
-
R. Sadykov, E. Uchoa, A. Pessoa. "A Bucket Graph Based Labeling Algorithm with Application
to Vehicle Routing"
Cadernos do LOGIS 2017/7, submitted:
download
Presentation
-
"Branch-Cut-and-Price solver for Vehicle Routing Problems",
23th International Symposium on Mathematical Programming,
ISMP'18 , Bordeaux, France, July 3, 2018.
PDF file
Instances
-
CVRP (Capacitated Vehicle Routing Problem)
class A
class B
class E
class F
class M
class P
class X (Uchoa et al., 2014)
-
DCCVRP (Distance Constrained Capacitated Vehicle Routing Problem)
CMT instances (Christofides, Mingozzi, Toth,
1979)
-
HVRP (Heterogeneous Vehicle Routing Problem)
Taillard instances (Taillard, 1999)
Brandao instances (Brandao, 2011)
DLP instances (Duhamel, Lacomme, Prodhon, 2011)
XH instances (Pessoa, Sadykov, Uchoa, 2018)
-
MDVRP (Multi Depot Vehicle Routing Problem)
Cordeau instances (Cordeau, Gendreau, Laporte, 1997)
Baldacci instances (Baldacci, Mingozzi,
2009)
-
SDVRP (Site Dependent Vehicle Routing Problem)
Cordeau instances (Cordeau, Laporte, 2001)
-
VRPTW (Capacitated Vehicle Routing Problem with Time Windows)
Solomon instances (Solomon, 1987)
GH instances (Gehring, Homberger, 2002)
Last updated: June 27, 2018