{"id":"https://openalex.org/W7119056933","doi":"https://doi.org/10.3390/systems14010061","title":"A Time-Dependent Dijkstra\u2019s Algorithm for the Shortest Path Considering Periodic Queuing Delays at Signalized Intersections","display_name":"A Time-Dependent Dijkstra\u2019s Algorithm for the Shortest Path Considering Periodic Queuing Delays at Signalized Intersections","publication_year":2026,"publication_date":"2026-01-07","ids":{"openalex":"https://openalex.org/W7119056933","doi":"https://doi.org/10.3390/systems14010061"},"language":"en","primary_location":{"id":"doi:10.3390/systems14010061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems14010061","pdf_url":null,"source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/systems14010061","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109146105","display_name":"Bing Ji","orcid":null},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Binghao Ji","raw_affiliation_strings":["School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China","institution_ids":["https://openalex.org/I115592961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121651737","display_name":"Peng Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Zhang","raw_affiliation_strings":["School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China","institution_ids":["https://openalex.org/I115592961"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Chao Sun","orcid":"https://orcid.org/0000-0002-1543-5790"},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao Sun","raw_affiliation_strings":["School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China"],"raw_orcid":"https://orcid.org/0000-0002-1543-5790","affiliations":[{"raw_affiliation_string":"School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China","institution_ids":["https://openalex.org/I115592961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100353425","display_name":"Junhui Zhang","orcid":"https://orcid.org/0000-0003-4748-6899"},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junhui Zhang","raw_affiliation_strings":["School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automotive and Transportation Engineering, Jiangsu University, Zhenjiang 212013, China","institution_ids":["https://openalex.org/I115592961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067747256","display_name":"W. Li","orcid":"https://orcid.org/0009-0001-0364-8270"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenquan Li","raw_affiliation_strings":["School of Transportation, Southeast University, Nanjing 210096, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Transportation, Southeast University, Nanjing 210096, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5109146105"],"corresponding_institution_ids":["https://openalex.org/I115592961"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":17.4561,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97032854,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"14","issue":"1","first_page":"61","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.8758000135421753,"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"}},"topics":[{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.8758000135421753,"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"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.042399998754262924,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.04179999977350235,"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/intersection","display_name":"Intersection (aeronautics)","score":0.7601000070571899},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6362000107765198},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6140000224113464},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5253999829292297},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5189999938011169},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5159000158309937},{"id":"https://openalex.org/keywords/traffic-flow","display_name":"Traffic flow (computer networking)","score":0.5008999705314636},{"id":"https://openalex.org/keywords/queuing-delay","display_name":"Queuing delay","score":0.4580000042915344},{"id":"https://openalex.org/keywords/signal-timing","display_name":"Signal timing","score":0.44190001487731934}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7601000070571899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6507999897003174},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6362000107765198},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6140000224113464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54830002784729},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5253999829292297},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5189999938011169},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5159000158309937},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C196095461","wikidata":"https://www.wikidata.org/wiki/Q576842","display_name":"Queuing delay","level":3,"score":0.4580000042915344},{"id":"https://openalex.org/C2776006172","wikidata":"https://www.wikidata.org/wiki/Q7512741","display_name":"Signal timing","level":3,"score":0.44190001487731934},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.39410001039505005},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32839998602867126},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.32269999384880066},{"id":"https://openalex.org/C2988166257","wikidata":"https://www.wikidata.org/wiki/Q924286","display_name":"Traffic network","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.29829999804496765},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28790000081062317},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.26109999418258667},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.25949999690055847}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/systems14010061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems14010061","pdf_url":null,"source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8c3ea44e03af4fb2823e32be238c2295","is_oa":true,"landing_page_url":"https://doaj.org/article/8c3ea44e03af4fb2823e32be238c2295","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Systems, Vol 14, Iss 1, p 61 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/systems14010061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/systems14010061","pdf_url":null,"source":{"id":"https://openalex.org/S4210219410","display_name":"Systems","issn_l":"2079-8954","issn":["2079-8954"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.794729471206665,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"urban":[1],"road":[2,147,159],"networks,":[3],"queuing":[4,26,62,204],"delays":[5,106],"at":[6,110,127],"signalized":[7,67,155,189],"intersections":[8,68,156],"often":[9],"account":[10],"for":[11,33,66,107,135],"over":[12],"half":[13],"of":[14,21,202],"the":[15,84,88,116,162,175,200,207],"total":[16],"travel":[17,171,210],"time.":[18,139],"The":[19,49,113,197],"complexity":[20],"traffic":[22,72],"signals":[23],"and":[24,74,141,157,179,212],"vehicle":[25,56,124],"makes":[27],"traditional":[28,176],"shortest":[29,132],"path":[30,36,133,214],"algorithms":[31],"insufficient":[32],"real-time":[34,121],"optimal":[35],"finding.":[37],"This":[38],"study":[39],"proposes":[40],"a":[41,79,98,136,145,167,180],"Time-Dependent":[42],"Dijkstra\u2019s":[43,177],"algorithm":[44,114,186,208],"to":[45,54,104,174,184],"address":[46],"these":[47],"challenges.":[48],"network":[50,117,148],"topology":[51],"is":[52,69,102],"redesigned":[53],"model":[55,101],"turning":[57],"behaviors":[58],"accurately.":[59],"A":[60],"periodic":[61,99,203],"delay":[63],"parameter":[64],"matrix":[65,82,119],"introduced,":[70],"storing":[71],"flow":[73],"signal":[75,89],"phase":[76],"parameters.":[77],"Additionally,":[78],"time-varying":[80],"weight":[81,118],"tracks":[83],"vehicle\u2019s":[85],"position":[86],"in":[87,120,149,170],"cycle":[90],"upon":[91],"intersection":[92,190],"arrival.":[93],"Using":[94],"cumulative":[95],"curve":[96],"theory,":[97],"queuing-delay":[100],"constructed":[103],"capture":[105],"vehicles":[108],"arriving":[109],"different":[111],"times.":[112],"updates":[115],"based":[122],"on":[123,144],"arrival":[125],"times":[126,195],"intersections,":[128],"enabling":[129],"FIFO-consistent":[130],"time-dependent":[131],"computation":[134],"given":[137],"departure":[138,194],"Numerical":[140],"SUMO":[142],"simulations":[143],"real-world":[146],"Suzhou":[150],"Industrial":[151],"Park":[152],"(comprising":[153],"15":[154],"22":[158],"segments)":[160],"demonstrate":[161],"algorithm\u2019s":[163],"effectiveness.":[164],"Results":[165],"show":[166],"25.36%":[168],"reduction":[169,182],"time":[172,192,211],"compared":[173,183],"Algorithm":[178],"10.46%":[181],"an":[185],"considering":[187],"only":[188],"waiting":[191],"when":[193],"vary.":[196],"results":[198],"highlight":[199],"impact":[201],"delays,":[205],"with":[206],"reducing":[209],"improving":[213],"planning.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}