Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach

Abstract The Traveling Repairman Problem with profits generalizes the Traveling Repairman Problem, by taking into account the variability of the repairman’s profit over different time steps in order to maximize the total profit. In this paper, we first analyze the complexities of several neighborhood structures and the efficient updating of objective values of solutions from those neighborhoods. Then we present a new heuristic based on General variable neighborhood search, that uses a local search that combines those neighborhoods in an effective way. Detailed experiments on benchmark instances show that our new method outperforms all previous heuristics. Out of 60 instances tested, it was able to replicate the best known solutions in 20 of them and find new best solutions in the remaining 40.

[1]  Michal Tzur,et al.  The Period Vehicle Routing Problem with Service Choice , 2006, Transp. Sci..

[2]  Frits C. R. Spieksma,et al.  Heuristics for the traveling repairman problem with profits , 2013, Comput. Oper. Res..

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[4]  Nenad Mladenović,et al.  Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations , 2018, INFORMS J. Comput..

[5]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[6]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[7]  Mustafa Avci,et al.  A GRASP with iterated local search for the traveling repairman problem with profits , 2017, Comput. Ind. Eng..

[8]  Nenad Mladenović,et al.  New VNS based 0-1 MIP Heuristics , 2014 .

[9]  Frits C. R. Spieksma,et al.  Profit-based latency problems on the line , 2008, Oper. Res. Lett..

[10]  Daniel Aloise,et al.  Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering , 2017, Inf. Sci..

[11]  Ziying Zhang,et al.  A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows , 2019, Inf. Sci..

[12]  Demetrio Laganà,et al.  The risk-averse traveling repairman problem with profits , 2019, Soft Comput..

[13]  Bo Peng,et al.  Memetic algorithm for the multiple traveling repairman problem with profits , 2019, Eng. Appl. Artif. Intell..

[14]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[15]  Bang Ye Wu,et al.  Exact algorithms for the minimum latency problem , 2004, Inf. Process. Lett..

[16]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[17]  László T. Kóczy,et al.  Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization , 2017, Inf. Sci..

[18]  Nenad Mladenović,et al.  Variable Neighbourhood Search , 2006 .

[19]  Thibaut Vidal,et al.  Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits , 2014, Transp. Sci..

[20]  Jack Brimberg,et al.  Less is more: Solving the Max-Mean diversity problem with variable neighborhood search , 2017, Inf. Sci..

[21]  Michel Gendreau,et al.  The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm , 2005, Transp. Sci..

[22]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[23]  Yongliang Lu,et al.  Hybrid evolutionary search for the traveling repairman problem with profits , 2019, Inf. Sci..

[24]  Nenad Mladenovic,et al.  Less is more: Basic variable neighborhood search for minimum differential dispersion problem , 2016, Inf. Sci..

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

[26]  Wei Wang,et al.  A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling , 2011, Inf. Sci..

[27]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[28]  Pierre Hansen,et al.  Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..

[29]  Hamid D. Taghirad,et al.  Multi-goal motion planning using traveling salesman problem in belief space , 2019, Inf. Sci..

[30]  Alok Singh,et al.  A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem , 2018, Inf. Sci..

[31]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[32]  Habib Chabchoub,et al.  Apply the quantum particle swarm optimization for the K-traveling repairman problem , 2019, Soft Comput..

[33]  Nenad Mladenovic,et al.  Variable neighborhood search for the travelling deliveryman problem , 2011, 4OR.

[34]  Juan Lin,et al.  Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem , 2017, Inf. Sci..