{"id":"https://openalex.org/W7134952843","doi":"https://doi.org/10.1109/access.2026.3672634","title":"A Hybrid Constructive Genetic Algorithm (HCGA) for the Vehicle Routing Problem With Time Windows in Logistics Optimization","display_name":"A Hybrid Constructive Genetic Algorithm (HCGA) for the Vehicle Routing Problem With Time Windows in Logistics Optimization","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7134952843","doi":"https://doi.org/10.1109/access.2026.3672634"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3672634","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672634","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3672634","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111273509","display_name":"Hongyi Du","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hongyi Du","raw_affiliation_strings":["Faculty of Science and Engineering, Waseda University, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081848910","display_name":"Yoshitaka TANIMIZU","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshitaka Tanimizu","raw_affiliation_strings":["Faculty of Science and Engineering, Waseda University, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5128739658","display_name":"Ruriko Watanabe","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ruriko Watanabe","raw_affiliation_strings":["Faculty of Science and Engineering, Waseda University, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111273509"],"corresponding_institution_ids":["https://openalex.org/I150744194"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.74794987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"40532","last_page":"40549"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7405999898910522},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7056999802589417},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6905999779701233},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.675599992275238},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6654999852180481},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5695000290870667},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.5414999723434448},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4580000042915344},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42579999566078186}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7405999898910522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7317000031471252},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7056999802589417},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6905999779701233},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6790000200271606},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.675599992275238},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6654999852180481},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5695000290870667},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.5414999723434448},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4580000042915344},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C108713360","wikidata":"https://www.wikidata.org/wiki/Q1824206","display_name":"Supply chain","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.3666999936103821},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.3635999858379364},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2768000066280365},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27320000529289246},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3672634","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672634","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:073604cde00d43cc83386b3650486eab","is_oa":true,"landing_page_url":"https://doaj.org/article/073604cde00d43cc83386b3650486eab","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 40532-40549 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3672634","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672634","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.47788968682289124,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,137,206],"Vehicle":[1],"Routing":[2],"Problem":[3],"with":[4,30,70,169],"Time":[5],"Windows":[6],"(VRPTW)":[7],"is":[8,143],"paramount":[9],"in":[10,26,166,190,216],"elevating":[11],"operational":[12],"efficiency,":[13],"driving":[14],"cost":[15],"reductions,":[16],"and":[17,77,131,203,214,227,232],"enhancing":[18,122],"customer":[19],"satisfaction.":[20],"This":[21],"problem":[22,159],"has":[23],"widespread":[24],"applications":[25],"the":[27,31,36,56,65,71,115,118,124,129,132,140,146,170,177],"real":[28],"world,":[29],"primary":[32],"objective":[33],"of":[34,43,58,117,128,134,139,221],"determining":[35],"optimal":[37],"delivery":[38],"routes":[39],"for":[40,114,230],"a":[41,82,87,97,197,218],"fleet":[42],"vehicles.":[44],"Although":[45],"numerous":[46],"metaheuristic":[47],"algorithms":[48,189],"have":[49,63],"been":[50],"proposed":[51,141],"to":[52,55,80,112,184],"solve":[53],"VRPTW,":[54],"best":[57],"our":[59],"knowledge,":[60],"few":[61],"studies":[62],"combined":[64],"Solomon":[66],"insertion":[67,110],"constructive":[68,73,84,99],"heuristic":[69,111],"sequential":[72],"crossover":[74],"(SCX)":[75],"operator":[76],"other":[78],"strategies":[79],"form":[81],"hybrid":[83,98],"framework":[85],"within":[86],"genetic":[88,100],"algorithm.":[89],"To":[90],"fill":[91],"this":[92,94],"gap,":[93],"article":[95],"proposes":[96],"algorithm":[101,130],"(HCGA),":[102],"which":[103],"introduces":[104],"strong":[105,212],"individuals":[106],"through":[107],"Solomon\u2019s":[108],"I1":[109],"compensate":[113],"limitations":[116],"SCX":[119],"crossover,":[120],"thereby":[121],"both":[123],"global":[125],"search":[126],"capability":[127],"precision":[133],"local":[135],"searches.":[136],"performance":[138],"HCGA":[142,161,179,210],"evaluated":[144],"on":[145],"widely":[147],"used":[148],"Solomon100":[149],"benchmark":[150],"data":[151],"set.":[152],"Experimental":[153],"results":[154,207],"indicate":[155],"that":[156,209],"among":[157],"56":[158],"instances,":[160],"achieves":[162],"Best-Known":[163],"Solutions":[164],"(BKS)":[165],"12":[167],"cases,":[168],"remaining":[171],"solutions":[172,182],"deviating":[173],"only":[174],"slightly":[175],"from":[176],"BKS.":[178],"consistently":[180],"delivers":[181],"comparable":[183],"or":[185],"better":[186],"than":[187],"state-of-the-art":[188],"multiple":[191],"solution":[192,201],"quality":[193,202],"metrics":[194],"while":[195],"maintaining":[196],"favorable":[198],"balance":[199],"between":[200],"computational":[204],"efficiency.":[205],"demonstrate":[208],"exhibits":[211],"adaptability":[213],"efficiency":[215],"handling":[217],"wide":[219],"range":[220],"VRPTW":[222],"scenarios,":[223],"providing":[224],"significant":[225],"theoretical":[226],"practical":[228],"value":[229],"logistics":[231],"supply":[233],"chain":[234],"optimization.":[235]},"counts_by_year":[],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2026-03-12T00:00:00"}