A fast heuristic for large-scale capacitated arc routing problems

References

• Adamides, E. D., Mitropoulos, P., Giannikos, I., & Mitropoulos, I. (2009). A multi-methodological approach to the development of a regional solid waste management system. Journal of the Operational Research Society, 60(6), 758–770.
   Web of Science ®Google Scholar
• Ahr, D., & Reinelt, R. (2015). The capacitated arc routing problem: Combinatorial lower bounds. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications. Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Belenguer, J. M., Benavent, E., & Irnish, S. (2015). The capacitated arc routing problem: Exact algorithms. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications. Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Brandão, J., & Eglese, R. W. (2008). A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research, 35(4), 1112–1126.
   Web of Science ®Google Scholar
• Butsch, A., Kalcsics, J., & Laporte, G. (2014). Districting for arc routing. INFORMS Journal of Computing, 26(4), 809–824.
   Web of Science ®Google Scholar
• Clark, R. M., & Gillean, J. I. (1977). Solid waste collection: A case study. Operational Research Quarterly, 28(4), 795–806.
   Google Scholar
• Eglese, R. W. (1994). Routing winter gritting vehicles. Discrete Applied Mathematics, 48(3), 231–244.
   Web of Science ®Google Scholar
• Frederickson, G. N. (1979). Approximation algorithms for some postman problems. Journal of the Association for Computing Machinery, 26(3), 538–554.
   Web of Science ®Google Scholar
• Ghiani, G., Mourão, C., Pinto, L., & Vigo, D. (2015). Routing in waste collection applications. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications. Philadelphia: Society for Industrial and Applied Mathematics.
   Google Scholar
• Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11(3), 305–315.
   Web of Science ®Google Scholar
• Golden, B. L., DeArmon, J. S., & Baker, E. K. (1983). Computational experiments with algorithms for a class of routing problems. Computers & Operations Research, 10(1), 47–59.
   Web of Science ®Google Scholar
• Hertz, A., Laporte, G., & Nanchen Hugo, P. (1999). Improvement procedures for the undirected rural postman problem. INFORMS Journal of Computing, 11(1), 53–62.
   Web of Science ®Google Scholar
• Hertz, A., Laporte, G., & Mittaz, M. (2000). A tabu search heuristic for the capacited arc routing problem. Operations Research, 48(1), 129–135.
   Web of Science ®Google Scholar
• Hierholzer, C. (1873). Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen, 6, 30–32.
   Google Scholar
• Khan, A. M. (1987). Solid-waste disposal with intermediate transfer stations: An application of the fixed-charge location problem. Journal of the Operational Research Society, 38(1), 31–37.
   Web of Science ®Google Scholar
• Kiilerich, L., & Wøhlk, S. (in press). New large-scale data instances for CARP and new variations of CARP. INFOR.
   Web of Science ®Google Scholar
• Kim, J.-S., & Lee, D.-H. (2015). An integrated approach for collection network design, capacity planning and vehicle routing in reverse logistics. Journal of the Operational Research Society, 66(1), 76–85.
   Web of Science ®Google Scholar
• Letcher, T., & Vallero, D. (2011). Waste: A handbook for management. Amsterdam: Elsevier.
   Google Scholar
• Li, L. Y. O., & Eglese, R. W. (1996). An interactive algorithm for vehicle routeing for winter gritting. Journal of the Operational Research Society, 47(2), 217–228.
   Web of Science ®Google Scholar
• Mourão, M. C., & Amado, L. (2005). Heuristic method for a mixed capacitated arc routing problem: A refuse collection application. European Journal of Operational Research, 160(1), 139–153.
   Web of Science ®Google Scholar
• Mourão, M. C., Nunes, A. C., & Prins, C. (2009). Heuristic methods for the sectoring arc routing problem. European Journal of Operational Research, 196(3), 856–868.
   Web of Science ®Google Scholar
• Muyldermans, L. (2003). Routing, districting and location for arc traversal problems (PhD thesis). Catholic University of Leuven, Leuven, Belgium.
   Google Scholar
• Muyldermans, L., & Pang, G. (2010). On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research, 206(1), 93–103.
   Web of Science ®Google Scholar
• Muyldermans, L., & Pang, G. (2015). Variants of the capacitated arc routing problem. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications. Philadelphia: Society for Industrial and Applied Mathematics.
   Google Scholar
• Muyldermans, L., Cattrysse, D., & Van Oudheusden, D. (2003). District design for arc-routing applications. Journal of the Operational Research Society, 54(11), 1209–1221.
   Web of Science ®Google Scholar
• Polacek, M., Doerner, K. F., Hartl, R. F., & Maniezzo, V. (2008). A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics, 14(5), 405–423.
   Web of Science ®Google Scholar
• Prins, C. (2015). The Capacitated arc routing problem: Heuristics. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications. Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Prins, C., Labadi, N., & Reghioui, M. (2009). Tour splitting algorithms for vehicle routing problems. International Journal of Production Research, 47(2), 507–536.
   Web of Science ®Google Scholar
• Usberti, F. L., Frana, P. M., & Frana, A. L. M. (2013). GRASP with evolutionary path-relinking for the capacitated arc routing problem. Computers & Operations Research, 40(12), 3206–3217.
   Web of Science ®Google Scholar
• Vidal, T. (2017). Node, edge, arc routing and turn penalties: Multiple problems -- One neighborhood extension. Operations Research, 65(4), 992–1010.
   Web of Science ®Google Scholar
• Wøhlk, S. (2005). Contributions to arc routing (PhD thesis). University of Southern Denmark, Odense.
   Google Scholar
• Wøhlk, S., & Laporte, G. (2017). Computational comparison of several algorithms for the minimum cost perfect matching problem. Computers & Operations Research, 87, 107–113.
   Web of Science ®Google Scholar
• Zbib, H. (2017). Variants of the path scanning construction heuristic for the no-split multi-compartment capacitated arc routing problem (Working Paper). Aarhus University.
   Google Scholar