{"id":"https://openalex.org/W4293249837","doi":"https://doi.org/10.1080/09540091.2022.2061916","title":"A graph algorithm for the time constrained shortest path","display_name":"A graph algorithm for the time constrained shortest path","publication_year":2022,"publication_date":"2022-05-20","ids":{"openalex":"https://openalex.org/W4293249837","doi":"https://doi.org/10.1080/09540091.2022.2061916"},"language":"en","primary_location":{"id":"doi:10.1080/09540091.2022.2061916","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09540091.2022.2061916","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09540091.2022.2061916?needAccess=true","source":{"id":"https://openalex.org/S4210188800","display_name":"Connection Science","issn_l":"0954-0091","issn":["0954-0091","1360-0494"],"is_oa":true,"is_in_doaj":true,"is_core":true,"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":"Connection Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/09540091.2022.2061916?needAccess=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100358542","display_name":"Pan Liu","orcid":"https://orcid.org/0000-0002-3777-6561"},"institutions":[{"id":"https://openalex.org/I153806059","display_name":"Shanghai Business School","ror":"https://ror.org/05kf5z787","country_code":"CN","type":"education","lineage":["https://openalex.org/I153806059"]},{"id":"https://openalex.org/I4405261568","display_name":"Shanghai Key Laboratory of Computer Software Testing and Evaluating","ror":"https://ror.org/05gky6m26","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4405261568","https://openalex.org/I4405262724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pan Liu","raw_affiliation_strings":["Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China","Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, People\u2019s Republic of China","Faculty of Business Information, Shanghai Business School, Shanghai, People's Republic of China","Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China","institution_ids":["https://openalex.org/I153806059"]},{"raw_affiliation_string":"Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, People\u2019s Republic of China","institution_ids":["https://openalex.org/I4405261568"]},{"raw_affiliation_string":"Faculty of Business Information, Shanghai Business School, Shanghai, People's Republic of China","institution_ids":["https://openalex.org/I153806059"]},{"raw_affiliation_string":"Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, People's Republic of China","institution_ids":["https://openalex.org/I4405261568"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020323802","display_name":"Wulan Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I153806059","display_name":"Shanghai Business School","ror":"https://ror.org/05kf5z787","country_code":"CN","type":"education","lineage":["https://openalex.org/I153806059"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wulan Huang","raw_affiliation_strings":["Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China","Faculty of Business Information, Shanghai Business School, Shanghai, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Business Information, Shanghai Business School, Shanghai, People\u2019s Republic of China","institution_ids":["https://openalex.org/I153806059"]},{"raw_affiliation_string":"Faculty of Business Information, Shanghai Business School, Shanghai, People's Republic of China","institution_ids":["https://openalex.org/I153806059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020323802"],"corresponding_institution_ids":["https://openalex.org/I153806059"],"apc_list":{"value":1270,"currency":"USD","value_usd":1270},"apc_paid":{"value":1270,"currency":"USD","value_usd":1270},"fwci":0.2321,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43866633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"34","issue":"1","first_page":"1500","last_page":"1518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9909999966621399,"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.7383205890655518},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.653412938117981},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5646056532859802},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5492309927940369},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5448027849197388},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5124897956848145},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5103049278259277},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5039293169975281},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4661964476108551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44645819067955017},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4126991331577301},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3556986153125763},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3127073049545288},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27139970660209656},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.2713163495063782},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2652592062950134}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7383205890655518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.653412938117981},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5646056532859802},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5492309927940369},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5448027849197388},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5124897956848145},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5103049278259277},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5039293169975281},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4661964476108551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44645819067955017},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4126991331577301},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3556986153125763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3127073049545288},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27139970660209656},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2713163495063782},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2652592062950134}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09540091.2022.2061916","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09540091.2022.2061916","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09540091.2022.2061916?needAccess=true","source":{"id":"https://openalex.org/S4210188800","display_name":"Connection Science","issn_l":"0954-0091","issn":["0954-0091","1360-0494"],"is_oa":true,"is_in_doaj":true,"is_core":true,"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":"Connection Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7e14ea3797e448eb9cdadd3f716991cd","is_oa":false,"landing_page_url":"https://doaj.org/article/7e14ea3797e448eb9cdadd3f716991cd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Connection Science, Vol 34, Iss 1, Pp 1500-1518 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09540091.2022.2061916","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09540091.2022.2061916","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09540091.2022.2061916?needAccess=true","source":{"id":"https://openalex.org/S4210188800","display_name":"Connection Science","issn_l":"0954-0091","issn":["0954-0091","1360-0494"],"is_oa":true,"is_in_doaj":true,"is_core":true,"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":"Connection Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6399999856948853}],"awards":[{"id":"https://openalex.org/G4242227837","display_name":null,"funder_award_id":"20142BBE50015","funder_id":"https://openalex.org/F4320326696","funder_display_name":"Jiangxi Provincial Department of Science and Technology"},{"id":"https://openalex.org/G6840997628","display_name":null,"funder_award_id":"18BTQ058","funder_id":"https://openalex.org/F4320335595","funder_display_name":"National Natural Science Foundation of China-Yunnan Joint Fund"},{"id":"https://openalex.org/G8074318122","display_name":null,"funder_award_id":"61502299","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320326696","display_name":"Jiangxi Provincial Department of Science and Technology","ror":null},{"id":"https://openalex.org/F4320335595","display_name":"National Natural Science Foundation of China-Yunnan Joint Fund","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W8282516","https://openalex.org/W100943812","https://openalex.org/W194441499","https://openalex.org/W311217234","https://openalex.org/W362167146","https://openalex.org/W1543377438","https://openalex.org/W1549911051","https://openalex.org/W1573144638","https://openalex.org/W1854858186","https://openalex.org/W1970025200","https://openalex.org/W1973619036","https://openalex.org/W1979493600","https://openalex.org/W1981162332","https://openalex.org/W1988774389","https://openalex.org/W1995415305","https://openalex.org/W2036900823","https://openalex.org/W2039810275","https://openalex.org/W2075800961","https://openalex.org/W2098074159","https://openalex.org/W2099391941","https://openalex.org/W2123988414","https://openalex.org/W2130679277","https://openalex.org/W2135215232","https://openalex.org/W2145413351","https://openalex.org/W2169369745","https://openalex.org/W2170358592","https://openalex.org/W2186094217","https://openalex.org/W2528807730","https://openalex.org/W2578319993","https://openalex.org/W2898326944","https://openalex.org/W2901983157","https://openalex.org/W2942166925","https://openalex.org/W3013652274","https://openalex.org/W3034540909","https://openalex.org/W3037051214","https://openalex.org/W3107189808","https://openalex.org/W3111818397","https://openalex.org/W3165823759","https://openalex.org/W3167424384","https://openalex.org/W3209525697","https://openalex.org/W3209731294","https://openalex.org/W4210391699","https://openalex.org/W4246153096"],"related_works":["https://openalex.org/W2002764510","https://openalex.org/W2237480599","https://openalex.org/W4293054712","https://openalex.org/W2779966368","https://openalex.org/W2163460271","https://openalex.org/W2198982833","https://openalex.org/W2100214387","https://openalex.org/W2183791707","https://openalex.org/W2387644816","https://openalex.org/W2313272286"],"abstract_inverted_index":{"Highly":[0],"efficient":[1],"algorithms":[2,161],"for":[3],"solving":[4],"the":[5,15,20,26,51,54,57,79,89,92,95,98,104,108,113,120,123,137,142,168,173,177],"time":[6,42,80,132,156,182],"constrained":[7,43,81,133],"shortest":[8,44,82,134],"path":[9,45,135],"problem":[10],"have":[11],"been":[12],"highlighted":[13],"over":[14],"past":[16],"decades":[17],"to":[18,39],"reduce":[19],"cost":[21],"of":[22,78,122,175],"vehicle":[23],"travel":[24],"in":[25,76,107,141,167],"road":[27],"network.":[28],"The":[29],"paper":[30],"presents":[31],"a":[32,41,63,131,180],"novel":[33],"graph":[34,59,65,106,160],"algorithm":[35,150],"comprising":[36],"three":[37],"stages":[38],"acquire":[40],"between":[46,117],"any":[47,77],"two":[48],"nodes":[49],"on":[50],"map.":[52],"In":[53],"first":[55,169],"stage,":[56],"undirected":[58],"is":[60,100],"transformed":[61],"into":[62],"directed":[64],"(DT":[66],"graph)":[67],"by":[68],"deleting":[69],"edges":[70],"that":[71,148],"must":[72],"not":[73,151],"be":[74],"included":[75],"paths.":[83],"A":[84],"variant":[85,124,138],"DT":[86,105,125,139],"tree":[87,140],"with":[88],"destination":[90,178],"as":[91,97],"root":[93,121],"and":[94,119,179],"source":[96],"leaf":[99],"then":[101],"constructed":[102],"from":[103,136],"second":[109],"stage.":[110,144],"By":[111],"finding":[112],"minimal":[114],"difference":[115],"value":[116],"leaves":[118],"tree,":[126],"we":[127],"can":[128,164],"eventually":[129],"obtain":[130],"third":[143],"Experimental":[145],"results":[146],"show":[147],"our":[149],"only":[152],"requires":[153],"less":[154],"running":[155],"than":[157],"some":[158],"classical":[159],"but":[162],"also":[163],"work":[165],"immediately":[166],"stage":[170],"without":[171],"knowing":[172],"information":[174],"both":[176],"specific":[181],"constraint.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-27T08:26:11.824852","created_date":"2025-10-10T00:00:00"}