New large-scale data instances for CARP and new variations of CARP

References

• Amponsah SK, Salhi S. 2004. The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. Waste Manag 24:711–721.
   PubMed Web of Science ®Google Scholar
• Aráoz J, Fernández E, Franquesa C. 2013. Grasp and path relinking for the clustered prize-collecting arc routing problem. J Heuristics. 19:343–371.
   Web of Science ®Google Scholar
• Bautista J, Fernández E, Pereira J. 2008. Solving an urban waste collection problem using ants heuristics. Comput Oper Res. 35:3020–3033. Part Special Issue: Bio-inspired Methods in Combinatorial Optimization.
   Web of Science ®Google Scholar
• Belenguer JM, Benavent E, Lacomme P, Prins C. 2006. Lower and upper bounds for the mixed capacitated arc routing problem. Comput Oper Res. 33:3363–3383. Part Special Issue: Recent Algorithmic Advances for Arc Routing Problems.
   Web of Science ®Google Scholar
• Benavent E, Campos V, Corberán Á. 1992. The capacitated arc routing problem: lower bounds. Networks. 22:669–690.
   Web of Science ®Google Scholar
• Brandão J, Eglese RW. 2008. A deterministic tabu search algorithm for the capacitated arc routing problem. Comput Oper Res. 35:1112–1126.
   Web of Science ®Google Scholar
• Constantino M, Gouveia L, Mourão MC, Nunes AC. 2015. The mixed capacitated arc routing problem with non-overlapping routes. Eur J Oper Res. 244:445–456.
   Web of Science ®Google Scholar
• Corberán Á, Fernández E, Franquesa C, Sanchis JM. 2011. The windy clustered prize-collecting arc-routing problem. Transport Sci. 45:317–334.
   Web of Science ®Google Scholar
• Corberán Á, Laporte G. 2015. Arc routing: problems, methods, and applications. Vol. 20. Philadelphia: SIAM.
   Google Scholar
• Coutinho-Rodrigues J, Rodrigues N, Clímaco J. 1993. Solving an urban routing problem using heuristics: a successful case study. Belg J Oper Res Statist Comput Sci. 33:2.
   Google Scholar
• Del Pia A, Filippi C. 2006. A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int T Oper Res. 13:125–141.
   Google Scholar
• Dos Santos CG, Scarpin CT, Da Silva FP. 2016. Mathematical modeling for periodic capacitated arc routing problem. Int J Eng. 8:8269.
   Google Scholar
• Econet AS. 2012. Idekatalog - Ordninger for dagrenovation. Danish.
   Google Scholar
• Eglese RW, Murdock H. 1991. Routing road sweepers in a rural area. J Oper Res Soc. 42:281–288.
   Web of Science ®Google Scholar
• Frederiksberg county. 2017. Available from http://www.frederiksberg.dk/affald]. Danish.
   Google Scholar
• Ghiani G, Guerriero F, Improta G, Musmanno R. 2005. Waste collection in southern italy: solution of a real-life arc routing problem. Int T Oper Res. 12:135–144.
   Google Scholar
• Ghiani G, Improta G, Laporte G. 2001. The capacitated arc routing problem with intermediate facilities. Networks. 37:134–143.
   Web of Science ®Google Scholar
• Ghiani G, Laganà D, Laporte G, Mari F. 2010. Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J Heuristics. 16:211–233.
   Web of Science ®Google Scholar
• Golden BL, DeArmon JS, Baker EK. 1983. Computational experiments with algorithms for a class of routing problems. Comput Oper Res. 10:47–59.
   Web of Science ®Google Scholar
• Golden BL, Wong RT. 1981. Capacitated arc routing problems. Networks. 11:305–315.
   Web of Science ®Google Scholar
• Gouveia L, Mourão MC, Pinto LS. 2010. Lower bounds for the mixed capacitated arc routing problem. Comput Oper Res. 37:692–699.
   Web of Science ®Google Scholar
• Kiushi M, Shinano Y, Hirabayashi R, Saruwatari Y. 1995. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. Abstract of the 1995 Spring National Conference of the Operational Research Society of Japan, p. 28–29.
   Google Scholar
• KortCenter A/S. 2017. Available from: http://www.kortcenter.dk]. Danish.
   Google Scholar
• Li LYO, Eglese RW. 1996. An interactive algorithm for vehicle routing for winter-gritting. J Oper Res Soc. 47:217–228.
   Web of Science ®Google Scholar
• McBride R. 1982. Controlling left and u-turns in the routing of refuse collection vehicles. Comput Oper Res. 9:145–152.
   Web of Science ®Google Scholar
• Mei Y, Tang K, Yao X. 2011. A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern B Cybern. 41:1654–1667.
   Web of Science ®Google Scholar
• Mourão MC, Almeida MT. 2000. Lower-bounding and heuristic methods for a refuse collection vehicle routing problem1. Eur J Oper Res. 121:420–434.
   Web of Science ®Google Scholar
• Mourão MC, Amado L. 2005. Heuristic method for a mixed capacitated arc routing problem: A refuse collection application. Eur J Oper Res. 160:139–153.
   Web of Science ®Google Scholar
• Mourão MC, Nunes AC, Prins C. 2009. Heuristic methods for the sectoring arc routing problem. Eur J Oper Res. 196:856–868.
   Web of Science ®Google Scholar
• Odense Renovation A/S. 2017. Available from: http://www.odenserenovation.dk/]. Danish.
   Google Scholar
• Polacek M, Doerner KF, Hartl RF, Maniezzo V. 2008. A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics. 14:405–423.
   Web of Science ®Google Scholar
• Reno Djurs I/S. 2017. Available from: [http://www.renodjurs.dk/]. Danish.
   Google Scholar
• Renosyd. 2017. Available from: http://www.renosyd.dk/]. Danish.
   Google Scholar
• Santos L, Coutinho-Rodrigues J, Antunes CH. 2011. A web spatial decision support system for vehicle routing using google maps. Dec Support Syst. 51:1–9.
   Web of Science ®Google Scholar
• Zhang Y, Mei Y, Tang K, Jiang K. 2016. Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Appl Soft Comput. 52:1130–1142.
   Web of Science ®Google Scholar