Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems

Abstract The Multi-vehicle Covering Tour Problem and the Bi-Objective Multi-vehicle Covering Tour Problem have been studied for more than thirty years. Both problems have several practical applications in industry. In this paper, we propose an effective exact method for the Multi-vehicle Covering Tour Problem based on column generation techniques. The effectiveness of the exact method is owed to tailored dominance rules and completion bounds. To validate our approach, we conducted extensive computational experiments on instances from literature. The comparison with state-of-the-art methods shows the effectiveness of the proposed method. In particular, seven open instances are closed to optimality for the first time, and the best lower bounds of the six open instances are improved. The exact method for the Multi-vehicle Covering Tour Problem is also embedded in a ϵ-constraint exact method to solve its bi-objective counterpart. Computational results show that the lower bound set provided by this bi-objective exact method is stronger than those provided by the state-of-the-art method from the literature.

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

[2]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[3]  Walter J. Gutjahr,et al.  The bi-objective stochastic covering tour problem , 2012, Comput. Oper. Res..

[4]  Gilbert Laporte,et al.  The multi-vehicle cumulative covering tour problem , 2017, Ann. Oper. Res..

[5]  Luís Gouveia,et al.  Combined route capacity and route length models for unit demand vehicle routing problems , 2008, Discret. Optim..

[6]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[7]  Alexandre Salles da Cunha,et al.  A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem , 2013, Electron. Notes Discret. Math..

[8]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[9]  Nicolas Jozefowiez,et al.  The bi-objective covering tour problem , 2007, Comput. Oper. Res..

[10]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[11]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[12]  Nicolas Jozefowiez,et al.  Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective , 2018, EURO J. Comput. Optim..

[13]  Jacques Renaud,et al.  A covering tour approach to the location of satellite distribution centers to supply humanitarian aid , 2012, Eur. J. Oper. Res..

[14]  Nicolas Jozefowiez,et al.  Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective , 2013, ATMOS.

[15]  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).

[16]  Keisuke Murakami.  Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem , 2018, Asia Pac. J. Oper. Res..

[17]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[18]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[19]  Richard F. Hartl,et al.  A Bi-objective Metaheuristic for Disaster Relief Operation Planning , 2010, Advances in Multi-Objective Nature Inspired Computing.

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

[21]  Paolo Toth,et al.  An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems , 2008 .

[22]  Nicolas Jozefowiez.  A branch-and-price algorithm for the multivehicle covering tour problem , 2014, Networks.

[23]  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..

[24]  Antônio Carlos Moretti,et al.  The multi-vehicle covering tour problem: building routes for urban patrolling , 2013, ArXiv.

[25]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[26]  Gilbert Laporte,et al.  A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama , 1998 .

[27]  Nguyen Xuan Hoai,et al.  Description of the datasets for the experiments in the paper “solving the multi-vehicle multi-covering tour problem” , 2018, Data in brief.

[28]  Marcus Poggi de Aragão,et al.  Stabilized branch-and-cut-and-price for the generalized assignment problem , 2005, Electron. Notes Discret. Math..

[29]  Bassem Jarboui,et al.  An integration of mixed VND and VNS: the case of the multivehicle covering tour problem , 2017, Int. Trans. Oper. Res..

[30]  G. Laporte,et al.  Maximizing user convenience and postal service efficiency in post box location , 1986 .

[31]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[32]  J. Current,et al.  The median tour and maximal covering tour problems: Formulations and heuristics , 1994 .

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