{"id":"https://openalex.org/W2074717718","doi":"https://doi.org/10.1109/icnc.2010.5583241","title":"A novel hybrid algorithm for the dynamic shortest path problem","display_name":"A novel hybrid algorithm for the dynamic shortest path problem","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2074717718","doi":"https://doi.org/10.1109/icnc.2010.5583241","mag":"2074717718"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5583241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5583241","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","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/A5044137839","display_name":"Yafei Guo","orcid":"https://orcid.org/0000-0003-0698-3565"},"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":true,"raw_author_name":"Yafei Guo","raw_affiliation_strings":["School of Software, Tsinghua University, Beijing, China","School of Software, Tsinghua University Beijing China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"School of Software, Tsinghua University Beijing China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101678402","display_name":"Zheng Qin","orcid":"https://orcid.org/0000-0002-4637-2518"},"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":"Zheng Qin","raw_affiliation_strings":["School of Software, Tsinghua University, Beijing, China","School of Software, Tsinghua University Beijing China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"School of Software, Tsinghua University Beijing China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102920522","display_name":"Yang Chang","orcid":"https://orcid.org/0000-0003-2140-4576"},"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":"Yang Chang","raw_affiliation_strings":["School of Software, Tsinghua University, Beijing, China","School of Software, Tsinghua University Beijing China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"School of Software, Tsinghua University Beijing China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044137839"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.4176,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.69948187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":null,"first_page":"2545","last_page":"2550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9954000115394592,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/shortest-path-problem","display_name":"Shortest path problem","score":0.7445404529571533},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7212608456611633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6182225942611694},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5819013714790344},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5742436647415161},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5609036087989807},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5485910773277283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5319257974624634},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.52527916431427},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4783622622489929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.477315753698349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2015623152256012},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.17917123436927795},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10295087099075317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07458049058914185},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.070717453956604}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7445404529571533},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7212608456611633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182225942611694},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5819013714790344},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5742436647415161},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5609036087989807},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5485910773277283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5319257974624634},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.52527916431427},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4783622622489929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.477315753698349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2015623152256012},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.17917123436927795},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10295087099075317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07458049058914185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.070717453956604},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5583241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5583241","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2008619911","https://openalex.org/W2122251753","https://openalex.org/W2123988414","https://openalex.org/W2127012233","https://openalex.org/W2386414778","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2523719706","https://openalex.org/W2368964068","https://openalex.org/W2030169809","https://openalex.org/W4307561361","https://openalex.org/W2161960576","https://openalex.org/W2360981904","https://openalex.org/W2366342492"],"abstract_inverted_index":{"For":[0],"the":[1,15,20,25,30,37,41,60,68,76,89,101,105,125],"dynamic":[2,78],"shortest":[3,102,107],"path":[4,79,103],"problem,":[5],"a":[6,110],"novel":[7,77],"hybrid":[8],"algorithm":[9,18,50,63,90],"DSP":[10,35],"is":[11],"designed,":[12],"which":[13],"embeds":[14],"ant":[16,61],"colony":[17,62],"into":[19],"A":[21,49],"algorithm.":[22],"Considering":[23],"both":[24],"speed":[26],"of":[27,32,43,113,118],"searching":[28,54],"and":[29,40,56,75],"quality":[31],"solution,":[33],"in":[34,48,59],"algorithm,":[36],"evaluation":[38],"function":[39],"means":[42],"selecting":[44],"next":[45],"expanded":[46],"node":[47],"as":[51,53],"well":[52],"strategy":[55],"related":[57],"parameters":[58],"are":[64,82],"improved":[65],"firstly,":[66],"then":[67],"current":[69],"saved":[70],"path,":[71],"obstruction":[72],"isolation":[73],"search":[74],"planning":[80],"method":[81],"proposed.":[83],"The":[84],"experimental":[85],"results":[86],"show":[87],"that":[88],"runs":[91],"better":[92],"than":[93],"other":[94],"existing":[95],"methods.":[96],"Moreover,":[97],"it":[98],"can":[99],"find":[100],"or":[104],"approximate":[106],"one":[108],"within":[109],"shorter":[111],"period":[112],"time":[114],"on":[115,124],"road":[116],"networks":[117],"any":[119],"scales,":[120],"especially":[121],"more":[122],"effectively":[123],"large":[126],"scale.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}