{"id":"https://openalex.org/W2531835368","doi":"https://doi.org/10.1142/s0219622016500437","title":"Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks","display_name":"Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks","publication_year":2016,"publication_date":"2016-10-14","ids":{"openalex":"https://openalex.org/W2531835368","doi":"https://doi.org/10.1142/s0219622016500437","mag":"2531835368"},"language":"en","primary_location":{"id":"doi:10.1142/s0219622016500437","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219622016500437","pdf_url":null,"source":{"id":"https://openalex.org/S207089700","display_name":"International Journal of Information Technology & Decision Making","issn_l":"0219-6220","issn":["0219-6220","1793-6845"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Technology & Decision Making","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/A5089828986","display_name":"Yaqiong Liu","orcid":"https://orcid.org/0000-0002-3376-9719"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yaqiong Liu","raw_affiliation_strings":["Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046543877","display_name":"Hock Soon Seah","orcid":"https://orcid.org/0000-0003-2699-7147"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Hock Soon Seah","raw_affiliation_strings":["School of Computer Science and Engineering, Nanyang Technological University, 639798, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanyang Technological University, 639798, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063484071","display_name":"Guochu Shou","orcid":"https://orcid.org/0000-0002-8271-0246"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guochu Shou","raw_affiliation_strings":["Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6437,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.90165031,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"15","issue":"06","first_page":"1413","last_page":"1450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9958000183105469,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11106","display_name":"Data Management and Algorithms","score":0.9596999883651733,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6504580974578857},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6100810170173645},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5709521770477295},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5364153385162354},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.475501149892807},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4574302136898041},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3397405743598938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24636191129684448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20843026041984558},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11645740270614624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10291731357574463}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6504580974578857},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6100810170173645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5709521770477295},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5364153385162354},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.475501149892807},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4574302136898041},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3397405743598938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24636191129684448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20843026041984558},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11645740270614624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10291731357574463},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0219622016500437","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219622016500437","pdf_url":null,"source":{"id":"https://openalex.org/S207089700","display_name":"International Journal of Information Technology & Decision Making","issn_l":"0219-6220","issn":["0219-6220","1793-6845"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Technology & Decision Making","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:ijitdm:v:15:y:2016:i:06:p:1413-1450","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0219622016500437","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W82786942","https://openalex.org/W166260623","https://openalex.org/W199254071","https://openalex.org/W1040581758","https://openalex.org/W1964346230","https://openalex.org/W1987916269","https://openalex.org/W2005854848","https://openalex.org/W2008472130","https://openalex.org/W2010342401","https://openalex.org/W2012778686","https://openalex.org/W2013497292","https://openalex.org/W2024428474","https://openalex.org/W2032325911","https://openalex.org/W2033638421","https://openalex.org/W2050634818","https://openalex.org/W2065714066","https://openalex.org/W2085248615","https://openalex.org/W2088117884","https://openalex.org/W2089988774","https://openalex.org/W2099272073","https://openalex.org/W2107056341","https://openalex.org/W2109923933","https://openalex.org/W2112964526","https://openalex.org/W2113276858","https://openalex.org/W2120548461","https://openalex.org/W2124484773","https://openalex.org/W2131237536","https://openalex.org/W2143083884","https://openalex.org/W2152545366","https://openalex.org/W2186094217","https://openalex.org/W2949945006"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W4318196244"],"abstract_inverted_index":{"Travel":[0],"costs":[1],"on":[2,18,201],"road":[3,11,20,204],"networks":[4,12,21,205],"always":[5],"change":[6],"over":[7],"time":[8,14,31,88,101,120],"which":[9,182],"implies":[10],"are":[13],"dependent.":[15],"Most":[16],"studies":[17],"time-dependent":[19,138],"simply":[22],"find":[23],"the":[24,28,84,113,129,156,214],"shortest":[25],"path":[26],"with":[27,100,117],"least":[29],"travel":[30,72,119],"without":[32],"considering":[33],"waiting":[34,50],"at":[35,54,59,68],"some":[36,55],"nodes,":[37],"or":[38,47],"fuel":[39,75,108,115],"consumption":[40,109,116],"and":[41,77,80,89,102,111,154,167,196,218],"toll":[42,78,130],"fee.":[43],"In":[44],"real-world":[45,203],"applications":[46],"computer":[48],"games,":[49],"may":[51],"be":[52,134],"allowed":[53],"nodes":[56],"but":[57],"disallowed":[58],"other":[60],"nodes;":[61],"a":[62,177],"user":[63],"can":[64],"traverse":[65],"an":[66,135,142],"edge":[67],"different":[69,207,222],"speeds;":[70],"monetary":[71],"cost":[73,76],"contains":[74],"fees;":[79],"users":[81],"usually":[82],"prefer":[83],"minimum-cost":[85],"route":[86,216],"under":[87],"speed":[90,103],"constraints.":[91,104],"Therefore,":[92],"we":[93,175],"study":[94],"Cost-Optimal":[95],"Time-dEpendent":[96],"Routing":[97],"(COTER)":[98],"problem":[99],"We":[105,127,140],"utilize":[106],"two":[107],"models":[110],"compute":[112],"minimum":[114],"given":[118],"for":[121,147],"highway":[122],"edges":[123],"via":[124],"nonlinear":[125,194],"optimization.":[126],"allow":[128],"fee":[131],"function":[132,146],"to":[133,221],"arbitrary":[136],"single-valued":[137],"function.":[139],"define":[141],"Optimal":[143],"Cost":[144],"(OC)":[145],"each":[148],"candidate":[149],"node":[150],"[Formula:":[151,161,168],"see":[152,162,169],"text],":[153],"derive":[155],"recurrence":[157],"relation":[158],"formula":[159],"between":[160],"text]\u2019s":[163,170],"incoming":[164],"neighbors\u2019":[165],"OC-functions":[166],"OC-functions.":[171],"To":[172],"solve":[173],"COTER,":[174],"propose":[176],"five-step":[178],"algorithm,":[179],"namely,":[180],"ALG-COTER,":[181],"uses":[183],"Fibonacci-heap":[184],"optimized":[185],"Dijkstra,":[186],"topological":[187],"sorting,":[188],"dynamic":[189],"programming,":[190],"binary":[191],"min-heap":[192],"optimization,":[193,195],"backtracking":[197],"algorithms.":[198],"Experimental":[199],"results":[200],"three":[202],"of":[206],"sizes":[208],"demonstrate":[209],"that":[210],"our":[211],"algorithm":[212],"finds":[213],"optimal":[215],"efficiently":[217],"is":[219],"scalable":[220],"parameters.":[223]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}