{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:51:01Z","timestamp":1765975861464},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213789"},{"type":"electronic","value":"9783540246534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24653-4_51","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T15:08:30Z","timestamp":1294844910000},"page":"501-512","source":"Crossref","is-referenced-by-count":42,"title":["Evolutionary Algorithms for Stochastic Arc Routing Problems"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Fleury","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Lacomme","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","first-page":"1","volume-title":"35th Annual Hawaii Int. Conf. on Systems Sciences","author":"A. Amberg","year":"2002","unstructured":"Amberg, A., Vo\u00df, S.: A hierarchical relaxations lower bound for the Capacitated Arc Routing Problem. In: Sprague, R.H. (ed.) 35th Annual Hawaii Int. Conf. on Systems Sciences, Piscataway, pp. 1\u201310. IEEE, Los Alamitos (2002)"},{"issue":"5","key":"51_CR2","doi-asserted-by":"publisher","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. Computers and Operations Research\u00a030(5), 705\u2013728 (2003)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"51_CR3","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0147(3), 629\u2013643 (2003)","journal-title":"European Journal of Operational Research"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056855","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"J. Branke","year":"1998","unstructured":"Branke, J.: Creating robust solutions by means of evolutionary algorithms. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 119\u2013128. Springer, Heidelberg (1998)"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Fleury, G., Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc (2004) (to appear)","DOI":"10.1057\/palgrave.jors.2601822"},{"issue":"1","key":"51_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B.L. Golden","year":"1983","unstructured":"Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Comp. Oper. Res.\u00a010(1), 47\u201359 (1983)","journal-title":"Comp. Oper. Res."},{"key":"51_CR7","doi-asserted-by":"publisher","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\u00a011, 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"2","key":"51_CR8","doi-asserted-by":"publisher","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. Computers and Industrial Engineering\u00a044(2), 249\u2013266 (2003)","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"51_CR9","doi-asserted-by":"publisher","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. Operations Research\u00a048(1), 129\u2013135 (2000)","journal-title":"Operations Research"},{"key":"51_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-45365-2_49","volume-title":"Applications of Evolutionary Computing","author":"P. Lacomme","year":"2001","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: A genetic algorithm for the CARP and its extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 473\u2013483. Springer, Heidelberg (2001)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: Competitive memetic algorithms for arc routing problems. Annals of Operations Research (2004) (to appear)","DOI":"10.1023\/B:ANOR.0000039517.35989.6d"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"G. Laporte","year":"1996","unstructured":"Laporte, G., Gendreau, M., S\u00e9guin, R.: Stochastic vehicle routing. European Journal of Operational Research\u00a088, 3\u201312 (1996)","journal-title":"European Journal of Operational Research"},{"key":"51_CR13","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., et al. (eds.) New ideas in optimization, pp. 219\u2013234. McGraw-Hill, New York (1999)"},{"key":"51_CR14","first-page":"155","volume":"9","author":"Y. Saruwatari","year":"1992","unstructured":"Saruwatari, Y., Hirabayashi, R., Nishida, N.: Tour construction algorithm for the carp. Asia-Pacific Journal of Oper. Res.\u00a09, 155\u2013175 (1992)","journal-title":"Asia-Pacific Journal of Oper. Res."},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/4235.661550","volume":"1","author":"S. Tsutsui","year":"1997","unstructured":"Tsutsui, S., Gosh, A.: Genetic algorithms with a robust solution searching scheme. IEEE Transactions on Evolutionary Computations\u00a01, 201\u2013208 (1997)","journal-title":"IEEE Transactions on Evolutionary Computations"},{"key":"51_CR16","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a022, 329\u2013337 (1985)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24653-4_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:21Z","timestamp":1605761421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24653-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213789","9783540246534"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24653-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}