{"id":"https://openalex.org/W2058816285","doi":"https://doi.org/10.1109/cec.2014.6900496","title":"An improved genetic algorithm for dynamic shortest path problems","display_name":"An improved genetic algorithm for dynamic shortest path problems","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2058816285","doi":"https://doi.org/10.1109/cec.2014.6900496","mag":"2058816285"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5100865088","display_name":"Zhu Xuezhi","orcid":null},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xuezhi Zhu","raw_affiliation_strings":["Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China"],"affiliations":[{"raw_affiliation_string":"Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]},{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001184471","display_name":"Wenjian Luo","orcid":"https://orcid.org/0000-0002-8357-1655"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenjian Luo","raw_affiliation_strings":["Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China"],"affiliations":[{"raw_affiliation_string":"Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]},{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026164183","display_name":"Tao Zhu","orcid":"https://orcid.org/0000-0002-5879-5980"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Zhu","raw_affiliation_strings":["Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China"],"affiliations":[{"raw_affiliation_string":"Anhui Province key Laboratory of Software Engineering in Computing and Communication, University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]},{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100865088"],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":0.9755,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.80251689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2093","last_page":"2100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9925000071525574,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8139771223068237},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7854470014572144},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7231034636497498},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6634379625320435},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6602827310562134},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6351720690727234},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6025296449661255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5815836787223816},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5617111921310425},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5580177307128906},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4963746666908264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.442615807056427},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4253569543361664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29352766275405884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2334035038948059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11012214422225952}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8139771223068237},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7854470014572144},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7231034636497498},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6634379625320435},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6602827310562134},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6351720690727234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6025296449661255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5815836787223816},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5617111921310425},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5580177307128906},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4963746666908264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.442615807056427},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4253569543361664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29352766275405884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2334035038948059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11012214422225952},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1541288193","https://openalex.org/W1573534773","https://openalex.org/W1598605300","https://openalex.org/W1745205774","https://openalex.org/W1978381746","https://openalex.org/W1979565259","https://openalex.org/W2005482560","https://openalex.org/W2022637272","https://openalex.org/W2072583763","https://openalex.org/W2094954730","https://openalex.org/W2100965266","https://openalex.org/W2117473144","https://openalex.org/W2119926658","https://openalex.org/W2129028773","https://openalex.org/W2132340807","https://openalex.org/W2132661941","https://openalex.org/W2148653444","https://openalex.org/W2158722083","https://openalex.org/W2169528473","https://openalex.org/W6637650675"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W4293054712","https://openalex.org/W2368964068","https://openalex.org/W2198982833","https://openalex.org/W2161960576","https://openalex.org/W2383519316","https://openalex.org/W4385575076","https://openalex.org/W2357176080","https://openalex.org/W2363277442"],"abstract_inverted_index":{"The":[0,61,96],"Shortest":[1,55],"Path":[2,56],"(SP)":[3],"problems":[4,20,58],"are":[5,11,31,65,84],"conventional":[6],"combinatorial":[7],"optimization":[8],"problems.":[9],"There":[10],"many":[12],"deterministic":[13,29],"algorithms":[14,30],"for":[15,53],"solving":[16],"the":[17,36,74,88,91,94,101,106],"shortest":[18,80],"path":[19,81],"in":[21,25,93],"static":[22],"topologies.":[23],"However,":[24],"dynamic":[26],"topologies,":[27],"these":[28],"not":[32],"efficient":[33],"due":[34],"to":[35,77,86,110],"necessity":[37],"of":[38,90],"restart.":[39],"In":[40],"this":[41],"paper,":[42],"an":[43],"improved":[44],"Genetic":[45],"Algorithm":[46,69],"(GA)":[47],"with":[48],"four":[49],"local":[50,62,79],"search":[51,63],"operators":[52,64],"Dynamic":[54],"(DSP)":[57],"is":[59],"proposed.":[60],"inspired":[66],"by":[67],"Dijkstra's":[68],"and":[70,114],"carried":[71],"out":[72],"when":[73],"topology":[75],"changes":[76],"generate":[78],"trees,":[82],"which":[83,108],"used":[85],"promote":[87],"performance":[89],"individuals":[92],"population.":[95],"experimental":[97],"results":[98],"show":[99],"that":[100],"proposed":[102],"algorithm":[103],"could":[104],"obtain":[105],"solutions":[107,117],"adapt":[109],"new":[111],"environments":[112],"rapidly":[113],"produce":[115],"high-quality":[116],"after":[118],"environmental":[119],"changes.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}