{"id":"https://openalex.org/W3188498249","doi":"https://doi.org/10.1109/cec45853.2021.9504873","title":"Loading is the Key: A Novel Genetic Quantum Algorithm for SDVRP","display_name":"Loading is the Key: A Novel Genetic Quantum Algorithm for SDVRP","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3188498249","doi":"https://doi.org/10.1109/cec45853.2021.9504873","mag":"3188498249"},"language":"en","primary_location":{"id":"doi:10.1109/cec45853.2021.9504873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054455904","display_name":"Weijian Ma","orcid":"https://orcid.org/0009-0004-0650-6448"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weijian Ma","raw_affiliation_strings":["School of Computer Science Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115592685","display_name":"Xinyuan Zhang","orcid":"https://orcid.org/0000-0002-5900-2719"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinyuan Zhang","raw_affiliation_strings":["School of Economics and Management Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Economics and Management Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088739065","display_name":"Yichen Xu","orcid":"https://orcid.org/0000-0003-2089-6767"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yichen Xu","raw_affiliation_strings":["School of Computer Science Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101652489","display_name":"Fei Gao","orcid":"https://orcid.org/0000-0003-3555-943X"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fei Gao","raw_affiliation_strings":["State Key Laboratary of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratary of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5054455904"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.4448,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69676097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1817","last_page":"1825"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12546","display_name":"Smart Parking Systems Research","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/task","display_name":"Task (project management)","score":0.6819566488265991},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6408597230911255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638719916343689},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6351110339164734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6215709447860718},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6137526035308838},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5952577590942383},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5449038147926331},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5407455563545227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.516913652420044},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4765520691871643},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4679001569747925},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43630677461624146},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.43257784843444824},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4297053813934326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20533481240272522},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18680953979492188},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.1498541235923767},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12163609266281128},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10657519102096558}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6819566488265991},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6408597230911255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638719916343689},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6351110339164734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6215709447860718},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6137526035308838},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5952577590942383},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5449038147926331},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5407455563545227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.516913652420044},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4765520691871643},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4679001569747925},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43630677461624146},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.43257784843444824},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4297053813934326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20533481240272522},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18680953979492188},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.1498541235923767},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12163609266281128},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10657519102096558},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec45853.2021.9504873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W42793314","https://openalex.org/W105709917","https://openalex.org/W1515659411","https://openalex.org/W1786863823","https://openalex.org/W1922939278","https://openalex.org/W1962752774","https://openalex.org/W1987575362","https://openalex.org/W2044308184","https://openalex.org/W2098090443","https://openalex.org/W2111174053","https://openalex.org/W2113258275","https://openalex.org/W2115053914","https://openalex.org/W2122274805","https://openalex.org/W2131338629","https://openalex.org/W2136885049","https://openalex.org/W2154418786","https://openalex.org/W2165515547","https://openalex.org/W2172122819","https://openalex.org/W2387212856","https://openalex.org/W2520065525","https://openalex.org/W2998666873","https://openalex.org/W3016187662","https://openalex.org/W3020985206","https://openalex.org/W3038899990","https://openalex.org/W6777090647"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W1570109187","https://openalex.org/W1583787753","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W2020093019"],"abstract_inverted_index":{"This":[0],"paper":[1],"solves":[2],"Split":[3],"Demand":[4],"Vehicle":[5],"Routing":[6],"Problem":[7,63],"with":[8],"minimal":[9],"vehicles":[10,24,143],"and":[11,23,29,55,84,107],"controlled":[12],"task":[13,21,46,58],"splits.":[14],"Our":[15,72],"algorithm":[16,73,103],"encodes":[17],"the":[18,36,41,140],"mapping":[19],"between":[20],"splits":[22,104],"into":[25,45,136],"a":[26,51,75,86],"binary":[27,42],"matrix":[28,43],"uses":[30,74],"Genetic":[31],"Quantum":[32],"Algorithm":[33],"to":[34,61,80,93,131,146],"control":[35],"evolvement":[37],"process.":[38],"To":[39],"convert":[40,57],"solution":[44,95],"loading":[47],"schemes,":[48],"we":[49],"design":[50],"novel":[52],"cost":[53],"function":[54],"successfully":[56],"assignment":[59],"problem":[60],"Transportation":[62,69],"which":[64],"can":[65,108],"be":[66],"solved":[67],"by":[68],"Simplex":[70],"Method.":[71],"simple":[76],"nearest-neighborhood":[77],"based":[78],"heuristic":[79],"generate":[81],"vehicle":[82],"routes":[83],"adopts":[85],"local":[87],"search":[88],"method":[89],"tailored":[90],"for":[91],"SDVRP":[92,125],"improve":[94],"quality.":[96],"The":[97],"experimental":[98],"results":[99],"show":[100],"that":[101,122],"our":[102],"few":[105],"tasks":[106,133],"obtain":[109],"many":[110],"solutions":[111],"better":[112],"than":[113],"CVRP":[114],"best-known":[115],"in":[116],"TSPLIB":[117],"95.":[118],"Further":[119],"analysis":[120],"reveals":[121],"savings":[123],"of":[124,142],"mostly":[126],"come":[127],"from":[128],"CVRP\u2019s":[129],"failure":[130],"combine":[132],"geographically":[134],"close":[135],"one":[137],"route,":[138],"when":[139],"number":[141],"are":[144],"restricted":[145],"minimum.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}