A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem

In this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy.

[1]  Petrica C. Pop,et al.  An improved hybrid algorithm for solving the generalized vehicle routing problem , 2013, Neurocomputing.

[2]  Thibaut Vidal,et al.  Hybrid metaheuristics for the Clustered Vehicle Routing Problem , 2014, Comput. Oper. Res..

[3]  Richard F. Hartl,et al.  Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows , 2008, Comput. Oper. Res..

[4]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[5]  Daniele Vigo,et al.  Exact Algorithms for the Clustered Vehicle Routing Problem , 2014, Oper. Res..

[6]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[7]  Bruce L. Golden,et al.  Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network , 2008 .

[8]  D. Dumitrescu,et al.  Solving the Generalized Vehicle Routing Problem with an ACS‐based Algorithm , 2009 .

[9]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

[10]  Alexandre Salles da Cunha,et al.  Heuristic and exact algorithms for a min-max selective vehicle routing problem , 2011, Comput. Oper. Res..

[11]  Carter C. Price,et al.  The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics , 2006 .

[12]  Andrei Horvat Marc,et al.  New mathematical models of the generalized vehicle routing problem and extensions , 2012 .

[13]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[14]  Bahar Yetis Kara,et al.  Selective vehicle routing for a mobile blood donation system , 2015, Eur. J. Oper. Res..

[15]  Raffaele Cerulli,et al.  A novel discretization scheme for the close enough traveling salesman problem , 2017, Comput. Oper. Res..

[16]  Joseph Ying Jun Chow,et al.  Selective vehicle routing problems under uncertainty without recourse , 2014 .

[17]  Gilbert Laporte,et al.  An incremental tabu search heuristic for the generalized vehicle routing problem with time windows , 2012, J. Oper. Res. Soc..

[18]  Tolga Bektas,et al.  Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem , 2011, Transp. Sci..

[19]  K. Sörensen,et al.  Hamiltonian paths in large clustered routing problems , 2008 .

[20]  Sanne Wøhlk.  A Decade of Capacitated Arc Routing , 2008 .

[21]  Gilbert Laporte,et al.  Some applications of the generalized vehicle routing problem , 2008, J. Oper. Res. Soc..

[22]  Nacima Labadie,et al.  Team Orienteering Problem with Decreasing Profits , 2013, Electron. Notes Discret. Math..

[23]  Christian Prins,et al.  Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size , 2014, Int. Trans. Oper. Res..

[24]  William Mennell.  Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem , 2009 .

[25]  Maria Grazia Speranza,et al.  Optimal solutions for routing problems with profits , 2013, Discret. Appl. Math..

[26]  Gilbert Laporte,et al.  Some applications of the clustered travelling salesman problem , 2000, J. Oper. Res. Soc..