{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:42Z","timestamp":1750307502559,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,8]]},"DOI":"10.1145\/1569901.1569947","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"325-332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A weight-coded genetic algorithm for the capacitated arc routing problem"],"prefix":"10.1145","author":[{"given":"Matthew J.W.","family":"Morgan","sequence":"first","affiliation":[{"name":"Cardiff University, Cardiff, United Kingdom"}]},{"given":"Christine L.","family":"Mumford","sequence":"additional","affiliation":[{"name":"Cardiff University, Cardiff, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Energy Outlook","author":"E. I. Administration","year":"2008","unstructured":"E. I. Administration . International Energy Outlook 2008 . Document No. DOE\/EIA-0484(2008) at, 2008. URL : http:\/\/www.eia.doe.gov\/oiaf\/ieo\/index.html. E. I. Administration. International Energy Outlook 2008. Document No. DOE\/EIA-0484(2008) at, 2008. URL: http:\/\/www.eia.doe.gov\/oiaf\/ieo\/index.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220706"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00334-X"},{"key":"e_1_3_2_1_4_1","first-page":"241","volume-title":"Third International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA97)","author":"Bradwell R.","year":"1997","unstructured":"R. Bradwell , L. Williams , and C. Valenzuela . Breeding perturbed city coordinates and 'fooling' a travelling salesman heuristic algorithm . In Third International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA97) , pages 241 -- 249 , 1997 . R. Bradwell, L. Williams, and C. Valenzuela. Breeding perturbed city coordinates and 'fooling' a travelling salesman heuristic algorithm. In Third International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA97), pages 241--249, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.07.007"},{"key":"e_1_3_2_1_6_1","first-page":"105","volume-title":"Second Nordic Workshop on Genetic Algorithms and their Applications Proceedings","author":"Branke J.","year":"1996","unstructured":"J. Branke and M. Middendorf . Searching for shortest common supersequences by means of a heuristic-based genetic algorithm . In Second Nordic Workshop on Genetic Algorithms and their Applications Proceedings , pages 105 -- 113 , 1996 . J. Branke and M. Middendorf. Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In Second Nordic Workshop on Genetic Algorithms and their Applications Proceedings, pages 105--113, 1996."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/330560.330833"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90023-A"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(73)90089-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.125"},{"key":"e_1_3_2_1_11_1","volume-title":"A Comparison of heuristics for the capacitated Chinese Postman problem. Master's thesis","author":"DeArmon J.","year":"1981","unstructured":"J. DeArmon . A Comparison of heuristics for the capacitated Chinese Postman problem. Master's thesis , University of Maryland, University of Maryland, College Park , MD, 1981 . J. DeArmon. A Comparison of heuristics for the capacitated Chinese Postman problem. Master's thesis, University of Maryland, University of Maryland, College Park, MD, 1981."},{"issue":"1","key":"e_1_3_2_1_12_1","first-page":"47","article-title":"Computational experiments with algorithms for a class of routing problems","volume":"10","author":"Golden B.","year":"1983","unstructured":"B. Golden , J. DeArmon , and E. Baker . Computational experiments with algorithms for a class of routing problems . Operations Research , 10 ( 1 ): 47 -- 59 , 1983 . B. Golden, J. DeArmon, and E. Baker. Computational experiments with algorithms for a class of routing problems. Operations Research, 10(1):47--59, 1983.","journal-title":"Operations Research"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110308"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.1.129.12455"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/331119.331185"},{"key":"e_1_3_2_1_16_1","first-page":"528","volume-title":"Genetic Programming Proceedings","author":"Julstrom B.","year":"1998","unstructured":"B. Julstrom . Insertion decoding algorithms and initial tours in a weight-coded ga for tsp . In Genetic Programming Proceedings , pages 528 -- 534 , 1998 . B. Julstrom. Insertion decoding algorithms and initial tours in a weight-coded ga for tsp. In Genetic Programming Proceedings, pages 528--534, 1998."},{"key":"e_1_3_2_1_17_1","volume-title":"Spring National Conference of the Operational Research Society of Japan","author":"Kiuchi M.","year":"1995","unstructured":"M. Kiuchi , Y. Shinano , R. Hirabayashi , and Y. Saruwatari . An exact algorithm for the capacitated arc routing problem using parallel branch and bound method . In Spring National Conference of the Operational Research Society of Japan , 1995 . M. Kiuchi, Y. Shinano, R. Hirabayashi, and Y. Saruwatari. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. In Spring National Conference of the Operational Research Society of Japan, 1995."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039517.35989.6d"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.56"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554977"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.349921"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9050-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/298151.298354"},{"key":"e_1_3_2_1_25_1","first-page":"596","volume-title":"IEEE Congress on Evolutionary Computation Proceedings","author":"Raidl G.","year":"1999","unstructured":"G. Raidl . Weight-codings in a genetic algorithm for the multiconstraint knapsack problem . In IEEE Congress on Evolutionary Computation Proceedings , pages 596 -- 603 , 1999 . G. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In IEEE Congress on Evolutionary Computation Proceedings, pages 596--603, 1999."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335888"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.10.1495"},{"key":"e_1_3_2_1_28_1","first-page":"458","volume-title":"Seventh International Conference on Genetic Algorithms (ICGA97)","author":"Valenzuela C.","year":"1997","unstructured":"C. Valenzuela and L. Williams . Improving heuristic algorithms for the travelling salesman problem by using a genetic algorithm to perturb the cities . In Seventh International Conference on Genetic Algorithms (ICGA97) , pages 458 -- 464 , 1997 . C. Valenzuela and L. Williams. Improving heuristic algorithms for the travelling salesman problem by using a genetic algorithm to perturb the cities. In Seventh International Conference on Genetic Algorithms (ICGA97), pages 458--464, 1997."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569947","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1569947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:49Z","timestamp":1750249069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":27,"alternative-id":["10.1145\/1569901.1569947","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1569947","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}