{"id":"https://openalex.org/W2010342401","doi":"https://doi.org/10.1080/13658810601079759","title":"A shortest path algorithm with novel heuristics for dynamic transportation networks","display_name":"A shortest path algorithm with novel heuristics for dynamic transportation networks","publication_year":2007,"publication_date":"2007-05-24","ids":{"openalex":"https://openalex.org/W2010342401","doi":"https://doi.org/10.1080/13658810601079759","mag":"2010342401"},"language":"en","primary_location":{"id":"doi:10.1080/13658810601079759","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658810601079759","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-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/A5100705731","display_name":"Bo Huang","orcid":"https://orcid.org/0000-0002-5063-3522"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"B. Huang","raw_affiliation_strings":["Department of Geography and Resource Management, The Chinese University of Hong Kong, Shatin, NT, Hong Kong","[Department of Geography and Resource Management, The Chinese University of Hong Kong, Hong Kong]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Geography and Resource Management, The Chinese University of Hong Kong, Shatin, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"[Department of Geography and Resource Management, The Chinese University of Hong Kong, Hong Kong]","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101970662","display_name":"Qiang Wu","orcid":"https://orcid.org/0000-0001-5155-7894"},"institutions":[{"id":"https://openalex.org/I4210117652","display_name":"MRF Geosystems (Canada)","ror":"https://ror.org/02hqxd823","country_code":"CA","type":"company","lineage":["https://openalex.org/I4210117652"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Q. Wu","raw_affiliation_strings":["MRF Geosystems Corporation, 625\u201414th Street, NW, Calgary, Canada T2N 2A1","MRF Geosystems Corporation, Calgary, Canada T2N 2A1#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MRF Geosystems Corporation, 625\u201414th Street, NW, Calgary, Canada T2N 2A1","institution_ids":["https://openalex.org/I4210117652"]},{"raw_affiliation_string":"MRF Geosystems Corporation, Calgary, Canada T2N 2A1#TAB#","institution_ids":["https://openalex.org/I4210117652"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018321701","display_name":"F. Benjamin Zhan","orcid":"https://orcid.org/0000-0003-1974-976X"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. B. Zhan","raw_affiliation_strings":["Texas Center for Geographic Information Science, Department of Geography, Texas State University, San Marcos, TX 78666"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas Center for Geographic Information Science, Department of Geography, Texas State University, San Marcos, TX 78666","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100705731"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":5.3843,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.95637061,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"21","issue":"6","first_page":"625","last_page":"644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9970999956130981,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7638536691665649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6368510723114014},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5875858664512634},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5448699593544006},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5345280170440674},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4958272874355316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47367316484451294},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.46385952830314636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4391057789325714},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4337535500526428},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4331425428390503},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2692173719406128},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18748372793197632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17317265272140503}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7638536691665649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6368510723114014},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5875858664512634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5448699593544006},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5345280170440674},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4958272874355316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47367316484451294},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.46385952830314636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4391057789325714},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4337535500526428},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4331425428390503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2692173719406128},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18748372793197632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17317265272140503},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/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.1080/13658810601079759","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658810601079759","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1982809790","https://openalex.org/W2017694061","https://openalex.org/W2048815087","https://openalex.org/W2062266989","https://openalex.org/W2070508857","https://openalex.org/W2079274727","https://openalex.org/W2087989168","https://openalex.org/W2100586428","https://openalex.org/W2135546456","https://openalex.org/W2135664162","https://openalex.org/W2144050074","https://openalex.org/W2145814045","https://openalex.org/W2166236009","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W4223969905","https://openalex.org/W2363342665","https://openalex.org/W2170980056","https://openalex.org/W3088868185","https://openalex.org/W2379804627","https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W2359532380","https://openalex.org/W4310124294","https://openalex.org/W78690942"],"abstract_inverted_index":{"Finding":[0],"an":[1,47,69],"optimal":[2],"route":[3],"in":[4,79],"dynamic":[5,85,107],"real\u2010time":[6],"transportation":[7],"networks":[8],"is":[9],"a":[10,33,56,96],"critical":[11],"problem":[12],"for":[13],"vehicle":[14],"navigation.":[15],"Existing":[16],"approaches":[17],"are":[18],"either":[19],"too":[20],"complex":[21,26],"or":[22],"incapable":[23],"of":[24,32,58,113],"managing":[25],"circumstances":[27],"where":[28],"both":[29],"the":[30,59,73,84,92,106,114,122,129],"location":[31],"mobile":[34],"object":[35,98],"and":[36,99],"traffic":[37,108],"conditions":[38],"change":[39],"over":[40],"time.":[41],"In":[42,64],"this":[43],"paper,":[44],"we":[45,66],"propose":[46],"incremental":[48],"search":[49,86,116],"approach":[50],"with":[51],"novel":[52],"heuristics":[53],"based":[54],"on":[55],"variation":[57],"A*":[60,131],"algorithm\u2013Lifelong":[61],"Planning":[62],"A*.":[63],"addition,":[65],"suggest":[67],"using":[68],"ellipse":[70],"to":[71,76,81,105],"prune":[72],"unnecessary":[74],"nodes":[75],"be":[77],"scanned":[78],"order":[80],"speed":[82],"up":[83],"process.":[87],"The":[88],"proposed":[89,123],"algorithm":[90,124],"determines":[91],"shortest\u2010cost":[93],"path":[94],"between":[95],"moving":[97],"its":[100],"destination":[101],"by":[102],"continually":[103],"adapting":[104],"conditions,":[109],"while":[110],"making":[111],"use":[112],"previous":[115],"results.":[117],"Experimental":[118],"results":[119],"evince":[120],"that":[121],"performs":[125],"significantly":[126],"better":[127],"than":[128],"well\u2010known":[130],"algorithm.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}