Arc routing under uncertainty: Introduction and literature review

Abstract This article provides a summary of the scientific literature on arc routing problems under uncertainty. Uncertainty is involved in any problem-solving situation where information is incomplete, fragmentary, not readily available, not fully exploitable, or deficient in some other way. Here, we deal with different types of uncertainty and also refer to vagueness that arises in fuzzy environments. The article prevalently focuses on problems represented as stochastic programs or robust optimization models for which the basic concepts are illustrated. In addition, other paradigms are discussed, like the ones dealing with uncertain aspects in dynamic domains. The main solution methods for these uncertain problems are presented. The article also provides an overview of the different applications within the area of interest.

[1]  Wasin Padungwech,et al.  Effects of update frequencies in a dynamic capacitated arc routing problem , 2020, Networks.

[2]  Si Chen,et al.  Arc-Routing Models for Small-Package Local Routing , 2009, Transp. Sci..

[3]  H. Handa,et al.  Robust route optimization for gritting/salting trucks: a CERCIA experience , 2006, IEEE Computational Intelligence Magazine.

[4]  Peter Kall,et al.  Stochastic Programming , 1995 .

[5]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[6]  Melvyn Sim,et al.  Tractable Approximations to Robust Conic Optimization Problems , 2006, Math. Program..

[7]  Roya Soltani,et al.  A ROBUST OPTIMIZATION MODEL FOR A LOCATION-ARC ROUTING PROBLEM WITH DEMAND UNCERTAINTY , 2020 .

[8]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

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

[10]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[11]  Yi Mei,et al.  Genetic programming hyper-heuristic for multi-vehicle uncertain capacitated arc routing problem , 2018, GECCO.

[12]  Erfan Babaee Tirkolaee,et al.  A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste collection using a multi-objective invasive weed optimization , 2019, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

[13]  Wim van Ackooij,et al.  Eventual convexity of chance constrained feasible sets , 2015 .

[14]  Iraj Mahdavi,et al.  A hybrid augmented ant colony optimization for the multi-trip capacitated arc routing problem under fuzzy demands for urban solid waste management , 2020, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

[15]  Wasin Padungwech,et al.  Heuristic algorithms for dynamic capacitated arc routing , 2018 .

[16]  Reza Tavakkoli-Moghaddam,et al.  A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds , 2020 .

[17]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

[18]  Kees Roos,et al.  Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems , 2002, SIAM J. Optim..

[19]  Ángel Corberán,et al.  The periodic rural postman problem with irregular services on mixed graphs , 2019, Eur. J. Oper. Res..

[20]  Constantine Caramanis,et al.  Theory and Applications of Robust Optimization , 2010, SIAM Rev..

[21]  Zili Zhang,et al.  A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem , 2020, Evolutionary Computation.

[22]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[23]  Michel Gendreau,et al.  Optimizing road network daily maintenance operations with stochastic service and travel times , 2014 .

[24]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[25]  Marida Bertocchi,et al.  A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches , 2016, Computational Management Science.

[26]  Stephan Meisel,et al.  Anticipatory Optimization for Dynamic Decision Making , 2011, Operations research / computer science interfaces series.

[27]  Michel Gendreau,et al.  50th Anniversary Invited Article - Future Research Directions in Stochastic Vehicle Routing , 2016, Transp. Sci..

[28]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[29]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[30]  Shabbir Ahmed,et al.  Stochastic dual dynamic integer programming , 2019, Math. Program..

[31]  Roberto Musmanno,et al.  Efficient Neighborhood Search for the Probabilistic Multi-Vehicle Pickup and Delivery Problem , 2010, Asia Pac. J. Oper. Res..

[32]  Angel A. Juan,et al.  Sim-RandSHARP: A hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[33]  Tiffany L. Yang,et al.  A Tabu Search, Augment-Merge Heuristic to Solve the Stochastic Location Arc Routing Problem , 2016 .

[34]  Louis-Martin Rousseau,et al.  The rescheduling arc routing problem , 2017, Int. Trans. Oper. Res..

[35]  Yi Mei,et al.  A Novel Genetic Programming Algorithm with Knowledge Transfer for Uncertain Capacitated Arc Routing Problem , 2019, PRICAI.

[36]  J. Potvin,et al.  A dynamic capacitated arc routing problem with time-dependent service costs , 2011 .

[37]  Michal Kaut,et al.  Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function , 2019, INFORMS J. Comput..

[38]  M. Cândida Mourão,et al.  An updated annotated bibliography on arc routing problems , 2017, Networks.

[39]  Michel Gendreau,et al.  The Stochastic Eulerian Tour Problem , 2008, Transp. Sci..

[40]  Zuhaimy Ismail,et al.  Implementation weather-type models of capacitated arc routing problem via heuristics , 2011 .

[41]  Wen Lea Pearn,et al.  Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[42]  Yi Mei,et al.  An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem , 2018, Australasian Conference on Artificial Intelligence.

[43]  Yi Mei,et al.  Evolutionary Computation for Dynamic Capacitated Arc Routing Problem , 2013 .

[44]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..

[45]  Jiafu Tang,et al.  Routing optimization with time windows under uncertainty , 2019, Math. Program..

[46]  Boxiao Chen Arc Routing Problems with Time Duration Constraints and Uncertainty , 2017 .

[47]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[48]  Xin Yao,et al.  Robust Solution of Salting Route Optimisation Using Evolutionary Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[49]  Michel Gendreau,et al.  Stochastic Vehicle Routing Problems , 2014, Vehicle Routing.

[50]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[51]  Xin Yao,et al.  Robust Salting Route Optimization Using Evolutionary Algorithms , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[52]  Nabil Absi,et al.  The stochastic close-enough arc routing problem , 2017, Networks.

[53]  Marlin W. Ulmer,et al.  Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests , 2018, Networks.

[54]  Hsiao-Fan Wang,et al.  Time-constrained Chinese postman problems , 2002 .

[55]  Tapabrata Ray,et al.  A benchmark generator for dynamic capacitated arc routing problems , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[56]  Joseph Y. J. Chow Dynamic UAV-based traffic monitoring under uncertainty as a stochastic arc-inventory routing policy , 2016, 1609.03201.

[57]  Lei Xu,et al.  Dynamic arc routing problem in road maintenance service with uncertain travel and service times , 2016 .

[58]  Demetrio Laganà,et al.  Preface: Special issue on arc routing problems and other related topics , 2020, Networks.

[59]  Roberto Baldacci,et al.  Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .

[60]  Linet Özdamar,et al.  Coordinating debris cleanup operations in post disaster road networks , 2014 .

[61]  Christodoulos A. Floudas,et al.  The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty , 2013, Oper. Res..

[62]  Michel Gendreau,et al.  Heuristics for the Stochastic Eulerian Tour Problem , 2010, Eur. J. Oper. Res..

[63]  H. Zimmermann Fuzzy programming and linear programming with several objective functions , 1978 .

[64]  José Fernando Oliveira,et al.  Heuristics for a dynamic rural postman problem , 2007, Comput. Oper. Res..

[65]  F. Tillman The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[66]  Laurence A. Wolsey,et al.  Covering Linear Programming with Violations , 2014, INFORMS J. Comput..

[67]  Philippe Lacomme,et al.  Improving robustness of solutions to arc routing problems , 2005, J. Oper. Res. Soc..

[68]  Thomas Stützle,et al.  Ant Colony Optimization: A Component-Wise Overview , 2018, Handbook of Heuristics.

[69]  Yi Mei,et al.  Transfer Learning in Genetic Programming Hyper-heuristic for Solving Uncertain Capacitated Arc Routing Problem , 2019, 2019 IEEE Congress on Evolutionary Computation (CEC).

[70]  Iraj Mahdavi,et al.  A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew's working time. , 2018, Waste management.

[71]  Ellis L. Johnson,et al.  Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation , 2009 .

[72]  Yi Mei,et al.  Novel ensemble genetic programming hyper-heuristics for uncertain capacitated arc routing problem , 2019, GECCO.

[73]  Isaac Plana,et al.  Arc routing problems: A review of the past, present, and future , 2020, Networks.

[74]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[75]  René Henrion,et al.  Convexity of Chance Constraints with Dependent Random Variables: The Use of Copulae , 2011 .

[76]  Philippe Lacomme,et al.  Evolutionary Algorithms for Stochastic Arc Routing Problems , 2004, EvoWorkshops.

[77]  Yong Zhang,et al.  Chinese Postman Problem in Stochastic Networks , 2005, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05).

[78]  Tapabrata Ray,et al.  A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[79]  Gokhan Kirlik,et al.  A Dynamic Path Planning Approach for Multirobot Sensor-Based Coverage Considering Energy Constraints , 2009, IEEE Transactions on Cybernetics.

[80]  Gilbert Laporte,et al.  Arc Routing: Problems, Methods, and Applications , 2015 .

[81]  Singiresu S. Rao Engineering Optimization : Theory and Practice , 2010 .

[82]  Juan José Ramos,et al.  A simheuristic algorithm for solving the arc-routing problem with stochastic demands , 2018, J. Simulation.

[83]  Alireza Eydi,et al.  Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand , 2012 .

[84]  Reza Tavakkoli-Moghaddam,et al.  A bi-objective transportation-location arc routing problem , 2020, Transportation Letters.

[85]  Tandra Pal,et al.  Uncertain multi-objective Chinese postman problem , 2018, Soft Comput..

[86]  Gilbert Laporte,et al.  A fast heuristic for large-scale capacitated arc routing problems , 2018, J. Oper. Res. Soc..

[87]  Jens Lysgaard,et al.  A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands , 2007, Oper. Res. Lett..

[88]  Bo Zhang,et al.  Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights , 2012 .

[89]  Graham Kendall,et al.  Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .

[90]  Xin Yao,et al.  Capacitated arc routing problem in uncertain environments , 2010, IEEE Congress on Evolutionary Computation.

[91]  Xin Yao,et al.  Dynamic salting route optimisation using evolutionary computation , 2005, 2005 IEEE Congress on Evolutionary Computation.

[92]  Xin Yao,et al.  Estimation of the Distribution Algorithm With a Stochastic Local Search for Uncertain Capacitated Arc Routing Problems , 2016, IEEE Transactions on Evolutionary Computation.

[93]  Gilbert Laporte,et al.  The bridges of Königsberg—A historical perspective , 2007 .

[94]  Le Xie,et al.  Data-driven decision making in power systems with probabilistic guarantees: Theory and applications of chance-constrained optimization , 2019, Annu. Rev. Control..

[95]  Reza Tavakkoli-Moghaddam,et al.  Scenario-Based Location Arc Routing Problems: Introducing Mathematical Models , 2017 .

[96]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[97]  Demetrio Laganà,et al.  Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows , 2018, Eur. J. Oper. Res..

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

[99]  Adnan Yassine,et al.  Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty , 2018, ICORES.

[100]  Louis Caccetta,et al.  Branch and Cut Methods for Mixed Integer Linear Programming Problems , 2000 .

[101]  Shabbir Ahmed,et al.  Relaxations and approximations of chance constraints under finite distributions , 2018, Mathematical Programming.

[102]  Demetrio Laganà,et al.  A dynamic multi-period general routing problem arising in postal service and parcel delivery systems , 2021, Comput. Oper. Res..

[103]  Maged M. Dessouky,et al.  A Model and Algorithm for the Courier Delivery Problem with Uncertainty , 2010, Transp. Sci..

[104]  Gilbert Laporte,et al.  Improvement Procedures for the Undirected Rural Postman Problem , 1999, INFORMS J. Comput..

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

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

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

[108]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..

[109]  Armin Fügenschuh,et al.  Computational Integer Programming and Cutting Planes , 2005 .

[110]  André Langevin,et al.  A robust optimization approach for the road network daily maintenance routing problem with uncertain service time , 2016 .

[111]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[112]  Roberto Baldacci,et al.  Exact methods based on node routing formulations for arc routing problems , 2004 .

[113]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

[114]  Ke Tang,et al.  A developmental solution to (dynamic) capacitated arc routing problems using genetic programming , 2012, GECCO '12.

[115]  Humberto J. Longo,et al.  A compact transformation of arc routing problems into node routing problems , 2015, Ann. Oper. Res..

[116]  Gilbert Laporte,et al.  Designing collection routes through bank branches , 1991, Comput. Oper. Res..

[117]  Qingfu Zhang,et al.  A Survey on Cooperative Co-Evolutionary Algorithms , 2019, IEEE Transactions on Evolutionary Computation.

[118]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .

[119]  Daniel Kuhn,et al.  From Data to Decisions: Distributionally Robust Optimization is Optimal , 2017, Manag. Sci..

[120]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[121]  Xin Yao,et al.  A memetic algorithm for uncertain Capacitated Arc Routing Problems , 2013, 2013 IEEE Workshop on Memetic Computing (MC).

[122]  András Prékopa,et al.  Uniform quasi-concavity in probabilistic constrained stochastic programming , 2011, Oper. Res. Lett..

[123]  Zili Zhang,et al.  Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem , 2017, GECCO.

[124]  Mahdi Alinaghian,et al.  Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application , 2016 .