{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:14:47Z","timestamp":1770326087291,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Honda Research Institute Europe (HRI-EU)"},{"name":"Guangdong Provincial Key Laboratory","award":["2020B121201001"],"award-info":[{"award-number":["2020B121201001"]}]},{"name":"Shenzhen Science and Technology Program","award":["KQTD2016112514355531"],"award-info":[{"award-number":["KQTD2016112514355531"]}]},{"name":"Program for Guangdong Introducing Innovative and Enterpreneurial Teams","award":["2017ZT07X386"],"award-info":[{"award-number":["2017ZT07X386"]}]},{"name":"Research Institute of Trustworthy Autonomous Systems (RITAS)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528756","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:59:57Z","timestamp":1658152797000},"page":"305-313","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["What makes the dynamic capacitated Arc routing problem hard to solve"],"prefix":"10.1145","author":[{"given":"Hao","family":"Tong","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandro L.","family":"Minku","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Menzel","sequence":"additional","affiliation":[{"name":"Honda Research Institute Europe, Offenbach, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Sendhoff","sequence":"additional","affiliation":[{"name":"Honda Research Institute Europe, Offenbach, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[{"name":"SUSTech, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Arc routing problems: A review of the past, present, and future. Networks (June","author":"Corber\u00e1n \u00c1ngel","year":"2020","unstructured":"\u00c1ngel Corber\u00e1n , Richard Eglese , Geir Hasle , Isaac Plana , and Jos\u00e9 Mar\u00eda Sanchis . 2020. Arc routing problems: A review of the past, present, and future. Networks (June 2020 ). \u00c1ngel Corber\u00e1n, Richard Eglese, Geir Hasle, Isaac Plana, and Jos\u00e9 Mar\u00eda Sanchis. 2020. Arc routing problems: A review of the past, present, and future. Networks (June 2020)."},{"key":"e_1_3_2_1_2_1","volume-title":"International Conference on Artificial Evolution (Evolution Artificielle). Springer, 41--52","author":"Daolio Fabio","year":"2013","unstructured":"Fabio Daolio , S\u00e9bastien Verel , Gabriela Ochoa , and Marco Tomassini . 2013 . Local optima networks of the permutation flow-shop problem . In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 41--52 . Fabio Daolio, S\u00e9bastien Verel, Gabriela Ochoa, and Marco Tomassini. 2013. Local optima networks of the permutation flow-shop problem. In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 41--52."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554680"},{"key":"e_1_3_2_1_5_1","first-page":"184","article-title":"Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms","volume":"95","author":"Jones Terry","year":"1995","unstructured":"Terry Jones and Stephanie Forrest . 1995 . Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms .. In ICGA , Vol. 95. 184 -- 192 . Terry Jones and Stephanie Forrest. 1995. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms.. In ICGA, Vol. 95. 184--192.","journal-title":"ICGA"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900358"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3390\/a14020040"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12346"},{"key":"e_1_3_2_1_10_1","first-page":"3","article-title":"An updated annotated bibliography on arc routing problems","volume":"70","author":"C\u00e2ndida Mour\u00e3o M.","year":"2017","unstructured":"M. C\u00e2ndida Mour\u00e3o and Leonor S. Pinto . 2017 . An updated annotated bibliography on arc routing problems . Networks 70 , 3 (Aug. 2017), 144--194. M. C\u00e2ndida Mour\u00e3o and Leonor S. Pinto. 2017. An updated annotated bibliography on arc routing problems. Networks 70, 3 (Aug. 2017), 144--194.","journal-title":"Networks"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389204"},{"key":"e_1_3_2_1_12_1","volume-title":"Recent advances in the theory and application of fitness landscapes","author":"Ochoa Gabriela","unstructured":"Gabriela Ochoa , S\u00e9bastien Verel , Fabio Daolio , and Marco Tomassini . 2014. Local optima networks: A new model of combinatorial fitness landscapes . In Recent advances in the theory and application of fitness landscapes . Springer , 233--262. Gabriela Ochoa, S\u00e9bastien Verel, Fabio Daolio, and Marco Tomassini. 2014. Local optima networks: A new model of combinatorial fitness landscapes. In Recent advances in the theory and application of fitness landscapes. Springer, 233--262."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21990"},{"key":"e_1_3_2_1_14_1","volume-title":"Stadler and Santa Fe Institute","author":"Peter","year":"1995","unstructured":"Peter F. Stadler and Santa Fe Institute . 1995 . Towards a theory of landscapes. In Complex systems and binary networks. Springer , 78--163. Peter F. Stadler and Santa Fe Institute. 1995. Towards a theory of landscapes. In Complex systems and binary networks. Springer, 78--163."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2010.02.003"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2023449"},{"key":"e_1_3_2_1_17_1","first-page":"420","article-title":"On the landscape of combinatorial optimization problems","volume":"18","author":"Adam Pr\u00fcgel-Bennett H","year":"2013","unstructured":"Mohammad- H Tayarani-N and Adam Pr\u00fcgel-Bennett . 2013 . On the landscape of combinatorial optimization problems . IEEE Transactions on Evolutionary Computation 18 , 3 (2013), 420 -- 434 . Mohammad-H Tayarani-N and Adam Pr\u00fcgel-Bennett. 2013. On the landscape of combinatorial optimization problems. IEEE Transactions on Evolutionary Computation 18, 3 (2013), 420--434.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_1_18_1","volume-title":"An analysis of the fitness landscape of travelling salesman problem. Evolutionary computation 24, 2","author":"Adam Pr\u00fcgel-Bennett H","year":"2016","unstructured":"Mohammad- H Tayarani-N and Adam Pr\u00fcgel-Bennett . 2016. An analysis of the fitness landscape of travelling salesman problem. Evolutionary computation 24, 2 ( 2016 ), 347--384. Mohammad-H Tayarani-N and Adam Pr\u00fcgel-Bennett. 2016. An analysis of the fitness landscape of travelling salesman problem. Evolutionary computation 24, 2 (2016), 347--384."},{"key":"e_1_3_2_1_19_1","volume-title":"Inferring future landscapes: sampling the local optima level. Evolutionary computation 28, 4","author":"Thomson Sarah L","year":"2020","unstructured":"Sarah L Thomson , Gabriela Ochoa , S\u00e9bastien Verel , and Nadarajen Veerapen . 2020. Inferring future landscapes: sampling the local optima level. Evolutionary computation 28, 4 ( 2020 ), 621--641. Sarah L Thomson, Gabriela Ochoa, S\u00e9bastien Verel, and Nadarajen Veerapen. 2020. Inferring future landscapes: sampling the local optima level. Evolutionary computation 28, 4 (2020), 621--641."},{"key":"e_1_3_2_1_20_1","volume-title":"Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems. In International Conference on Parallel Problem Solving from Nature. Springer, 428--440","author":"Tong Hao","year":"2020","unstructured":"Hao Tong , Leandro L Minku , Stefan Menzel , Bernhard Sendhoff , and Xin Yao . 2020 . Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems. In International Conference on Parallel Problem Solving from Nature. Springer, 428--440 . Hao Tong, Leandro L Minku, Stefan Menzel, Bernhard Sendhoff, and Xin Yao. 2020. Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems. In International Conference on Parallel Problem Solving from Nature. Springer, 428--440."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3459450"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Hao Tong Leandro L. Minku Stefan Menzel Bernhard Sendhoff and Xin Yao. 2021. A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems. arXiv:2104.06585  Hao Tong Leandro L. Minku Stefan Menzel Bernhard Sendhoff and Xin Yao. 2021. A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems. arXiv:2104.06585","DOI":"10.1145\/3449726.3459450"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Artificial Evolution (Evolution Artificielle). Springer, 49--60","author":"Verel S\u00e9bastien","year":"2011","unstructured":"S\u00e9bastien Verel , Fabio Daolio , Gabriela Ochoa , and Marco Tomassini . 2011 . Local optima networks with escape edges . In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 49--60 . S\u00e9bastien Verel, Fabio Daolio, Gabriela Ochoa, and Marco Tomassini. 2011. Local optima networks with escape edges. In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 49--60."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2046175"},{"key":"e_1_3_2_1_25_1","volume-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological cybernetics 63, 5","author":"Weinberger Edward","year":"1990","unstructured":"Edward Weinberger . 1990. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological cybernetics 63, 5 ( 1990 ), 325--336. Edward Weinberger. 1990. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological cybernetics 63, 5 (1990), 325--336."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205537"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts","acronym":"GECCO '22","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\/3512290.3528756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:30Z","timestamp":1750186830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528756"}},"subtitle":["insights from fitness landscape analysis"],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":25,"alternative-id":["10.1145\/3512290.3528756","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528756","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}