{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:37:20Z","timestamp":1769812640314,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T00:00:00Z","timestamp":1191628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10732-007-9050-2","type":"journal-article","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T16:15:13Z","timestamp":1191600913000},"page":"405-423","source":"Crossref","is-referenced-by-count":93,"title":["A variable neighborhood search for the capacitated arc routing problem with intermediate facilities"],"prefix":"10.1007","volume":"14","author":[{"given":"Michael","family":"Polacek","sequence":"first","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,6]]},"reference":[{"key":"9050_CR1","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/S0377-2217(99)00170-8","volume":"124","author":"A. Amberg","year":"2000","unstructured":"Amberg, A., Domschke, W., Vo\u00df, S.: Multiple center capacitated arc routing problems: a tabu search algorithm using capacitated trees. Eur. J. Oper. Res. 124, 360\u2013376 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR2","doi-asserted-by":"crossref","unstructured":"Assad, A., Golden, B.: Arc routing methods and applications. In: Ball, M., et al. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 375\u2013483 (1995)","DOI":"10.1016\/S0927-0507(05)80109-4"},{"key":"9050_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/net.20091","volume":"47","author":"R. Baldacci","year":"2006","unstructured":"Baldacci, R., Maniezzo, V.: Exact methods based on node routing formulations for arc routing problems. Networks 47, 52\u201360 (2006)","journal-title":"Networks"},{"issue":"2","key":"9050_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1018316919294","volume":"10","author":"J.M. Belenguer","year":"1998","unstructured":"Belenguer, J.M., Benavent, E.: The capacitated arc routing problem: valid inequalities and facets. Comput. Optim. Appl. 10(2), 165\u2013187 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"9050_CR5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","volume":"30","author":"J.M. Belenguer","year":"2003","unstructured":"Belenguer, J.M., Benavent, E.: A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30(5), 705\u2013728 (2003)","journal-title":"Comput. Oper. Res."},{"key":"9050_CR6","unstructured":"Belenguer, J.M., Benavent, E., Cognata, F.: A metaheuristic for the capacitated arc routing problem. Unpublished manuscript, University of Valencia, Spain 11, pp. 305\u2013315 (1997)"},{"issue":"12","key":"9050_CR7","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","volume":"33","author":"J.M. Belenguer","year":"2006","unstructured":"Belenguer, J.M., Benavent, E., Lacomme, P., Prins, C.: Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12), 3363\u20133383 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9050_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P. Beullens","year":"2003","unstructured":"Beullens, P., Muyldermans, L., Cattrysse, D., Van Oudheusden, D.: A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147, 629\u2013643 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9050_CR9","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J. Brandao","year":"2008","unstructured":"Brandao, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4), 1112\u20131126 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9050_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O. Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15(4), 347\u2013368 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9050_CR11","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.ejor.2004.08.017","volume":"169","author":"F. Chu","year":"2006","unstructured":"Chu, F., Labadi, N., Prins, C.: A scatter search for the periodic capacitated arc routing problem. Eur. J. Oper. Res. 169(2), 586\u2013605 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4495-1","volume-title":"ARC ROUTING: Theory, Solutions and Applications","author":"M. Dror","year":"2000","unstructured":"Dror, M.: ARC ROUTING: Theory, Solutions and Applications. Kluwer Academic, Dordrecht (2000)"},{"key":"9050_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90, 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"issue":"3","key":"9050_CR14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","volume":"48","author":"R.W. Eglese","year":"1994","unstructured":"Eglese, R.W.: Routing Winter gritting vehicles. Discrete Appl. Math. 48(3), 231\u2013244 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9050_CR15","doi-asserted-by":"crossref","unstructured":"Fleury, G., Lacomme, P., Prins, C.: Evolutionary algorithms for stochastic arc routing problems. In: Proceedings of the EvoWorkshops 2004, pp. 501\u2013512 (2004)","DOI":"10.1007\/978-3-540-24653-4_51"},{"key":"9050_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W.H. Freeman, New York (1979)"},{"key":"9050_CR17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1002\/net.3","volume":"37","author":"G. Ghiani","year":"2001","unstructured":"Ghiani, G., Improta, G., Laporte, G.: The capacitated arc routing problem with intermediate facilities. Networks 37, 134\u2013143 (2001)","journal-title":"Networks"},{"key":"9050_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/B:JMMA.0000038618.37710.f8","volume":"3","author":"G. Ghiani","year":"2004","unstructured":"Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Math. Model. Algorithms 3, 209\u2013223 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"9050_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11, 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"2","key":"9050_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0360-8352(02)00178-X","volume":"44","author":"P. Greistorfer","year":"2003","unstructured":"Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Comput. Ind. Eng. 44(2), 249\u2013266 (2003)","journal-title":"Comput. Ind. Eng."},{"key":"9050_CR21","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Voss, S. (ed.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic, Boston (1999)"},{"key":"9050_CR22","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Oper. Res. 48, 129\u2013135 (2000)","journal-title":"Oper. Res."},{"key":"9050_CR24","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A. Hertz","year":"2001","unstructured":"Hertz, A., Laporte, G., Mittaz, M.: A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp. Sci. 35, 425\u2013434 (2001)","journal-title":"Transp. Sci."},{"issue":"2","key":"9050_CR25","first-page":"155","volume":"9","author":"R. Hirabayashi","year":"1992","unstructured":"Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problems. Asia Pac. J. Oper. Res. 9(2), 155\u2013175 (1992)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"9050_CR26","doi-asserted-by":"crossref","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: A genetic algorithm for the capacitated routing problem and its extensions. In: Boers, E.J.W., et al. (eds.) Proceedings of the EvoWorkshops 2001, pp. 473\u2013483 (2001)","DOI":"10.1007\/3-540-45365-2_49"},{"key":"9050_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P. Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159\u2013185 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9050_CR28","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","volume":"165","author":"P. Lacomme","year":"2005","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 165(2), 535\u2013553 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR29","unstructured":"Maniezzo, V.: Metaheuristics for large directed CARP instances: urban solid waste collection operational support. Technical Report UBLCS-2004-16, Dept. Computer Science, University of Bologna (2004)"},{"key":"9050_CR30","unstructured":"Maniezzo, V., Baldacci, R.: Exact solutions of mixed CARP instances. In: Proceedings of the Odysseus 2006, Altea, Spain (2006)"},{"key":"9050_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9050_CR32","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M. Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K.F., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613\u2013627 (2004)","journal-title":"J. Heuristics"},{"issue":"3","key":"9050_CR33","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.ejor.2005.03.056","volume":"179","author":"M. Polacek","year":"2007","unstructured":"Polacek, M., Doerner, K.F., Hartl, R.F., Kiechle, G., Reimann, M.: Scheduling periodic customer visits for a traveling salesperson. Eur. J. Oper. Res. 179(3), 823\u2013837 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/1.9780898718515.ch11","volume-title":"The Vehicle Routing Problem","author":"J. Snizek","year":"2002","unstructured":"Snizek, J., Bodin, L., Levy, L., Ball, M.: Capacitated arc routing problem with vehicle-site dependencies: the Philadelphia experience. In: Toth, P. (ed.) The Vehicle Routing Problem, pp. 287\u2013308. SIAM, Philadelphia (2002)"},{"key":"9050_CR35","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"9050_CR36","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G. Ulusoy","year":"1985","unstructured":"Ulusoy, G.: The fleet size and mix problem for capacitated arc routing. Eur. J. Oper. Res. 22, 329\u2013337 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"9050_CR37","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0377-2217(83)90185-6","volume":"12","author":"C. Wirasinghe","year":"1983","unstructured":"Wirasinghe, C., Waters, N.M.: An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region. Eur. J. Oper. Res. 12, 105\u2013111 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"9050_CR38","doi-asserted-by":"crossref","first-page":"3458","DOI":"10.1016\/j.cor.2005.02.015","volume":"33","author":"S. W\u00f8hlk","year":"2006","unstructured":"W\u00f8hlk, S.: New lower bound for the capacitated arc routing problem. Comput. Oper. Res. 33(12), 3458\u20133472 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9050_CR39","volume-title":"Hanblen SWRoute: A GIS Based Spatial Decision Support System for Designing Solid Waste Collection Routes in Rural Countries","author":"X. Xin","year":"2000","unstructured":"Xin, X.: Hanblen SWRoute: A GIS Based Spatial Decision Support System for Designing Solid Waste Collection Routes in Rural Countries. The University of Tennessee, Knoxville (2000)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9050-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9050-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9050-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:29Z","timestamp":1559256869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9050-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,6]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9050"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9050-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,6]]}}}