{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T21:48:37Z","timestamp":1774043317217,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Japan Science and Technology Agency (JST) Support for Pioneering Research Initiated by the Next Generation","award":["JPMJSP2128"],"award-info":[{"award-number":["JPMJSP2128"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3672634","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:54:45Z","timestamp":1773172485000},"page":"40532-40549","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Constructive Genetic Algorithm (HCGA) for the Vehicle Routing Problem With Time Windows in Logistics Optimization"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7336-0381","authenticated-orcid":false,"given":"Hongyi","family":"Du","sequence":"first","affiliation":[{"name":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan"}]},{"given":"Yoshitaka","family":"Tanimizu","sequence":"additional","affiliation":[{"name":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2130-3791","authenticated-orcid":false,"given":"Ruriko","family":"Watanabe","sequence":"additional","affiliation":[{"name":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"Toth","year":"2002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2011.2148712"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_2"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"Toth","year":"2014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3373699"},{"key":"ref6","first-page":"10418","article-title":"Learning collaborative policies to solve NP-hard routing problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Kim"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksus.2010.03.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-009-0118-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s13177-011-0040-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2009.04.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1993.53"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0954-1810(01)00005-X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.1482"},{"issue":"1","key":"ref15","first-page":"8","article-title":"Particle swarm optimization","volume":"2","author":"Shi","year":"2004","journal-title":"IEEE Connection"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IICAIET67254.2025.11265401"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-004-0173-7"},{"key":"ref19","first-page":"2122","article-title":"Hybrid quantum genetic algorithm for vehicle routing problem with time window","volume":"10","author":"Al-Thalej","year":"2018","journal-title":"J. Adv. Res. Dyn. Control Syst."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICITE59717.2023.10733881"},{"key":"ref21","first-page":"154","article-title":"Alleles, loci and the traveling salesman problem","volume-title":"Proc. Int. Conf. Genetic Algorithms","author":"Goldberg"},{"key":"ref22","first-page":"136","article-title":"Job-shop scheduling with genetic algorithms","volume-title":"Proc. Int. Conf. Genetic Algorithms","author":"Davis"},{"key":"ref23","first-page":"332","article-title":"Schedule optimization using genetic algorithms","volume-title":"Handbook Genetic Algorithms","author":"Syswerda","year":"1991"},{"key":"ref24","first-page":"160","article-title":"Genetic algorithms for the traveling salesman problem","volume-title":"Proc. Int. Conf. Genetic Algorithms","author":"Grefenstette"},{"key":"ref25","first-page":"224","article-title":"A study of permutation crossover operators on the traveling salesman problem","volume-title":"Proc. Int. Conf. Genetic Algorithms","author":"Oliver"},{"key":"ref26","first-page":"350","article-title":"The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination","volume-title":"Handbook of Genetic Algorithms","author":"Whitley","year":"1991"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/b978-1-55860-356-1.50007-8"},{"key":"ref28","first-page":"42","article-title":"Incorporating problem-specific knowledge into genetic algorithms","volume-title":"Genetic Algorithms and Simulated Annealing","author":"Grefenstette","year":"1987"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542671"},{"issue":"6","key":"ref30","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator","volume":"3","author":"Ahmed","year":"2010","journal-title":"Int. J. Biometrics Bioinform."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICAIBD62003.2024.10604599"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-006-6926-z"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3617733.3617754"},{"issue":"3","key":"ref35","first-page":"42","article-title":"Genetic algorithm for the travelling salesman problem using enhanced sequential constructive crossover operator","volume":"11","author":"Bennaceur","year":"2017","journal-title":"Int. J. Comput. Sci. Secur."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCRD64588.2025.10963039"},{"key":"ref37","volume-title":"Solomon\u2019s Benchmark Problems","author":"Solomon","year":"2025"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2023.100403"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2023.031325"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.06.033"},{"issue":"9","key":"ref41","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","article-title":"A parallel iterated Tabu search heuristic for vehicle routing problems","volume":"39","author":"Cordeau","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.06.082"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3390\/electronics14040647"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3378089"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3575459"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.3390\/su17062700"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106828"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2025.104510"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107187"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-024-00781-z"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013661617536"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.112593"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3539460"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3554054"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2024-0014"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11428185.pdf?arnumber=11428185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T20:00:05Z","timestamp":1774036805000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11428185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3672634","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}