A customer-centric routing problem with multiple trips of a single vehicle

In this study, we introduce a routing problem with multiple uses of a single vehicle and service time in demand points, minimizing the sum of clients’ waiting time to receive service. This problem is relevant in the distribution of aid in disaster-stricken communities, in the recollection and/or delivery of perishable goods and personnel transportation, among other situations, where reaching clients to perform service, fast and fair, is a priority. We consider vehicle capacity and travel distance constraints, forcing multiple use of the vehicle during the planning horizon. This paper presents two mixed integer formulations for this problem, based on a multi-level network, as well as a metaheuristic algorithm. The proposed models can solve to optimality instances with up to 30 clients. The proposed metaheuristic algorithm obtains high-quality solutions in short computational times.

[1]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[2]  Gilbert Laporte,et al.  The petrol station replenishment problem with time windows , 2009, Comput. Oper. Res..

[3]  Kerem Bülbül,et al.  A SURVEY ON MULTI TRIP VEHICLE ROUTING PROBLEM , 2008 .

[4]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

[5]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[6]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[7]  Isabel Méndez-Díaz,et al.  A new formulation for the Traveling Deliveryman Problem , 2008, Discret. Appl. Math..

[8]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[9]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[10]  Jose M. Framiñan,et al.  Metrics for bullwhip effect analysis , 2013, J. Oper. Res. Soc..

[11]  Zuren Feng,et al.  A two-phase metaheuristic for the cumulative capacitated vehicle routing problem , 2013, Comput. Oper. Res..

[12]  Michel Gendreau,et al.  Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .

[13]  Cláudio Alves,et al.  Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model , 2011, Eur. J. Oper. Res..

[14]  Francisco Ángel-Bello,et al.  Two improved formulations for the minimum latency problem , 2013 .

[15]  Thibaut Vidal,et al.  A simple and effective metaheuristic for the Minimum Latency Problem , 2012, Eur. J. Oper. Res..

[16]  Mauricio G. C. Resende,et al.  GRASP: basic components and enhancements , 2011, Telecommun. Syst..

[17]  Fatih Camci,et al.  The travelling maintainer problem: integration of condition-based maintenance with the travelling salesman problem , 2014, J. Oper. Res. Soc..

[18]  Michel Gendreau,et al.  A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

[19]  Pasquale Avella,et al.  Solving a fuel delivery problem by heuristic and exact approaches , 2004, Eur. J. Oper. Res..

[20]  Peter Goos,et al.  Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem , 2011, 4OR.

[21]  Artur Alves Pessoa,et al.  The time dependent traveling salesman problem: polyhedra and algorithm , 2013, Math. Program. Comput..

[22]  Michel Gendreau,et al.  An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..

[23]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[24]  Ciro-Alberto Amaya,et al.  A vehicle routing problem with multi-trips and time windows for circular items , 2013, J. Oper. Res. Soc..

[25]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[26]  Saïd Salhi,et al.  A multi-phase constructive heuristic for the vehicle routing problem with multiple trips , 2003, Discret. Appl. Math..

[27]  Alfredo Olivera,et al.  Adaptive memory programming for the vehicle routing problem with multiple trips , 2007, Comput. Oper. Res..

[28]  Ismail Karaoglan,et al.  A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles , 2015 .

[29]  Peter Goos,et al.  An efficient GRASP+VND metaheuristic for the traveling repairman problem , 2008 .

[30]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[31]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[32]  X. Hu,et al.  A metaheuristic based on a pool of routes for the vehicle routing problem with multiple trips and time windows , 2014, J. Oper. Res. Soc..

[33]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[34]  John E. Beasley,et al.  A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..

[35]  Michel Gendreau,et al.  Metaheuristics in Vehicle Routing , 2012, International Conference on Operations Research and Enterprise Systems.