{"id":"https://openalex.org/W606842859","doi":"https://doi.org/10.1080/10248079308903784","title":"FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION","display_name":"FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W606842859","doi":"https://doi.org/10.1080/10248079308903784","mag":"606842859"},"language":"en","primary_location":{"id":"doi:10.1080/10248079308903784","doi":"https://doi.org/10.1080/10248079308903784","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248079308903784","pdf_url":null,"source":{"id":"https://openalex.org/S4210179879","display_name":"IVHS journal","issn_l":"1026-7565","issn":["1026-7565","1065-5123"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"I V H S Journal","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.3176,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.98278674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"1","first_page":"89","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9413999915122986,"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.9413999915122986,"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/T10524","display_name":"Traffic control and management","score":0.024000000208616257,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.019600000232458115,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/time-dependent-networks","display_name":"time-dependent networks","score":0.8270000219345093},{"id":"https://openalex.org/keywords/intelligent-transportation-systems","display_name":"intelligent transportation systems","score":0.9760000109672546},{"id":"https://openalex.org/keywords/consistency-conditions","display_name":"consistency conditions","score":0.7509999871253967},{"id":"https://openalex.org/keywords/deterministic-forecasts","display_name":"deterministic forecasts","score":0.7950000166893005},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9679999947547913},{"id":"https://openalex.org/keywords/stochastic-shortest-path","display_name":"stochastic shortest path","score":0.6340000033378601},{"id":"https://openalex.org/keywords/traffic-assignment","display_name":"traffic assignment","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.7704676389694214},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6452715992927551},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6197378635406494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5807605385780334},{"id":"https://openalex.org/C11534374","wikidata":"https://www.wikidata.org/wiki/Q7805280","display_name":"Time consistency","level":2,"score":0.5201592445373535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.509818971157074},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5032529234886169},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.44706183671951294},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.42269638180732727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2460300624370575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2175101637840271},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17184650897979736},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.10200569033622742},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08720836043357849},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07781893014907837},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07366165518760681},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10248079308903784","doi":"https://doi.org/10.1080/10248079308903784","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248079308903784","pdf_url":null,"source":{"id":"https://openalex.org/S4210179879","display_name":"IVHS journal","issn_l":"1026-7565","issn":["1026-7565","1065-5123"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"I V H S Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.651199996471405}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1985327268","https://openalex.org/W3084224593","https://openalex.org/W2963619247","https://openalex.org/W7095341944","https://openalex.org/W204348808","https://openalex.org/W2143850401","https://openalex.org/W1589787440","https://openalex.org/W2080930076","https://openalex.org/W2342356477","https://openalex.org/W2034171961"],"abstract_inverted_index":{"The":[0],"article":[1],"considers":[2],"the":[3,43,52,63,86,98],"problem":[4],"of":[5,21,62],"individual":[6],"route":[7],"guidance":[8],"in":[9,75],"an":[10],"Intelligent":[11],"Vehicle":[12],"Highway":[13],"Systems":[14],"(IVHS)":[15],"environment,":[16],"based":[17],"on":[18,85],"time-dependent":[19,44],"forecasts":[20,32],"link":[22],"travel":[23],"time.":[24],"It":[25],"proposes":[26],"a":[27,76,94],"consistency":[28,69],"condition":[29],"which":[30],"deterministic":[31],"should":[33],"be":[34,48],"constrained":[35],"to":[36,93],"satisfy,":[37],"and":[38],"shows":[39],"that":[40],"under":[41],"consistency,":[42],"fastest":[45,59,88],"path":[46,89],"can":[47],"calculated":[49],"with":[50],"exactly":[51],"same":[53],"computational":[54,71],"complexity":[55,72],"as":[56],"for":[57],"static":[58],"paths,":[60],"regardless":[61],"time":[64,79],"index":[65],"set.":[66],"In":[67],"particular,":[68],"reduces":[70],"by":[73],"O(T)":[74],"T-period":[77],"discrete":[78],"problem.":[80],"A":[81],"comment":[82],"is":[83],"made":[84],"stochastic":[87],"problem,":[90],"suggesting":[91],"modifications":[92],"general-case":[95],"algorithm":[96],"from":[97],"literature.":[99]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-03T07:22:36.454288","created_date":"2016-06-24T00:00:00"}