The risk-averse traveling repairman problem with profits

In this paper, we study a stochastic variant of the traveling repairman problem with profits in which travel times are random. The introduction of the arrival time in the objective function instead of the travel time, which is common in most vehicle routing problems, poses compelling challenges, emphasized by the incorporation of the stochasticity in travel times and by the presence of profits. A risk-averse perspective is considered in the model, which is then formulated as a nonlinear integer model and heuristically solved by means of a beam search heuristic. Experimental results have been performed on instances adapted from the available deterministic datasets, to show the effectiveness of the solution approach.

[1]  Gilles Savard,et al.  The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times , 2006, Discret. Optim..

[2]  Teodor Gabriel Crainic,et al.  Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items , 2012, Annals of Operations Research.

[3]  Patrick Jaillet,et al.  Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines , 2016, Transp. Sci..

[4]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[5]  Marielle Christiansen,et al.  The robust vehicle routing problem with time windows , 2013, Comput. Oper. Res..

[6]  Kyungsik Lee,et al.  Robust vehicle routing problem with deadlines and travel time/demand uncertainty , 2012, J. Oper. Res. Soc..

[7]  Mesut Yavuz,et al.  An iterated beam search algorithm for the green vehicle routing problem , 2017, Networks.

[8]  Patrizia Beraldi,et al.  Designing robust routes for demand-responsive transport systems , 2014 .

[9]  Roberto Musmanno,et al.  Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem , 2005 .

[10]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[11]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[12]  Guido Perboli,et al.  The Multi-path traveling salesman problem with stochastic travel costs: building realistic instances for city logistics applications , 2014 .

[13]  Demetrio Laganà,et al.  The mixed capacitated general routing problem under uncertainty , 2015, Eur. J. Oper. Res..

[14]  S. Kotz,et al.  Symmetric Multivariate and Related Distributions , 1989 .

[15]  David L. Woodruff,et al.  The stochastic vehicle routing problem, a literature review, part I: models , 2016, EURO J. Transp. Logist..

[16]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[17]  René Henrion,et al.  Convexity of chance constraints with independent random variables , 2008, Comput. Optim. Appl..

[18]  Patrizia Beraldi,et al.  A fast heuristic for routing in post-disaster humanitarian relief logistics , 2018 .

[19]  David L. Woodruff,et al.  The stochastic vehicle routing problem, a literature review, Part II: solution methods , 2017, EURO J. Transp. Logist..

[20]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[21]  Victor Fernandez-Viagas,et al.  A beam-search-based constructive heuristic for the PFSP to minimise total flowtime , 2017, Comput. Oper. Res..

[22]  G. Calafiore,et al.  On Distributionally Robust Chance-Constrained Linear Programs , 2006 .

[23]  Patrizia Beraldi,et al.  A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty , 2018, Electron. Notes Discret. Math..

[24]  Michael A. P. Taylor,et al.  Distributions of travel time variability on urban roads , 2010 .

[25]  Débora P. Ronconi,et al.  List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility , 2015, Eur. J. Oper. Res..

[26]  Ali Haghani,et al.  Genetic Algorithm for the Time-Dependent Vehicle Routing Problem , 2001 .

[27]  Patrick Jaillet,et al.  The Machine Learning and Traveling Repairman Problem , 2011, ADT.

[28]  Patrizia Beraldi,et al.  The Probabilistic Set-Covering Problem , 2002, Oper. Res..

[29]  Herbert Peremans,et al.  Vehicle routing with stochastic time-dependent travel times , 2009, 4OR.

[30]  Ignacio Araya,et al.  A beam search approach to the container loading problem , 2014, Comput. Oper. Res..

[31]  Qing He,et al.  Estimating freeway route travel time distributions with consideration to time-of-day, inclement weather, and traffic incidents , 2016 .

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

[33]  Stefan Bock,et al.  Solving the traveling repairman problem on a line with general processing times and deadlines , 2015, Eur. J. Oper. Res..

[34]  Patrizia Beraldi,et al.  A branch and bound method for stochastic integer problems under probabilistic constraints , 2002, Optim. Methods Softw..

[35]  Jorge E. Mendoza,et al.  On Modeling Stochastic Travel and Service Times in Vehicle Routing , 2016, Transp. Sci..

[36]  P. Beraldi,et al.  A Stochastic Programming Approach for the Traveling Purchaser Problem , 2017 .

[37]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[38]  Patrick Jaillet,et al.  Routing Optimization Under Uncertainty , 2016, Oper. Res..

[39]  Guido Perboli,et al.  A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times , 2017 .

[40]  Christian Prins,et al.  Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands , 2016, RAIRO Oper. Res..

[41]  Stan Uryasev,et al.  Modeling and optimization of risk , 2011 .

[42]  Patrizia Beraldi,et al.  An exact approach for solving integer problems under probabilistic constraints with random technology matrix , 2010, Ann. Oper. Res..

[43]  Patrizia Beraldi,et al.  Capital rationing problems under uncertainty and risk , 2012, Comput. Optim. Appl..

[44]  Demetrio Laganà,et al.  The Express heuristic for probabilistically constrained integer problems , 2013, J. Heuristics.

[45]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[46]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[47]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[48]  Marielle Christiansen,et al.  Layered Formulation for the Robust Vehicle Routing Problem with Time Windows , 2012, ISCO.

[49]  W. Art Chaovalitwongse,et al.  Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries , 2012, Comput. Oper. Res..

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

[51]  Patrizia Beraldi,et al.  Beam search heuristic to solve stochastic integer problems under probabilistic constraints , 2005, Eur. J. Oper. Res..

[52]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[53]  Giorgio Ausiello,et al.  On Salesmen, Repairmen, Spiders, and Other Traveling Agents , 2000, CIAC.

[54]  Christian Blum,et al.  On solving the assembly line worker assignment and balancing problem via beam search , 2011, Comput. Oper. Res..