{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T05:14:19Z","timestamp":1731734059581,"version":"3.28.0"},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1016\/j.ejor.2024.09.043","type":"journal-article","created":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T20:29:15Z","timestamp":1727468955000},"page":"383-396","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Divide-and-conquer initialization and mutation operators for the large-scale mixed Capacitated Arc Routing Problem"],"prefix":"10.1016","volume":"321","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2675-8077","authenticated-orcid":false,"given":"Diogo F.","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6285-8737","authenticated-orcid":false,"given":"Miguel S.E.","family":"Martins","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8030-4746","authenticated-orcid":false,"given":"Jo\u00e3o M.C.","family":"Sousa","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7961-1004","authenticated-orcid":false,"given":"Susana M.","family":"Vieira","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/net.20091","article-title":"Exact methods based on node-routing formulations for undirected arc-routing problems","volume":"47","author":"Baldacci","year":"2006","journal-title":"Networks"},{"issue":"5","key":"10.1016\/j.ejor.2024.09.043_b2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","article-title":"A cutting plane algorithm for the capacitated arc routing problem","volume":"30","author":"Belenguer","year":"2003","journal-title":"Computers & Operations Research"},{"issue":"12","key":"10.1016\/j.ejor.2024.09.043_b3","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","article-title":"Lower and upper bounds for the mixed capacitated arc routing problem","volume":"33","author":"Belenguer","year":"2006","journal-title":"Computers & Operations Research"},{"year":"2021","series-title":"Dynamic Programming","author":"Bellman","key":"10.1016\/j.ejor.2024.09.043_b4"},{"issue":"3","key":"10.1016\/j.ejor.2024.09.043_b5","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","article-title":"A guided local search heuristic for the capacitated arc routing problem","volume":"147","author":"Beullens","year":"2003","journal-title":"European Journal of Operational Research"},{"volume":"vol. 197","article-title":"Tuning Metaheuristics","year":"2009","author":"Birattari","key":"10.1016\/j.ejor.2024.09.043_b6"},{"issue":"5","key":"10.1016\/j.ejor.2024.09.043_b7","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1287\/opre.1120.1079","article-title":"Cut-first branch-and-price-second for the capacitated arc-routing problem","volume":"60","author":"Bode","year":"2012","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2024.09.043_b8","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","article-title":"A deterministic tabu search algorithm for the capacitated arc routing problem","volume":"35","author":"Brand\u00e3o","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.09.043_b9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.ejor.2015.01.042","article-title":"The mixed capacitated arc routing problem with non-overlapping routes","volume":"244","author":"Constantino","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/net.21965","article-title":"Arc routing problems: a review of the past, present, and future","volume":"77","author":"Corber\u00e1n","year":"2021","journal-title":"Networks"},{"year":"2009","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/j.ejor.2024.09.043_b11"},{"issue":"3","key":"10.1016\/j.ejor.2024.09.043_b12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","article-title":"Routeing winter gritting vehicles","volume":"48","author":"Eglese","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2024.09.043_b13","series-title":"Arc routing: problems, methods, and applications","first-page":"303","article-title":"Chapter 13: Route Optimization for Meter Reading and Salt Spreading","author":"Eglese","year":"2015"},{"article-title":"Introduction to Evolutionary Computing","year":"2015","series-title":"Natural computing series","author":"Eiben","key":"10.1016\/j.ejor.2024.09.043_b14"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","article-title":"The case for strategic oscillation","volume":"183","author":"Glover","year":"2011","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.09.043_b16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2024.09.043_b17","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.cor.2009.06.018","article-title":"Lower bounds for the mixed capacitated arc routing problem","volume":"37","author":"Gouveia","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","article-title":"A tabu search heuristic for the capacitated arc routing problem","volume":"48","author":"Hertz","year":"2000","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.09.043_b19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","article-title":"A survey of automatic parameter tuning methods for metaheuristics","volume":"24","author":"Huang","year":"2020","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2024.09.043_b20","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.autcon.2011.06.005","article-title":"Multi-treatment capacitated arc routing of construction machinery in Taiwan\u2019s smooth road project","volume":"21","author":"Huang","year":"2012","journal-title":"Automation in Construction"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03155986.2017.1303960","article-title":"New large-scale data instances for CARP and new variations of CARP","volume":"56","author":"Kiilerich","year":"2018","journal-title":"INFOR. Information Systems and Operational Research"},{"key":"10.1016\/j.ejor.2024.09.043_b22","series-title":"Applications of evolutionary computing","first-page":"473","article-title":"A genetic algorithm for the capacitated arc routing problem and its extensions","author":"Lacomme","year":"2001"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","article-title":"Competitive memetic algorithms for arc routing problems","volume":"131","author":"Lacomme","year":"2004","journal-title":"Annals of Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2024.09.043_b24","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1016\/j.cor.2013.02.013","article-title":"Improved bounds for large scale capacitated arc routing problem","volume":"40","author":"Martinelli","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.09.043_b25","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TEVC.2013.2281503","article-title":"Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems","volume":"18","author":"Mei","year":"2014","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.ejor.2024.09.043_b26","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/net.21762","article-title":"An updated annotated bibliography on arc routing problems","volume":"70","author":"Mour\u00e3o","year":"2017","journal-title":"Networks"},{"year":"2014","series-title":"Bayesian Optimization: Open source constrained global optimization tool for Python","author":"Nogueira","key":"10.1016\/j.ejor.2024.09.043_b27"},{"issue":"5","key":"10.1016\/j.ejor.2024.09.043_b28","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10732-007-9050-2","article-title":"A variable neighborhood search for the capacitated arc routing problem with intermediate facilities","volume":"14","author":"Polacek","year":"2008","journal-title":"Journal of Heuristics"},{"issue":"6","key":"10.1016\/j.ejor.2024.09.043_b29","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","article-title":"Two memetic algorithms for heterogeneous fleet vehicle routing problems","volume":"22","author":"Prins","year":"2009","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2024.09.043_b30","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/00207540802426599","article-title":"Tour splitting algorithms for vehicle routing problems","volume":"47","author":"Prins","year":"2009","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2024.09.043_b31","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.trb.2009.07.004","article-title":"An improved ant colony optimization based algorithm for the capacitated arc routing problem","volume":"44","author":"Santos","year":"2010","journal-title":"Transportation Research, Part B (Methodological)"},{"key":"10.1016\/j.ejor.2024.09.043_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2021.101804","article-title":"Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms","volume":"101","author":"Schubert","year":"2021","journal-title":"Information Systems"},{"issue":"5","key":"10.1016\/j.ejor.2024.09.043_b33","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","article-title":"Memetic algorithm with extended neighborhood search for capacitated arc routing problems","volume":"13","author":"Tang","year":"2009","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2024.09.043_b34","first-page":"1","article-title":"A scalable approach to capacitated arc routing problems based on hierarchical decomposition","volume":"PP","author":"Tang","year":"2016","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.1016\/j.ejor.2024.09.043_b35","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","article-title":"The fleet size and mix problem for capacitated arc routing","volume":"22","author":"Ulusoy","year":"1985","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"10.1016\/j.ejor.2024.09.043_b36","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.1016\/j.cor.2009.05.006","article-title":"Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows","volume":"37","author":"Vansteenwegen","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2024.09.043_b37","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.2017.1595","article-title":"Node, edge, arc routing and turn penalties: multiple problems\u2014one neighborhood extension","volume":"65","author":"Vidal","year":"2017","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2024.09.043_b38","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multidepot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.09.043_b39","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Computers & Operations Research"},{"year":"2006","series-title":"Contributions to arc routing","author":"W\u00f8hlk","key":"10.1016\/j.ejor.2024.09.043_b40"},{"issue":"12","key":"10.1016\/j.ejor.2024.09.043_b41","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1080\/01605682.2017.1415648","article-title":"A fast heuristic for large-scale capacitated arc routing problems","volume":"69","author":"W\u00f8hlk","year":"2018","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2024.09.043_b42","first-page":"1","article-title":"A route clustering and search heuristic for large-scale multidepot-capacitated arc routing problem","volume":"PP","author":"Zhang","year":"2021","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.1016\/j.ejor.2024.09.043_b43","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.ins.2020.11.011","article-title":"Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition","volume":"553","author":"Zhang","year":"2021","journal-title":"Information Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172400746X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172400746X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T06:20:12Z","timestamp":1731651612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722172400746X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["S037722172400746X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2024.09.043","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Divide-and-conquer initialization and mutation operators for the large-scale mixed Capacitated Arc Routing Problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2024.09.043","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}
