{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T03:06:19Z","timestamp":1782183979511,"version":"3.54.5"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation Program of China","doi-asserted-by":"publisher","award":["72122006"],"award-info":[{"award-number":["72122006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202106050037"],"award-info":[{"award-number":["202106050037"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tevc.2024.3361910","type":"journal-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T18:38:34Z","timestamp":1707158314000},"page":"505-518","source":"Crossref","is-referenced-by-count":12,"title":["A Two-Individual Evolutionary Algorithm for Cumulative Capacitated Vehicle Routing With Single and Multiple Depots"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3672-1456","authenticated-orcid":false,"given":"Yuji","family":"Zou","sequence":"first","affiliation":[{"name":"Department of Computer Science, LERIA, Universit&#x00E9; d&#x2019;Angers, Angers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-4377","authenticated-orcid":false,"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[{"name":"Department of Computer Science, LERIA, Universit&#x00E9; d&#x2019;Angers, Angers, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinghua","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Management, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-006-0162-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9360-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0965-8564(94)E0006-U"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1376-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2938298"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.05.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.08.020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.09.045"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.08.032"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-018-0250-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.025"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12513"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105397"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504891"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105767"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106293"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-021-00498-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107868"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.09.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/197610v100551"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5755-5_2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.10.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108054"},{"key":"ref29","volume-title":"Handbook of Memetic Algorithms","author":"Neri","year":"2011"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9354-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012262"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.11.039"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3_6"},{"key":"ref34","first-page":"450","article-title":"Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem","volume-title":"Proc. 7th Int. Conf. Genet. Algorithms","author":"Nagata"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/net.20333"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1180"},{"issue":"11","key":"ref39","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"ref40","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"ref41","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The granular tabu search and its application to the vehicle-routing problem","volume":"15","author":"Toth","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0597-1"},{"issue":"2","key":"ref43","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Badeau","year":"1997","journal-title":"Transp. Sci."},{"issue":"9","key":"ref44","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","article-title":"Solving the vehicle routing problem with adaptive memory programming methodology","volume":"32","author":"Tarantilis","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10947080\/10422715.pdf?arnumber=10422715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:15:39Z","timestamp":1743639339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10422715\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":46,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2024.3361910","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}