{"id":"https://openalex.org/W2000681823","doi":"https://doi.org/10.3328/tl.2009.01.01.81-93","title":"A quantum-inspired genetic algorithm for dynamic continuous network design problem","display_name":"A quantum-inspired genetic algorithm for dynamic continuous network design problem","alternate_titles":[],"publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2000681823","doi":"https://doi.org/10.3328/tl.2009.01.01.81-93","mag":"2000681823"},"language":"en","primary_location":{"id":"doi:10.3328/tl.2009.01.01.81-93","doi":"https://doi.org/10.3328/tl.2009.01.01.81-93","is_oa":false,"landing_page_url":"https://doi.org/10.3328/tl.2009.01.01.81-93","pdf_url":null,"source":{"id":"https://openalex.org/S70779598","display_name":"Transportation Letters","issn_l":"1942-7867","issn":["1942-7867","1942-7875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","cwts-core","dongbi-d","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Letters","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2000681823"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5021497637","display_name":"Dung\u2010Ying Lin","orcid":"https://orcid.org/0000-0001-9863-5044","observed_orcids":["https://orcid.org/0000-0001-9863-5044"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dung-Ying Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012107020","display_name":"Steven Travis Waller","orcid":"https://orcid.org/0000-0002-2939-2090","observed_orcids":["https://orcid.org/0000-0002-2939-2090"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Waller","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5273,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.67738773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"1","issue":"1","first_page":"81","last_page":"93"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.7124000191688538,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.7124000191688538,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.1688999980688095,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.039000000804662704,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/quantum-inspired-genetic-algorithm","display_name":"quantum genetic algorithm","score":0.9959999918937683},{"id":"https://openalex.org/keywords/transportation-network-design","display_name":"transportation network design","score":0.9380000233650208},{"id":"https://openalex.org/keywords/floating-point-encoding","display_name":"floating-point encoding","score":0.7480000257492065},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7540000081062317},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.7250000238418579},{"id":"https://openalex.org/keywords/sioux-falls-network","display_name":"Sioux Falls network","score":0.7900000214576721}],"concepts":[{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6676205992698669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6209846138954163},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.5351988077163696},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5217753052711487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5049851536750793},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.496315062046051},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4807829260826111},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.448687881231308},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.4110381603240967},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3499821424484253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33818939328193665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2905777096748352},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3328/tl.2009.01.01.81-93","doi":"https://doi.org/10.3328/tl.2009.01.01.81-93","is_oa":false,"landing_page_url":"https://doi.org/10.3328/tl.2009.01.01.81-93","pdf_url":null,"source":{"id":"https://openalex.org/S70779598","display_name":"Transportation Letters","issn_l":"1942-7867","issn":["1942-7867","1942-7875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","cwts-core","dongbi-d","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.7207000255584717,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W2016218947","https://openalex.org/W2032549372","https://openalex.org/W2037141248","https://openalex.org/W2042949543","https://openalex.org/W2085426595","https://openalex.org/W2122274805","https://openalex.org/W2124659975","https://openalex.org/W3023478445","https://openalex.org/W3037315640","https://openalex.org/W4239873278"],"related_works":["https://openalex.org/W2364591496","https://openalex.org/W2603325781","https://openalex.org/W2363156182","https://openalex.org/W4385350611","https://openalex.org/W2153197624","https://openalex.org/W4414539560","https://openalex.org/W3213243710","https://openalex.org/W2374388514","https://openalex.org/W2079270982"],"abstract_inverted_index":{"The":[0,228],"Network":[1],"Design":[2],"Problem":[3],"(NDP),":[4],"known":[5],"to":[6,26,104,111,154,220,234,240],"be":[7,136,187,196],"NP-complete,":[8],"arises":[9],"in":[10,55,87,130,161,268],"many":[11],"application":[12],"contexts.":[13],"Transportation":[14],"NDP":[15],"involves":[16],"optimizing":[17],"the":[18,36,63,81,100,114,122,125,149,162,165,179,183,199,222,235,249,252],"network":[19,225],"performance":[20,115],"under":[21],"a":[22,33,144,155,191,214,258],"budget":[23],"constraint.":[24],"Due":[25],"its":[27,242],"non-convex":[28],"and":[29,73,190,205,237,244,264,270],"discontinuous":[30],"solution":[31,184,194],"space,":[32],"majority":[34],"of":[35,83,99,116,128,141,168,178,202],"research":[37,53],"efforts":[38],"have":[39,59,78],"been":[40,60],"focused":[41],"on":[42],"tackling":[43],"this":[44,210],"problem":[45],"using":[46,121],"metaheuristics.":[47],"Quantum":[48,66],"computing":[49,110],"is":[50,231],"an":[51,175],"active":[52],"area":[54],"which":[56],"numerous":[57],"advances":[58],"made":[61],"since":[62],"early":[64],"1990s.":[65],"algorithms,":[67],"such":[68],"as":[69,97,124,158],"Shor's":[70],"factorization":[71],"algorithm":[72,219,230,274],"Grover's":[74],"database":[75],"search":[76,133,177],"algorithm,":[77,255],"opened":[79],"up":[80],"possibility":[82],"solving":[84],"NP-hard/NP-complete":[85],"problems":[86],"polynomial":[88],"time":[89],"with":[90,198,257],"quantum":[91,109],"computers.":[92],"Quantum-inspired":[93],"genetic":[94,118,218,254,273],"algorithms":[95],"(QGA),":[96],"one":[98],"novel":[101],"meta-heuristics,":[102],"seek":[103],"use":[105],"insights":[106],"gained":[107],"through":[108],"improve":[112],"upon":[113],"traditional":[117],"algorithms.":[119],"By":[120],"qubit":[123,150,160,180],"basic":[126],"unit":[127],"information":[129],"QGA,":[131],"complex":[132],"space":[134],"can":[135,186,195],"probabilistically":[137],"characterized":[138],"by":[139],"superposition":[140],"states.":[142],"With":[143],"suitable":[145],"QGA":[146,250],"updating":[147],"mechanism,":[148],"chromosome":[151,163],"gradually":[152],"converges":[153],"single":[156],"state":[157,167],"each":[159],"reaches":[164],"stable":[166],"either":[169],"0":[170],"or":[171],"1.":[172],"Therefore,":[173],"without":[174],"exhaustive":[176],"states":[181],"combination,":[182],"spaces":[185],"effectively":[188],"explored":[189],"better":[192],"quality":[193],"obtained":[197],"same":[200],"level":[201],"population,":[203],"generation,":[204],"overall":[206],"computational":[207,263],"effort.":[208],"In":[209],"research,":[211],"we":[212],"present":[213],"floating-point":[215],"encoded":[216],"quantum-inspired":[217,272],"solve":[221],"dynamic":[223],"transportation":[224],"design":[226],"problem.":[227],"proposed":[229],"empirically":[232],"applied":[233],"Sioux-Falls":[236],"Monticello":[238],"networks":[239],"test":[241],"effectiveness":[243],"applicability.":[245],"Through":[246],"numerical":[247],"experiments,":[248],"outperforms":[251],"conventional":[253],"even":[256],"smaller":[259],"population":[260],"size.":[261],"Technical,":[262],"practical":[265],"issues":[266],"involved":[267],"developing":[269],"calibrating":[271],"are":[275],"discussed.":[276]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2000681823","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-18T13:11:19.462570","created_date":"2016-06-24T00:00:00"}
