A Constraint-Based Local Search for Offline and Online General Vehicle Routing

Vehicle routing is a class of combinatorial optimization problems arising in the industry of transportation and logistics. The goal of these problems is to compute an optimal route plan for a set of vehicles for serving transport requests of customers. There are many variants of the vehicle routing problems: routing for delivering goods, routing for demand responsive transport (taxi, school bus, …). Each problem might have different constraints, objectives. In this paper, we introduce a Constraint-Based Local Search (CBLS) framework for general offline and online vehicle routing problems. We extend existing neighborhood structures in the literature by proposing new neighborhoods to facilitate the resolution of different class of vehicle routing problems in a unified platform. A novel feature of the framework is the available APIs for online vehicle routing problems where requests arrive online during the execution of the computed route plan. Experimental results on three vehicle routing problems (the min-...

[1]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[2]  Michel Gendreau,et al.  IN THE VEHICLE ROUTING PROBLEM , 2002 .

[3]  Vandana A. Patil,et al.  Capacitated vehicle routing problem , 2017, 2017 2nd International Conference on Communication Systems, Computing and IT Applications (CSCITA).

[4]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[5]  Gilbert Laporte,et al.  Heuristics for the multi-vehicle covering tour problem , 2000, Comput. Oper. Res..

[6]  Pascal Van Hentenryck,et al.  Constraint-based local search , 2018, Handbook of Heuristics.

[7]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[8]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[9]  Keisuke Murakami,et al.  A column generation approach for the multi-vehicle covering tour problem , 2014, 2014 IEEE International Conference on Automation Science and Engineering (CASE).

[10]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[11]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[12]  Lou Caccetta,et al.  An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem , 2003, Transp. Sci..

[13]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[14]  Roberto Baldacci,et al.  Scatter Search Methods for the Covering Tour Problem , 2005 .

[15]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[16]  Pascal Van Hentenryck,et al.  Large Neighborhood Search for Dial-a-Ride Problems , 2011, CP.

[17]  William J. Cook,et al.  Solution of a Min-Max Vehicle Routing Problem , 2002, INFORMS Journal on Computing.

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[19]  Hajo A. Reijers,et al.  The Share-a-Ride Problem: People and parcels sharing taxis , 2014, Eur. J. Oper. Res..

[20]  Bruce L. Golden,et al.  A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..

[21]  André Langevin,et al.  An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices , 2013, Eur. J. Oper. Res..