SPECIAL ISSUE ARTICLE
Arc routing problems: A review of the past, present, and future
Ángel
Corberán,
Richard Eglese,
Geir Hasle,
Isaac Plana,
José María Sanchis,
Corresponding Author
Ángel Corberán
Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain
Correspondence
Ángel Corberán, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain.
Email: [email protected]
Search for more papers by this authorRichard Eglese
Department of Management Science, Lancaster University, Lancashire, UK
Search for more papers by this authorGeir Hasle
Department of Mathematics and Cybernetics, SINTEF Digital, Oslo, Norway
Search for more papers by this authorIsaac Plana
Departamento de Matemáticas para la Economía y la Empresa, Universidad de Valencia, Valencia, Spain
Search for more papers by this authorJosé María Sanchis
Departamento de Matemática Aplicada, Universidad Politécnica de Valencia, Valencia, Spain
Search for more papers by this authorÁngel
Corberán,
Richard Eglese,
Geir Hasle,
Isaac Plana,
José María Sanchis,
Corresponding Author
Ángel Corberán
Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain
Correspondence
Ángel Corberán, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain.
Email: [email protected]
Search for more papers by this authorRichard Eglese
Department of Management Science, Lancaster University, Lancashire, UK
Search for more papers by this authorGeir Hasle
Department of Mathematics and Cybernetics, SINTEF Digital, Oslo, Norway
Search for more papers by this authorIsaac Plana
Departamento de Matemáticas para la Economía y la Empresa, Universidad de Valencia, Valencia, Spain
Search for more papers by this authorJosé María Sanchis
Departamento de Matemática Aplicada, Universidad Politécnica de Valencia, Valencia, Spain
Search for more papers by this authorDedicated to the memory of Nicos Christofides (1942-2019).
Funding information: Ministerio de Economía y Competitividad and Fondo Europeo de Desarrollo Regional, PGC2018-099428-B-I00; The Research Council of Norway, 246825/O70 (DynamITe); 263031/O70 (AXIOM)
Abstract
Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applications.
REFERENCES
- 1H.M. Afsar, A branch-and-price algorithm for capacitated arc routing problem with flexible time windows, Electron. Notes Discrete Math. 36 (2010), 319–326.
10.1016/j.endm.2010.05.041 Google Scholar
- 2C. Ahabchane, A. Langevin, and M. Trépanier, The mixed capacitated general routing problem with time-dependent demands, Networks 76 (2020), 467–484.
- 3V. Akbari and F.S. Salman, Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity, Eur. J. Oper. Res. 257 (2017), 625–640.
- 4M. Alapati, Drone routing for damage assessment on power distribution systems under hilf events, Ph.D. thesis, University of North Carolina at Charlotte, 2018.
- 5M. Albareda-Sambola, “ Location-routing and location-arc routing,” Location Science, G. Laporte et al. (eds), Springer, Berlin, 2015, pp. 399–418.
10.1007/978-3-319-13111-5_15 Google Scholar
- 6N. Altay and W.G. Green, OR/MS research in disaster operations management, Eur. J. Oper. Res. 175 (2006), 475–493.
- 7C.A. Amaya, A. Langevin, and M. Trépanier, A heuristic method for the capacitated arc routing problem with refill points and multiple loads, J. Oper. Res. Soc. 61 (2010), 1095–1103.
- 8
A. Amini, R. Tavakkoli-Moghaddam, and S. Ebrahimnejad, A bi-objective transportation-location arc routing problem, Transp. Lett. (2019), 1–15, https://doi.org/10.1080/19427867.2019.1679405.
10.1080/19427867.2019.1679405 Google Scholar
- 9U.F. Aminu and R. Eglese, A constraint programming approach to the Chinese postman problem with time windows, Comput. Oper. Res. 33 (2006), 3423–3431.
- 10J. Aráoz, E. Fernández, and C. Franquesa, GRASP and path relinking for the clustered prize-collecting arc routing problem, J. Heuristics 19 (2013), 343–371.
- 11J. Aráoz, E. Fernández, and C. Franquesa, The generalized arc routing problem, TOP 25 (2017), 497–525.
- 12C. Arbib, M. Servilio, C. Archetti, and M.G. Speranza, The directed profitable location rural postman problem, Eur. J. Oper. Res. 236 (2014), 811–819.
- 13C. Archetti, L. Bertazzi, D. Laganá, and F. Vocaturo, The undirected capacitated general routing problem with profits, Eur. J. Oper. Res. 257 (2017), 822–833.
- 14C. Archetti, Á. Corberán, I. Plana, J.M. Sanchis, and M.G. Speranza, The team orienteering arc routing problem, Transp. Sci. 48 (2014), 442–457.
- 15C. Archetti, Á. Corberán, I. Plana, J.M. Sanchis, and M.G. Speranza, A matheuristic for the team orienteering arc routing problem, Eur. J. Oper. Res. 245 (2015), 392–401.
- 16C. Archetti, Á. Corberán, I. Plana, J.M. Sanchis, and M.G. Speranza, A branch-and-cut algorithm for the orienteering arc routing problem, Comput. Oper. Res. 66 (2016), 95–104.
- 17C. Archetti, D. Feillet, A. Hertz, and M.G. Speranza, The undirected capacitated arc routing problem with profits, Comput. Oper. Res. 37 (2010), 1860–1869.
- 18C. Archetti, G. Guastaroba, and M.G. Speranza, Reoptimizing the rural postman problem, Comput. Oper. Res. 40 (2013), 1306–1313.
- 19C. Archetti, G. Guastaroba, and M.G. Speranza, An ILP refined tabu search for the directed profitable rural postman problem, Discrete Appl. Math. 163 (2014), 3–16.
- 20C. Archetti and M.G. Speranza, “ Arc routing problems with profits,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 281–299.
10.1137/1.9781611973594.ch10 Google Scholar
- 21A. Assad, Leonhard Euler: A brief appreciation, Networks 49 (2007), 190–198.
- 22T. Ávila, Á. Corberán, I. Plana, and J.M. Sanchis, A branch-and-cut algorithm for the profitable windy rural postman problem, Eur. J. Oper. Res. 249 (2016), 1092–1101.
- 23T. Ávila, Á. Corberán, I. Plana, and J.M. Sanchis, A new branch-and-cut algorithm for the generalized directed rural postman problem, Transplant Sci 50 (2016), 750–761.
10.1287/trsc.2015.0588 Google Scholar
- 24T. Ávila, Á. Corberán, I. Plana, and J.M. Sanchis, Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem, EURO J. Comput. Optim. 5 (2017), 339–365.
- 25B. Behdani and J.C. Smith, An integer-programming-based approach to the close-enough traveling salesman problem, INFORMS J. Comput. 26 (2014), 415–432.
- 26J.M. Belenguer, E. Benavent, and S. Irnich, “ The capacitated arc-routing problem: Exact methods,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 183–221.
- 27J.M. Belenguer, E. Benavent, N. Labadi, C. Prins, and M. Reghioui, Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic, Transp. Sci. 44 (2010), 206–220.
- 28E.J. Beltrami and L.D. Bodin, Networks and vehicle routing for municipal waste collection, Networks 4 (1974), 65–94.
10.1002/net.3230040106 Google Scholar
- 29E. Benavent, Á. Corberán, L. Gouveia, M.C. Mourão, and L.S. Pinto, Profitable mixed capacitated arc routing and related problems, TOP 23 (2015), 244–274.
- 30E. Benavent, Á. Corberán, D. Laganá, and F. Vocaturro, The periodic rural postman problem with irregular services on mixed graphs, Eur. J. Oper. Res. 276 (2019), 826–839.
- 31P. Beraldi, M.E. Bruni, D. Laganà, and R. Musmanno, The mixed capacitated general routing problem under uncertainty, Eur. J. Oper. Res. 240 (2015), 382–392.
- 32N. Bianchessi, Á. Corberán, I. Plana, M. Reula, and J.M. Sanchis, On the min-max close-enough arc routing problem, 2020, Submitted.
- 33X. Bing, J.M. Bloemhof, T. Rodrigues-Pereira, C.Y.W.A.P. Barbosa-Povoa, and J.G.A.J. van der Vorst, Research challenges in municipal solid waste logistics management, Waste Manage. 48 (2016), 584–592.
- 34D. Black, R. Eglese, and S. Wøhlk, The time-dependent prize-collecting arc routing problem, Comput. Oper. Res. 40 (2013), 526–535.
- 35C.A. Blazquez, A. Beghelli, and V.P. Meneses, A novel methodology for determining low-cost fine particulate matter street sweeping routes, J. Air Waste Manage. Assoc. 62 (2012), 242–251.
- 36L.D. Bodin and S.J. Kursh, A computer-assisted system for the routing and scheduling of street sweepers, Oper. Res. 26 (1987), 525–537.
- 37R. Borges-Lopes, F. Plastria, C. Ferreira, and B. Sousa-Santos, Location-arc routing problem: Heuristic approaches and test instances, Comput. Oper. Res. 43 (2014), 309–317.
- 38A. Bosco, D. Laganà, R. Musmanno, and F. Vocaturo, Modeling and solving the mixed capacitated general routing problem, Optim. Lett. 7 (2013), 1451–1469.
- 39T. Calogiuri, G. Ghiani, E. Guerriero, and R. Mansini, A branch-and-bound algorithm for the time-dependent rural postman problem, Comput. Oper. Res. 102 (2019), 150–157.
- 40J.F. Campbell, Á. Corberán, I. Plana, and J.M. Sanchis, Drone arc routing problems, Networks 72 (2018), 543–559.
- 41J.F. Campbell, Á. Corberán, I. Plana, J.M. Sanchis, and P. Segura, A matheuristic for the length constrained k-drones rural postman problem, 2019, Submitted.
- 42J.F. Campbell, Á. Corberán, I. Plana, J.M. Sanchis, and P. Segura, Drones and the rural postman problem, 2020, Submitted.
- 43J.F. Campbell, A. Langevin, and N. Perrier, “ Advances in vehicle routing for snow plowing,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 321–350.
- 44F. Carrabs, C. Cerrone, R. Cerulli, and M. Gaudioso, A novel discretization scheme for the close enough traveling salesman problem, Comput. Oper. Res. 78 (2017), 163–171.
- 45R. Castro-Campos, C.A. Rodríguez, and F. Zaragoza-Martínez, Plowing with precedence in polynomial time, Networks 76 (2020), 451–466.
- 46 M.K. Çodur and M. Yılmaz, A time-dependent hierarchical Chinese postman problem, Central Eur. J. Oper. Res. 28 (2018), 337–366.
- 47C. Cerrone, R. Cerulli, B.L. Golden, and R. Pentangelo, “ A flow formulation for the close-enough arc routing problem,” Optimization and Decision Science: Methodologies and Applications. ODS 2017, A. Sforza and C. Sterle (eds), Springer, New York, 2017, pp. 539–546.
10.1007/978-3-319-67308-0_54 Google Scholar
- 48T.S. Chang and H.M. Yen, City-courier routing and scheduling problems, Eur. J. Oper. Res. 223 (2012), 489–498.
- 49H. Chen, T. Cheng, and J. Shawe-Taylor, A balanced route design for min-max multiple-depot rural postman problem (MMMDRPP): A police patrolling case, Int. J. Geogr. Inform. Sci. 32 (2018), 169–190.
- 50L. Chen, M. Gendreau, M.H. Hà, and A. Langevin, A robust optimization approach for the road network daily maintenance routing problem with uncertain service time, Transp. Res. E: Logist. Transp. Rev. 85 (2016), 40–51.
- 51L. Chen, M.H. Hà, A. Langevin, and M. Gendreau, Optimizing road network daily maintenance operations with stochastic service and travel times, Transp. Res. E: Logist. Transp. Rev. 64 (2014), 88–102.
- 52S. Chen, B.L. Golden, R. Wong, and H. Zhong, Arc-routing models for small-package local routing, Transp. Sci. 43 (2009), 43–55.
- 53J.Y.J. Chow, Dynamic UAV-based traffic monitoring as a stochastic arc-inventory routing policy, Int. J. Transp. Sci. Technol. 5 (2016), 167–185.
10.1016/j.ijtst.2016.11.002 Google Scholar
- 54C.H. Christiansen, J. Lysgaard, and S. Wøhlk, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Oper. Res. Lett. 37 (2009), 392–398.
- 55M. Colombi and R. Mansini, New results for the directed profitable rural postman problem, Eur. J. Oper. Res. 238 (2014), 760–773.
- 56Á. Corberán, G. Erdoğan, G. Laporte, I. Plana, and J.M. Sanchis, The Chinese postman problem with load-dependent costs, Transp. Sci. 52 (2018), 370–385.
- 57Á. Corberán, E. Fernández, C. Franquesa, and J.M. Sanchis, The windy clustered prize-collecting arc-routing problem, Transp. Sci. 45 (2011), 317–334.
- 58Á. Corberán and G. Laporte, “ Arc routing: Problems, methods and applications,” MOS-SIAM Series on Optimization, SIAM, Philadelphia, 2014.
- 59Á. Corberán, I. Plana, M. Reula, and J.M. Sanchis, A matheuristic for the distance-constrained close-enough arc routing problem, TOP 27 (2019), 312–326.
- 60Á. Corberán, I. Plana, M. Reula, and J.M. Sanchis, On the distance-constrained close enough arc routing problem, 2020, Submitted.
- 61Á. Corberán, I. Plana, A. Rodríguez-Chía, and J.M. Sanchis, A branch-and-cut algorithm for the maximum benefit Chinese postman problem, Math. Program. 141 (2013), 21–48.
- 62Á. Corberán, I. Plana, and J.M. Sanchis, “ The rural postman problem on directed, mixed, and windy graphs,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 101–128.
- 63Á. Corberán and C. Prins, Recent results on arc routing problems: An annotated bibliography, Networks 56 (2010), 50–69.
- 64Á. Corberán, B.L. Golden, O. Lum, I. Plana, and J.M. Sanchis, Aesthetic considerations for the min-max k-windy rural postman problem, Networks 70 (2017), 216–232.
- 65W.P. Coutinho, A. Subramanian, R.Q. do Nascimento, and A.A. Pessoa, A branch-and-bound algorithm for the close enough traveling salesman problem, INFORMS J. Comput. 28 (2016, 765), 752.
- 66T. Cura, An artificial bee colony approach for the undirected capacitated arc routing problems with profits, Int. J. Oper. Res. 17 (2013), 483–508.
10.1504/IJOR.2013.054973 Google Scholar
- 67L.E. de la Torre, I.S. Dolinskaya, and K.R. Smilowitz, Disaster relief routing: Integrating research and practice, Socioecon. Plann. Sci. 46 (2012), 88–97.
10.1016/j.seps.2011.06.001 Google Scholar
- 68A. Del-Pia and C. Filippi, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, Int. Trans. Oper. Res. 13 (2006), 125–141.
10.1111/j.1475-3995.2006.00539.x Google Scholar
- 69R. Dewil, P. Vansteenwegen, and D. Cattrysse, A review of cutting path algorithms for laser cutters, Int. J. Adv. Manuf. Technol. 87 (2016), 1865–1884.
- 70G. Dhein, O.C.B. de Araújo, and G. Cardoso, Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles, Expert Syst. Appl. 92 (2018), 276–288.
- 71M. Dille and S. Singh, Efficient aerial coverage search in road networks, AIAA Conference on Guidance, Navigation, and Control (GNC) Conference, Boston, 2013.
- 72
J. Dong, N. Yang, and M. Chen, “ Heuristic approaches for a TSP variant: The automatic meter reading shortest tour problem,” Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Springer, US, 2007, pp. 145–163.
10.1007/978-0-387-48793-9_10 Google Scholar
- 73M. Drexl, On some generalized routing problems, Ph.D. thesis, Rheinisch-Westfälische Technische Hochschule, Aachen University, 2007.
- 74M. Drexl, On the generalized directed rural postman problem, J. Oper. Res. Soc. 65 (2014), 1143–1154.
- 75M. Dror, Arc Routing: Theory, Solutions and Applications, Kluwer Academic Publishers, Boston/Dordrecht/London, 2000.
10.1007/978-1-4615-4495-1 Google Scholar
- 76M. Dror, J.M.Y. Leung, and P.A. Mullaseril, “ Livestock feed distribution and arc traversal problems,” Arc Routing: Theory, Solutions and Applications, M. Dror (ed.), Kluwer Academic Publishers, Boston/Dordrecht/London, 2000, pp. 443–474.
10.1007/978-1-4615-4495-1_12 Google Scholar
- 77B. Dussault, B.L. Golden, C. Groër, and E. Wasil, Plowing with precedence: A variant of the windy postman problem, Comput. Oper. Res. 40 (2013), 1047–1059.
- 78B. Dussault, B.L. Golden, and E. Wasil, The downhill plow problem with multiple plows, J. Oper. Res. Soc. 65 (2014), 1465–1474.
- 79K. Easton and J.A. Burdick, Coverage algorithm for multi-robot boundary inspection, Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, 2005.
- 80J. Edmonds, Paths, trees and flowers, Can. J. Math. 17 (1965), 449–467.
- 81J. Edmonds and E. Johnson, Matching, Euler tours and the Chinese postman problem, Math. Program. 5 (1973), 88–124.
10.1007/BF01580113 Google Scholar
- 82R. Eglese, Routeing winter gritting vehicles, Discrete Appl. Math. 48 (1994), 231–244.
- 83R. Eglese, B.L. Golden, and E. Wasil, “ Route optimization for meter reading and salt spreading,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 303–320.
- 84R. Eglese, W. Maden, and A. Slater, A road timetable to aid vehicle routing and scheduling, Comput. Oper. Res. 33 (2006), 3508–3519.
- 85R. Eglese and H. Murdock, Routeing road sweepers in a rural area, J. Oper. Res. Soc. 42 (1991), 281–288.
- 86J. Euchi and H. Chabchoub, Hybrid metaheuristics for the profitable arc tour problem, J. Oper. Res. Soc. 62 (2011), 2013–2022.
- 87A. Eydi and L. Javazi, Model and solution approach for multi objective-multi commodity capacitated arc routing problem with fuzzy demand, J. Ind. Syst. Eng. 5 (2012), 208–229.
- 88E. Fernández, D. Fontana, and M.G. Speranza, On the collaboration uncapacitated arc routing problem, Comput. Oper. Res. 67 (2016), 120–131.
- 89E. Fernández, G. Laporte, and J. Rodríguez-Pereira, A branch-and-cut algorithm for the multidepot rural postman problem, Transp. Sci. 52 (2018), 353–369.
- 90E. Fernández, G. Laporte, and J. Rodríguez-Pereira, Exact solution of several families of location-arc routing problems, Transp. Sci. 53 (2019), 1313–1333. https://doi.org/10.1287/trsc.2018.0881.
- 91E. Fernández and J. Rodríguez-Pereira, Multi-depot rural postman problem, TOP 25 (2017), 340–372.
- 92G. Fleury, P. Lacomme, and C. Prins, “ Evolutionary algorithms for stochastic arc routing problems,” Applications of Evolutionary Computing, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 501–512.
- 93G. Fleury, P. Lacomme, C. Prins, and M. Sevaux, A memetic algorithm for a bi-objective and stochastic CARP, Proceedings of The Sixth Metaheuristics International Conference, Vienna, Austria, 2005.
- 94K.Y. Fok, C.T. Cheng, and C.K. Tse, A refinement process for nozzle path planning in 3D printing, 2017 IEEE International Symposium on Circuits and Systems (ISCAS), Baltimore, MD, 2017, pp. 1–4.
- 95G. Frederickson, Approximation algorithms for some postman problems, J. ACM 26 (1979), 538–554.
- 96G.E.A. Fröhlich and K.F. Dörner, Metaheuristics for the multi-objective and periodic node, edge, arc routing problem considering costs and route inconsistency, Networks 76 (2020), 431–450.
- 97G. Galindo and R. Batta, Review of recent developments in OR/MS research in disaster operations management, Eur. J. Oper. Res. 230 (2013), 201–211.
- 98R. Garfinkel and I. Webb, On crossings, the crossing postman problem, and the rural postman problem, Networks 34 (1999), 173–180.
- 99D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, and N. Vathis, Efficient metaheuristics for the mixed team orienteering problem with time windows, Algorithms 9 (2016), 2–26.
- 100M. Gendreau, G. Laporte, and F. Semet, The covering tour problem, Oper. Res. 45 (1997), 568–576.
- 101G. Ghiani, G. Improta, and G. Laporte, The capacitated arc routing problem with intermediate facilities, Networks 37 (2001), 134–143.
- 102G. Ghiani, M.C. Mourão, L.S. Pinto, and D. Vigo, “ Routing in waste collection applications,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 351–370.
- 103N. Golbaharan, An application of optimization to the snow removal problem: A column generation approach, Ph.D. thesis, Linköping University (Sweden), 2001.
- 104B. Golden and R. Wong, Capacitated arc routing problems, Networks 11 (1981), 305–315.
- 105B.L. Golden, A.A. Assad, and E.A. Wasil, “ Routing vehicles in the real world: Applications in the solid waste, beverage, food, diary, and newspaper industries,” The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM, Philadelphia, 2002, pp. 245–286.
10.1137/1.9780898718515.ch10 Google Scholar
- 106S. Gonzalez-Martin, A.A. Juan, D. Riera, M.G. Elizondo, and J.J. Ramos, A simheuristic algorithm for solving the arc routing problem with stochastic demands, J. Simul. 12 (2018), 53–66.
- 107L. Grandinetti, F. Guerriero, D. Laganá, and O. Pisacane, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Comput. Oper. Res. 39 (2012), 2300–2309.
- 108I. Gribkovskaia, Ø. Halskau, and G. Laporte, The bridges of Königsberg, a historical perspective, Networks 49 (2007), 199–203.
- 109M. Guan, Graphic programming using odd or even points, Chin. Math. 1 (1962), 273–277.
- 110C. Gueguen, Méthodes de résolution exacte pour les problèmes de tournées de véhicules, Ph.D. thesis, Ecole centrale de Paris, 1999.
- 111D.J. Gulczynski, J.W. Heath, and C.C. Price, “ The close enough traveling salesman problem: A discussion of several heuristics,” Perspectives in Operations Research, Springer, New York, 2006, pp. 217–283.
10.1007/978-0-387-39934-8_16 Google Scholar
- 112E. Gussmagg-Pfliegl, F. Tricoire, K.F. Doerner, R.F. Hartl, and S. Irnich, “ Heuristics for a real-world mail delivery problem,” Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol. 6625, C. Chio et al. (eds), Springer, Amsterdam, 2011, pp. 481–490.
10.1007/978-3-642-20520-0_49 Google Scholar
- 113M.H. Hà, N. Bostel, A. Langevin, and L.M. Rousseau, An exact algorithm for close enough traveling salesman problem, Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, 2012, pp. 233–238.
- 114M.H. Hà, N. Bostel, A. Langevin, and L.M. Rousseau, Solving the close enough arc routing problem, Networks 63 (2014), 107–118.
- 115E.E. Halvorsen-Weare and M.W. Savelsbergh, The bi-objective mixed capacitated general routing problem with different route balance criteria, Eur. J. Oper. Res. 251 (2016), 451–465.
- 116H. Handa, L. Chapman, and X. Yao, Dynamic salting route optimisation using evolutionary computation, 2005 IEEE Congress on Evolutionary Computation, 2005, pp. 158–165.
- 117N. Harris, S. Liu, S.J. Louis, and J.H. La, A genetic algorithm for multi-robot routing in automated bridge inspection, Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO '19, ACM, New York, NY, 2019, pp. 369–370.
- 118H. Hashemi-Doulabi and A. Seifi, Lower and upper bounds for location-arc routing problems with vehicle capacity constraints, Eur. J. Oper. Res. 224 (2013), 189–208.
- 119G. Hasle, “ Arc routing applications in the newspaper industry,” Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Á. Corberán and G. Laporte (eds), SIAM, Philadelphia, 2014, pp. 371–396.
- 120J. Hoeft and U. Palekar, Heuristics for the plate-cutting traveling salesman problem, IIE Trans. 29 (1997), 719–731.
10.1080/07408179708966382 Google Scholar
- 121H. Hu, T. Liu, N. Zhao, Y. Zhou, and D. Min, A hybrid genetic algorithm with perturbation for the multi-depot capacitated arc routing problem, J. Appl. Sci. 13 (2013), 32–39.
10.3923/jas.2013.3239.3244 Google Scholar
- 122S.H. Huang and P.C. Lin, Multi-treatment capacitated arc routing of construction machinery in Taiwan's smooth road project, Autom. Construct. 21 (2012), 210–218.
- 123S.H. Huang and T. Lin, Using ant colony optimization to solve periodic arc routing problem with refill points, J. Ind. Prod. Eng 31 (2014), 441–451.
- 124S. Huber, Strategic decision support for the bi-objective location-arc routing problem, 49th Hawaii International Conference on System Sciences, IEEE Computer Society Press, Koloa, 2016, pp. 1407–1416.
- 125S. Ichoua, M. Gendreau, and J.Y. Potvin, Vehicle dispatching with time-dependent travel times, Eur. J. Oper. Res. 144 (2003), 379–396.
- 126M. Iori and S. Novellani, Optimizing the nozzle path in the 3D printing process, Design Tools and Methods in Industrial Engineering. ADM 2019. Lecture Notes in Mechanical Engineering., Springer, Cham, 2020, pp. 912–924.
- 127S. Irnich, Solution of real-world postman problems, Eur. J. Oper. Res. 190 (2008), 52–67.
- 128E.L. Johnson and S. Wøhlk, Solving the capacitated arc routing problem with time windows using column generation, Tech. report, Aarhus School of Business, 2009.
- 129M. Kasaei and F.S. Salman, Arc routing problems to restore connectivity of a road network, Transp. Res. E: Logist. Transp. Rev. 95 (2016), 177–206.
- 130L. Kiilerich and S. Wøhlk, New large-scale data instances for CARP and new variations of CARP, INFOR: Inform. Syst. Oper. Res. 56 (2018), 1–32.
10.1080/03155986.2017.1303960 Google Scholar
- 131D. Krushinsky and T. van Woensel, Lower and upper bounds for location-arc routing problems with vehicle capacity constraints, Eur. J. Oper. Res. 244 (2015), 100–109.
- 132N. Labadi, C. Prins, and M. Reghioui, “ An evolutionary algorithm with distance measure for the split delivery capacitated arc routing problem,” Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol. 153, C. Cotta and J. Hemert (eds), Springer Berlin Heidelberg, Berlin, Heidelberg, 2008, pp. 275–294.
10.1007/978-3-540-70807-0_17 Google Scholar
- 133N. Labadi, C. Prins, and M. Reghioui, “ GRASP with path relinking for the capacitated arc routing problem with time windows,” Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management, A. Fink and F. Rothlauf (eds), Springer, Berlin Heidelberg, 2008, pp. 111–135.
10.1007/978-3-540-69390-1_6 Google Scholar
- 134P. Lacomme, C. Prins, and M. Sevaux, A genetic algorithm for a bi-objective capacitated arc routing problem, Comput. Oper. Res. 33 (2006), 3473–3493.
- 135D. Laganà, R. Paradiso, and F. Vocaturo, Exact solution of a periodic multi-vehicle arc routing problem, WARP3 Proceedings, Pizzo, Italy, 2019.
- 136S. Lannez, C. Artigues, J. Damay, and M. Gendreau, A railroad maintenance problem solved with a cut and column generation matheuristic, Networks 66 (2015), 40–56.
- 137G. Laporte, R. Musmanno, and F. Vocaturo, An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands, Transp. Sci. 44 (2010), 125–135.
- 138J. Lenstra and A. Rinnooy Kan, On general routing problems, Networks 6 (1976), 273–280.
10.1002/net.3230060305 Google Scholar
- 139A.N. Letchford and R. Eglese, The rural postman problem with deadline classes, Eur. J. Oper. Res. 105 (1998), 390–400.
- 140A.N. Letchford and A. Oukil, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Comput. Oper. Res. 36 (2009), 2320–2327.
- 141L. Levy and L. Bodin, “ Scheduling the postal carriers for the United States Postal Service: An application of arc partitioning and routing,” Vehicle Routing: Methods and Studies, B.L. Golden and A. Assad (eds), North-Holland, Amsterdam, 1988, pp. 359–394.
- 142M. Li, L. Zhen, S. Wang, W. Lv, and X. Qu, Unmanned aerial vehicle scheduling problem for traffic monitoring, Comput. Ind. Eng. 122 (2018), 15–23.
- 143M. Liu, H.K. Singh, and T. Ray, A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems, 2014 IEEE Congress Evolutionary Computation (CEC), 2014, pp. 595–602.
- 144Y. Liu, J. Shi, Z. Liu, J. Huang, and T. Zhou, Two-layer routing for high-voltage powerline inspection by cooperated ground vehicle and drone, Energies 12 (2019), 1–20.
- 145H. Longo, M. Poggi de Aragão, and E. Uchoa, Solving capacitated arc routing problems using a transformation to the CVRP, Comput. Oper. Res. 33 (2006), 1823–1837.
- 146T. Lotan, D. Cattrysse, and D. van Oudheusden, Wintergritting in the province of Antwerp – a combined locationand routing problem, JORBEL Belgian J. Oper. Res. Stat. Comput. Sci. 36 (1996), 141–157.
- 147Y. Lu, G. Josse, T. Emrich, U. Demiryurek, M. Renz, C. Shahabi, and M. Schubert, Scenic routes now: Efficiently solving the time-dependent arc orienteering problem, Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM '17, ACM, New York, NY, 2017, pp. 487–496.
- 148O. Lum, C. Cerrone, B.L. Golden, and E. Wasil, Partitioning a street network into compact, balanced, and visually appealing routes, Networks 69 (2017), 290–303.
- 149O. Lum, B.L. Golden, and E. Wasil, OAR Lib: An open source arc routing library, Math. Prog. Comput. 11 (2019), 587–629.
- 150O. Lum, R. Zhang, B.L. Golden, and E. Wasil, A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Comput. Oper. Res. 88 (2017), 247–257.
- 151 J. MacLachlan, Y. Mei, J. Branke, and M. Zhang, Genetic programming hyper-heuristics with vehicle collaboration for uncertain capacitated arc routing problems, Evol Comput (2019), 1–29, https://doi.org/10.1162/evco_a_00267.
- 152S. Majumder, S. Kar, and T. Pal, Uncertain multi-objective Chinese postman problem, Soft Comput. 23 (2019), 11557–11572.
- 153C. Malandraki and M. Daskin, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, Eur. J. Oper. Res. 65 (1993), 218–234.
- 154S.K. Mandal, D. Pacciarelli, A. Løkketangen, and G. Hasle, A memetic NSGA-II for the bi-objective mixed capacitated general routing problem, J. Heuristics 21 (2015), 359–390.
- 155R. Martinelli, T.A. Pham, T. Vidal, A. Baffa, M.H. Hà, and X.H. Nguyen, Time-dependent shortest path optimization and capacitated arc routing problems, WARP3 Proceedings, Pizzo, Italy, 2019.
- 156P. Matl, R.F. Hartl, and T. Vidal, Workload equity in vehicle routing: The impact of alternative workload resources, Comput. Oper. Res. 110 (2019), 116–129.
- 157Y. Mei, K. Tang, and X. Yao, Capacitated arc routing problem in uncertain environments, IEEE Congress on Evolutionary Computation, 2010, pp. 1–8.
- 158Y. Mei, K. Tang, and X. Yao, Decomposition-based memetic algorithm for multi-objective capacitated arc routing problem, IEEE Trans. Evol. Comput. 15 (2011), 151–165.
- 159Y. Mei, K. Tang, and X. Yao, A memetic algorithm for periodic capacitated arc routing problem, IEEE Trans. Syst. Man Cybern. B 41 (2011), 1654–1667.
- 160Y. Mei, K. Tang, and X. Yao, “ Evolutionary computation for dynamic capacitated arc routing problem,” Evolutionary Computation for Dynamic Optimization Problems. Studies in Computational Intelligence, S. Yang and X. Yao (eds), Springer, Berlin, 2013, pp. 377–401.
10.1007/978-3-642-38416-5_15 Google Scholar
- 161W.K. Mennell, Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem, Ph.D. thesis, University of Maryland, College Park, 2009.
- 162E. Minieka, The Chinese postman problem for mixed networks, Manage. Sci. 25 (1979), 643–648.
- 163I. Monroy, C. Amaya, and A. Langevin, The periodic capacitated arc routing problem with irregular services, Discrete Appl. Math. 161 (2013), 691–701.
- 164M. Monroy-Licht, C.A. Amaya, and A. Langevin, The rural postman problem with time windows, Networks 64 (2014), 169–180.
- 165M. Monroy-Licht, C.A. Amaya, and A. Langevin, Adaptive large neighborhood search algorithm for the rural postman problem with time windows, Networks 70 (2017), 44–59.
- 166M. Monroy-Licht, C.A. Amaya, A. Langevin, and L.M. Rousseau, The rescheduling arc routing problem, Int. Trans. Oper. Res. 24 (2017), 1325–1346.
- 167M.C. Mourão and L.S. Pinto, An updated annotated bibliography on arc routing problems, Networks 70 (2017), 144–194.
- 168P.A. Mullaseril, Capacitated rural postman problem with time windows and split delivery, Ph.D. thesis, University of Arizona, 1996.
- 169P.A. Mullaseril, M. Dror, and J. Leung, Split-delivery routeing heuristics in livestock feed distribution, J. Oper. Res. Soc. 48 (1997), 107–116.
- 170L. Muyldermans, D. Cattrysse, D. van Oudheusden, and T. Lotan, Districting for salt spreading operations, Eur. J. Oper. Res. 139 (2002), 521–532.
- 171L. Muyldermans and G. Pang, A guided local search procedure for the multi-compartment capacitated arc routing problem, Comput. Oper. Res. 37 (2010), 1662–1673.
- 172G. Nagy and S. Salhi, Location-routing: Issues, models and methods, Eur. J. Oper. Res. 177 (2007), 649–672.
- 173Y. Nobert and J. Picard, An optimal algorithm for the mixed Chinese postman problem, Networks 27 (1996), 95–108.
- 174J. Nossack, B.L. Golden, E. Pesch, and R. Zhang, The windy rural postman problem with a time-dependent zigzag option, Eur. J. Oper. Res. 258 (2017), 1131–1142.
- 175H. Oh, S. Kim, A. Tsourdos, and B.A. White, Coordinated road-network search route planning by a team of UAVs, Int. J. Syst. Sci. 45 (2014), 825–840.
- 176H. Oh, H.S. Shin, A. Tsourdos, B.A. White, and P. Silson, Coordinated road-network search for multiple UAVs using Dubins path, Advances in Aerospace Guidance, Navigation and Control, Springer Berlin Heidelberg, 2011, pp. 55–66.
- 177C. Orloff, A fundamental problem in vehicle routing, Networks 4 (1974), 35–64.
10.1002/net.3230040105 Google Scholar
- 178B.E. Oruc and B.Y. Kara, Post-disaster assessment routing problem, Transp. Res. B: Methodol. 116 (2018), 76–102.
- 179A. Otto, N. Agatz, J.F. Campbell, B.L. Golden, and E. Pesch, Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey, Networks 72 (2018), 411–458.
- 180M.L. P. Pelikánová, J. Fink, Winter road maintenance in Czech Republic, WARP3 Proceedings, 2019.
- 181W. Padungwech, Heuristic algorithms for dynamic capacitated arc routing, Ph.D. thesis, School of Mathematics, Cardiff University, 2018.
- 182 W. Padungwech, J. Thompson, and R. Lewis, Effects of update frequencies in a dynamic capacitated arc routing problem, Networks 76 (2020), 522–538.
- 183C. Papadimitriou, On the complexity of edge traversing, J. ACM 23 (1976), 544–554.
- 184D. Pecin and E. Uchoa, Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm, Transp. Sci. 53 (2019), 1673–1694.
- 185
N. Perrier, J. Campbell, A. Langevin, and M. Gendreau, “ Vehicle routing models and algorithms for winter road spreading operations,” Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions, J.R. Montoya-Torres, A.A. Juan, J.H. Huatuco, J. Faulin, and G.L. Rodriguez-Verjan (eds), IGI Global, Hershey, PA, 2012, pp. 15–45.
10.4018/978-1-61350-086-6.ch002 Google Scholar
- 186N. Perrier, A. Langevin, and J.F. Campbell, A survey of models and algorithms for winter road maintenance. Part I: System design for spreading and plowing, Comput. Oper. Res. 33 (2006), 209–238.
- 187N. Perrier, A. Langevin, and J.F. Campbell, A survey of models and algorithms for winter road maintenance. Part II: System design for snow disposal, Comput. Oper. Res. 33 (2006), 239–262.
- 188N. Perrier, A. Langevin, and J.F. Campbell, A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading, Comput. Oper. Res 34 (2007), 211–257.
- 189N. Perrier, A. Langevin, and J.F. Campbell, A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal, Comput. Oper. Res 34 (2007), 258–294.
- 190C. Prins and S. Bouchenoua, “ A memetic algorithm solving the VRP, the CARP and general routing problems with nodes, edges and arcs,” Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing 166, W.E. Hart, J.E. Smith, and N. Krasnogor (eds), Springer, Berlin, 2005, pp. 351–370.
10.1007/3-540-32363-5_4 Google Scholar
- 191C. Prodhon and C. Prins, A survey of recent research on location-routing problems, Eur. J. Oper. Res. 238 (2014), 1–17.
- 192O. Quirion-Blais, A. Langevin, and M. Trépanier, A case study of combined winter road snow plowing and de-icer spreading, Can. J. Civil Eng. 44 (2017), 1005–1013.
- 193G. Razmara, Snow removal routing problems: Theory and applications, Ph.D. thesis, Linköping University, Sweden, 2004.
- 194A. Renaud, N. Absi, and D. Feillet, The stochastic close-enough arc routing problem, Networks 69 (2017), 205–221.
- 195J. Riera-Ledesma and J.J. Salazar-González, Solving the team orienteering arc routing problem with a column generation approach, Eur. J. Oper. Res. 262 (2017), 14–27.
- 196J.P. Riquelme-Rodriguez, M. Gamache, and A. Langevin, Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints, Networks 64 (2014), 125–139.
- 197J.P. Riquelme-Rodriguez, M. Gamache, and A. Langevin, Periodic capacitated arc-routing problem with inventory constraints, J. Oper. Res. Soc. 65 (2014), 1840–1852.
- 198J.P. Riquelme-Rodríguez, M. Gamache, and A. Langevin, Location arc routing problem with inventory constraints, Comput. Oper. Res. 76 (2016), 84–94.
- 199J.C. Rivera and S.A. Lenis, The cumulative capacitated arc routing problem, VeRoLog 2019 Proceedings, Seville, Spain, 2019.
- 200A.M. Rodrigues and J. Soeiro, Cutting path as a rural postman problem: Solutions by memetic algorithms, Int. J. Combin. Optim. Probab. Inform. 3 (2012), 22–37.
- 201D.G. Rossit, D. Vigo, F. Tohmé, and M. Frutos, Visual attractiveness in routing problems: A review, Comput. Oper. Res. 103 (2019), 13–34.
- 202D.D. Russo, C. Cerrone, and A. di Placido, The mixed-constrained routing problem – A combination of CEARP and CETSP, WARP3 Proceedings, Pizzo, Italy, 2019.
- 203H. Sahin, B.Y. Kara, and O.E. Karasan, Debris removal during disaster response: A case for Turkey, Socioecon. Plan. Sci. 53 (2016), 49–59.
- 204M.A. Salazar-Aguilar, A. Langevin, and G. Laporte, Synchronized arc routing for snow plowing operations, Comput. Oper. Res. 39 (2012), 1432–1440.
- 205M.A. Salazar-Aguilar, A. Langevin, and G. Laporte, The synchronized arc and node routing problem: Application to road marking, Comput. Oper. Res. 40 (2013), 1708–1715.
- 206S.E. Schaeffer, R.Z. Ríos-Mercado, and E. Fernández, The windy prize-collecting rural postman problem: An ant-colony based heuristic, Tech. report, UANL Mexico, 2014.
- 207A. Shafahi and A. Haghani, Generalized maximum benefit multiple Chinese postman problem, Transp. Res. C 55 (2015), 261–272.
- 208R. Shang, J. Wang, L. Jiao, and Y. Wang, An improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem, Appl. Soft Comput. 19 (2014), 343–361.
- 209R. Shang, Y. Wang, J. Wang, L. Jiao, S. Wang, and L. Qi, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, Inform. Sci. 277 (2014), 609–642.
- 210R. Shuttleworth, B.L. Golden, S. Smith, and E.A. Wasil, “ Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network,” The Vehicle Routing Problem: Lastest Advances and New Challenges, B.L. Golden, S. Raghavan, and E.A. Wasil (eds), Springer, New York, 2008, pp. 487–501.
10.1007/978-0-387-77778-8_22 Google Scholar
- 211I.K. Singgih, J. Lee, and B.I. Kim, “ Node and edge surveillance using drones considering required camera altitude and battery charging,” Advances in Production Management Systems. Smart Manufacturing for Industry 4.0. APMS 2018, Springer Nature, Switzerland, 2018, pp. 55–66.
10.1007/978-3-319-99707-0_22 Google Scholar
- 212A. Sipahioglu, G. Kirlik, O. Parlaktuna, and A. Yazici, Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approach, Robot. Autom. Syst. 58 (2010), 529–538.
- 213W. Souffriau, P. Vansteenwegen, G. van den Berghe, and D. van Oudheusden, The planning of cycle trips in the province of East Flanders, Omega 39 (2011), 209–213.
- 214J. Sun, G. Tan, and G. Hou, A new integer programming formulation for the Chinese postman problem with time dependent travel times, Int. J. Comput. Inform. Eng. 5 (2011), 410–414.
- 215M. Tagmouti, M. Gendreau, and J.Y. Potvin, Arc routing problems with time-dependent service costs, Eur. J. Oper. Res. 181 (2007), 30–39.
- 216M. Tagmouti, M. Gendreau, and J.Y. Potvin, A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs, Comput. Ind. Eng. 59 (2010), 954–963.
- 217M. Tagmouti, M. Gendreau, and J.Y. Potvin, A dynamic capacitated arc routing problem with time-dependent service costs, Transp. Res. C 19 (2011), 20–28.
- 218G. Tan and J. Sun, “ An integer programming approach for the rural postman problem with time dependent travel times,” Computing and Combinatorics, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 414–431.
10.1007/978-3-642-22685-4_37 Google Scholar
- 219 D.V. Thomaz, G.V. Loch, C.T. Scarpin, and C. Schenekemberg. A Mathematical Model for the Periodic Capacitated Arc Routing Problem with Time Windows, in IEEE Latin America Transactions 16 (2018), 2567–2573.
- 220P. Vansteenwegen, W. Souffriau, and K. Sörensen, Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows, Comput. Oper. Res. 37 (2010), 1870–1876.
- 221H.F. Wang and Y.P. Wen, Time-constrained Chinese postman problems, Comput. Math. Appl. 44 (2002), 375–387.
- 222E.J. Willemse and J.W. Joubert, Benchmark dataset for undirected and mixed capacitated arc routing problems under time restrictions with intermediate facilities, Data Brief 8 (2016), 972–977.
- 223S. Wøhlk, Contributions to arc routing, Ph.D. thesis, University of Southern Denmark, 2005.
- 224S. Wøhlk and G. Laporte, A districting-based heuristic for the coordinated capacitated arc routing problem, Comput. Oper. Res. 111 (2019), 271–284.
- 225A. Yazici, G. Kirlik, O. Parlaktuna, and A. Sipahioglu, A dynamic path planning approach for multirobot sensor-based coverage considering energy constraints, IEEE Trans. Cybern. 44 (2014), 305–314.
- 226V.F. Yu and S.W. Lin, Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem, Comput. Ind. Eng. 90 (2015), 54–66.
- 227E. Zachariadis and C. Kiranoudis, Local search for the undirected capacitated arc routing problem with profits, Eur. J. Oper. Res. 210 (2011), 358–367.
- 228R. Zanotti, R. Mansini, G. Ghiani, and E. Guerriero, A kernel search approach for the time-dependent rural postman problem, WARP3 Proceedings, Pizzo, Italy, 2019.
- 229H. Zbib, Variants of the path scanning construction heuristic for the no-split multi-compartment capacitated arc routing problem, Tech. report, Aarhus University, 2017.
- 230H. Zbib and G. Laporte, The commodity-split multi-compartment arc routing problem, WARP3 Proceedings, Pizzo, Italy, 2019.
- 231H. Zbib and S. Wøhlk, A comparison of the transport requirements of different curbside waste collection systems in Denmark, Waste Manage. 87 (2019), 21–32.
- 232H. Zbib and S. Wøhlk, A multi-move decent algorithm for the no-split multi-compartment capacitated arc routing problem, VeRoLog 2017 Proceedings, Amsterdam, Netherlands, 2017.
- 233Y. Zhang, Y. Mei, K. Tang, and K. Jiang, Memetic algorithm with route decomposing for periodic capacitated arc routing problem, Appl. Soft Comput. 52 (2017), 1130–1142.
