{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:47:25Z","timestamp":1776282445157,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"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":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459268","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:50:43Z","timestamp":1624297843000},"page":"1043-1051","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["MA-ABC"],"prefix":"10.1145","author":[{"given":"Muhilan","family":"Ramamoorthy","sequence":"first","affiliation":[{"name":"Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Forrest","sequence":"additional","affiliation":[{"name":"Biodesign Center for Biocomputing"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Violet R.","family":"Syrotiuk","sequence":"additional","affiliation":[{"name":"Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Solution of a min-max vehicle routing problem. INFORMS Journal on computing 14, 2","author":"Applegate David","year":"2002","unstructured":"David Applegate , William Cook , Sanjeeb Dash , and Andr\u00e9 Rohe . 2002. Solution of a min-max vehicle routing problem. INFORMS Journal on computing 14, 2 ( 2002 ), 132--143. David Applegate, William Cook, Sanjeeb Dash, and Andr\u00e9 Rohe. 2002. Solution of a min-max vehicle routing problem. INFORMS Journal on computing 14, 2 (2002), 132--143."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.020"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.009"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220706"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.015"},{"key":"e_1_3_2_1_6_1","volume-title":"Evolutionary multi-objective optimization: a historical view of the field","author":"Coello Carlos A.","year":"2006","unstructured":"Carlos A. Coello . 2006. Evolutionary multi-objective optimization: a historical view of the field . IEEE computational intelligence magazine 1, 1 ( 2006 ), 28--36. Carlos A. Coello. 2006. Evolutionary multi-objective optimization: a historical view of the field. IEEE computational intelligence magazine 1, 1 (2006), 28--36."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-019-0113-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.01.042"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21748"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"\u00c1ngel Corber\u00e1n and Gilbert Laporte. 2015. Arc routing: problems methods and applications. SIAM.  \u00c1ngel Corber\u00e1n and Gilbert Laporte. 2015. Arc routing: problems methods and applications. SIAM.","DOI":"10.1137\/1.9781611973679"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1840747.1840753"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4495-1"},{"key":"e_1_3_2_1_14_1","volume-title":"Routeing winter gritting vehicles. Discrete applied mathematics 48, 3","author":"Eglese Richard W.","year":"1994","unstructured":"Richard W. Eglese . 1994. Routeing winter gritting vehicles. Discrete applied mathematics 48, 3 ( 1994 ), 231--244. Richard W. Eglese. 1994. Routeing winter gritting vehicles. Discrete applied mathematics 48, 3 (1994), 231--244."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121732"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.231"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24653-4_51"},{"key":"e_1_3_2_1_18_1","article-title":"DEAP: Evolutionary Algorithms Made Easy","author":"Fortin F\u00e9lix-Antoine","year":"2012","unstructured":"F\u00e9lix-Antoine Fortin , Fran\u00e7ois-Michel De Rainville , Marc-Andr\u00e9 Gardner , Marc Parizeau , and Christian Gagn\u00e9 . 2012 . DEAP: Evolutionary Algorithms Made Easy . Journal of Machine Learning Research 13 ( July 2012), 2171--2175. F\u00e9lix-Antoine Fortin, Fran\u00e7ois-Michel De Rainville, Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9. 2012. DEAP: Evolutionary Algorithms Made Easy. Journal of Machine Learning Research 13 (July 2012), 2171--2175.","journal-title":"Journal of Machine Learning Research 13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322150"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90026-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110308"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.12.009"},{"key":"e_1_3_2_1_23_1","volume-title":"IEEE Congress on Evolutionary Computation","volume":"1","author":"Handa Hisashi","year":"2005","unstructured":"Hisashi Handa , Lee Chapman , and Xin Yao . 2005 . Dynamic salting route optimisation using evolutionary computation . In IEEE Congress on Evolutionary Computation , Vol. 1 . 158--165. Hisashi Handa, Lee Chapman, and Xin Yao. 2005. Dynamic salting route optimisation using evolutionary computation. In IEEE Congress on Evolutionary Computation, Vol. 1. 158--165."},{"key":"e_1_3_2_1_24_1","volume-title":"Evolutionary Computation in Dynamic and Uncertain Environments","author":"Handa Hisashi","unstructured":"Hisashi Handa , Lee Chapman , and Xin Yao . 2007. Robust salting route optimization using evolutionary algorithms . In Evolutionary Computation in Dynamic and Uncertain Environments . Springer , 497--517. Hisashi Handa, Lee Chapman, and Xin Yao. 2007. Robust salting route optimization using evolutionary algorithms. In Evolutionary Computation in Dynamic and Uncertain Environments. Springer, 497--517."},{"key":"e_1_3_2_1_25_1","volume-title":"From single-objective to multi-objective vehicle routing problems: Motivations, case studies, and methods","author":"Jozefowiez Nicolas","unstructured":"Nicolas Jozefowiez , Frederic Semet , and El-Ghazali Talbi . 2008. From single-objective to multi-objective vehicle routing problems: Motivations, case studies, and methods . Springer , 445--471. Nicolas Jozefowiez, Frederic Semet, and El-Ghazali Talbi. 2008. From single-objective to multi-objective vehicle routing problems: Motivations, case studies, and methods. Springer, 445--471."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.065"},{"key":"e_1_3_2_1_27_1","volume-title":"IEEE World Congress on Intelligent Control and Automation","volume":"1","author":"Juan Liu","year":"2000","unstructured":"Liu Juan , Cai Zixing , and Liu Jianqin . 2000 . Premature convergence in genetic algorithm: Analysis and prevention based on chaos operator . In IEEE World Congress on Intelligent Control and Automation , Vol. 1 . 495--499. Liu Juan, Cai Zixing, and Liu Jianqin. 2000. Premature convergence in genetic algorithm: Analysis and prevention based on chaos operator. In IEEE World Congress on Intelligent Control and Automation, Vol. 1. 495--499."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039517.35989.6d"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36970-8_39"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.017"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900358"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21730"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2952802.2952991"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0744"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.05.016"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281503"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586031"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2051446"},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Genetic Algorithms on Genetic Algorithms and Their Application. 224--230","author":"Oliver I. M.","year":"1987","unstructured":"I. M. Oliver , D. J. Smith , and J. R. C. Holland . 1987 . A Study of Permutation Crossover Operators on the Traveling Salesman Problem . In International Conference on Genetic Algorithms on Genetic Algorithms and Their Application. 224--230 . I. M. Oliver, D. J. Smith, and J. R. C. Holland. 1987. A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In International Conference on Genetic Algorithms on Genetic Algorithms and Their Application. 224--230."},{"key":"e_1_3_2_1_40_1","unstructured":"ORTEC. 2020. http:\/\/www.ortec.com\/  ORTEC. 2020. http:\/\/www.ortec.com\/"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave\/jors\/2601252"},{"key":"e_1_3_2_1_42_1","first-page":"131","article-title":"The Capacitated Arc Routing Problem: Heuristics. In Arc routing: Problems, methods, and applications. SIAM","volume":"7","author":"Prins Christian","year":"2013","unstructured":"Christian Prins . 2013 . The Capacitated Arc Routing Problem: Heuristics. In Arc routing: Problems, methods, and applications. SIAM , Chapter 7 , 131 -- 157 . Christian Prins. 2013. The Capacitated Arc Routing Problem: Heuristics. In Arc routing: Problems, methods, and applications. SIAM, Chapter 7, 131--157.","journal-title":"Chapter"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540802426599"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2014.01.011"},{"key":"e_1_3_2_1_45_1","volume-title":"IEEE 92nd Vehicular Technology Conference (VTC2020-Fall). 1--5.","author":"Ramamoorthy Muhilan","unstructured":"Muhilan Ramamoorthy and Violet R. Syrotiuk . 2020. Online re-routing for vehicle breakdown in residential waste collection . In IEEE 92nd Vehicular Technology Conference (VTC2020-Fall). 1--5. Muhilan Ramamoorthy and Violet R. Syrotiuk. 2020. Online re-routing for vehicle breakdown in residential waste collection. In IEEE 92nd Vehicular Technology Conference (VTC2020-Fall). 1--5."},{"key":"e_1_3_2_1_46_1","volume-title":"Visual attractiveness in routing problems: A review. Computers & Operations Research 103 (March","author":"Rossit Diego Gabriel","year":"2019","unstructured":"Diego Gabriel Rossit , Daniele Vigo , Fernando Tohm\u00e9 , and Mariano Frutos . 2019. Visual attractiveness in routing problems: A review. Computers & Operations Research 103 (March 2019 ), 13--34. Diego Gabriel Rossit, Daniele Vigo, Fernando Tohm\u00e9, and Mariano Frutos. 2019. Visual attractiveness in routing problems: A review. Computers & Operations Research 103 (March 2019), 13--34."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.03.005"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.008"},{"key":"e_1_3_2_1_49_1","unstructured":"Supplementary Materials and Reproducibility Information. 2021. http:\/\/www.public.asu.edu\/~syrotiuk\/gecco21.html  Supplementary Materials and Reproducibility Information. 2021. http:\/\/www.public.asu.edu\/~syrotiuk\/gecco21.html"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2023449"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90252-8"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.014"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2428616"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2013.6608210"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille France","acronym":"GECCO '21","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:56Z","timestamp":1750197716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459268"}},"subtitle":["a memetic algorithm optimizing attractiveness, balance, and cost for capacitated Arc routing problems"],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":54,"alternative-id":["10.1145\/3449639.3459268","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459268","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}