{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:37:58Z","timestamp":1760729878575},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540018698"},{"type":"electronic","value":"9783540369707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36970-8_39","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:05:20Z","timestamp":1184601920000},"page":"550-564","source":"Crossref","is-referenced-by-count":16,"title":["Multiobjective Capacitated Arc Routing Problem"],"prefix":"10.1007","author":[{"given":"P.","family":"Lacomme","sequence":"first","affiliation":[]},{"given":"C.","family":"Prins","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sevaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,1]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"A. Amberg and S. Vo\u00df. A hierarchical relaxations lower bound for the capacitated arc routing problem. In R.H. Sprague (Hrsg.), editor, Proceedings of the 35 th Annual Hawa\u00ef International Conference on Systems Sciences, pages DTIST02:1\u201310, Piscataway, 2002. IEEE.","DOI":"10.1109\/HICSS.2002.994008"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"J.M. Belenguer and E. Benavent. A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research, 2003. To appear.","DOI":"10.1016\/S0305-0548(02)00046-1"},{"key":"39_CR3","unstructured":"J.M. Belenguer, E. Benavent, and F. Cognata. Un metaheuristico para el problemade rutas por arcos con capacidades. In Proocedings of the 23th national SEIO meeting, Valencia, Spain, 1997."},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/358923.358929","volume":"32","author":"C.A. Coello Coello","year":"2000","unstructured":"C.A. Coello Coello. An updated survey of ga-based multiobjective optimization techniques. ACM Computing Surveys, 32(2):109\u2013143, 2000.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"39_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1057\/palgrave.jors.2601324","volume":"53","author":"A. Corberan","year":"2002","unstructured":"A. Corberan, E. Fernandez, M. Laguna, and R. Mart\u00ed. Heuristic solutions to the problem of routing school buses with multiple objectives. Journal of the Operational Research Society, 53(4):427\u2013435, 2002.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K. Deb","year":"1999","unstructured":"K. Deb. Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evolutionary Computation, 7(3):205\u2013230, 1999.","journal-title":"Evolutionary Computation"},{"key":"39_CR7","unstructured":"K. Deb. Multi objective optimization using evolutionary algorithms. Wiley, 2001."},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182\u2013197, 2002.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"M. Ehrgott and X. Gandibleux. Multiobjective Combinatorial Optimization, volume 52 of International Series in Operations Research and Management Science, pages 369\u2013444. Kluwer, 2002.","DOI":"10.1007\/0-306-48107-3_8"},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B.L. Golden","year":"1983","unstructured":"B.L. Golden, J.S. DeArmon, and E.K. Baker. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research, 10(1):47\u201359, 1983.","journal-title":"Computers and Operations Research"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"B.L. Golden and R.T. Wong. Capacitated arc routing problems. Networks, 11:305\u2013315, 1981.","journal-title":"Networks"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"A. Hertz, G. Laporte, and M. Mittaz. A tabu search heuristic for the capacitated arc routing problem. Operations Research, 48(1):129\u2013135, 2000.","journal-title":"Operations Research"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0925-5273(98)00250-3","volume":"62","author":"S.C. Hong","year":"1999","unstructured":"S.C. Hong and Y.B. Park. A heuristic for bi-objective vehicle routing problem with time windows constraints. International Journal of Production Economics, 62:249\u2013258, 1999.","journal-title":"International Journal of Production Economics"},{"key":"39_CR14","series-title":"Research report","volume-title":"Annals of Operations Research","author":"P. Lacomme","year":"2002","unstructured":"P. Lacomme, C. Prins, and W. Ramdane-Ch\u00e9rif. Competitive memetic algorithms for arc routing problems. Annals of Operations Research, 2002. To appear. See also Research report LOSI-2001-01, Universit\u00e9 de Technologie de Troyes, France."},{"key":"39_CR15","unstructured":"P. Moscato. New ideas in optimization, chapter Memetic algorithms: a short introduction, pages 219\u2013234. MacGraw-Hill, 1999."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0360-8352(89)90165-4","volume":"16","author":"Y.B. Park","year":"1989","unstructured":"Y.B. Park and C.P. Koelling. An interactive computerized algorithm for multicriteria vehicle routing problems. Computers and Industrial Engineering, 16:477\u2013490, 1989.","journal-title":"Computers and Industrial Engineering"},{"key":"39_CR17","unstructured":"A. Riise. Comparing genetic algorithms and tabu search for multi-objective optimization. In Abstract conference proceedings, page 29, Edinburgh, UK, July 2002. IFORS."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"W. Sessomboon, K. Watanabe, T. Irohara, and K. Yoshimoto. A study on multiobjective vehicle routing problem considering customer satisfaction with due-time (the creation of pareto optimal solutions by hybrid genetic algorithm). Transaction of the Japan Society of Mechanical Engineers, 1998.","DOI":"10.1299\/kikaic.64.1108"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G. Ulusoy","year":"1985","unstructured":"G. Ulusoy. The fleet size and mixed problem for capacitated arc routing. European Journal of Operational Research, 22:329\u2013337, 1985.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"39_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E. Zitzler","year":"2000","unstructured":"E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2):173\u2013195, 2000.","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36970-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:39:44Z","timestamp":1587778784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36970-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540018698","9783540369707"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36970-8_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}