{"id":"https://openalex.org/W2150928468","doi":"https://doi.org/10.1145/2670126","title":"Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks","display_name":"Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks","publication_year":2015,"publication_date":"2015-01-07","ids":{"openalex":"https://openalex.org/W2150928468","doi":"https://doi.org/10.1145/2670126","mag":"2150928468"},"language":"en","primary_location":{"id":"doi:10.1145/2670126","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2670126","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5002138349","display_name":"Dominik Kirchler","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dominik Kirchler","raw_affiliation_strings":["LIX \u00c9cole Polytechnique; LIPN, Univ. Paris 13; Mediamobile, Ivry Sur Seine, France","LIPN, Univ. Paris 13"],"affiliations":[{"raw_affiliation_string":"LIX \u00c9cole Polytechnique; LIPN, Univ. Paris 13; Mediamobile, Ivry Sur Seine, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I4210139461","https://openalex.org/I4210091279"]},{"raw_affiliation_string":"LIPN, Univ. Paris 13","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I4210091279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046138085","display_name":"Leo Liberti","orcid":"https://orcid.org/0000-0003-3139-6821"},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Leo Liberti","raw_affiliation_strings":["LIX \u00c9cole Polytechnique, Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"LIX \u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I4210139461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034818335","display_name":"Roberto Wolfler Calvo","orcid":"https://orcid.org/0000-0002-5459-5797"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Roberto Wolfler Calvo","raw_affiliation_strings":["LIPN, Universit\u00e9 Paris 13, France"],"affiliations":[{"raw_affiliation_string":"LIPN, Universit\u00e9 Paris 13, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I4210091279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002138349"],"corresponding_institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210139461","https://openalex.org/I4210156583"],"apc_list":null,"apc_paid":null,"fwci":0.8683,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74653954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":null,"first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6926291584968567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6775869131088257},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5907409191131592},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5885058045387268},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.5118781328201294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.502368688583374},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.466668039560318},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4296375811100006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3671586215496063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2888914942741394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22209373116493225},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11299547553062439}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6926291584968567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6775869131088257},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5907409191131592},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5885058045387268},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.5118781328201294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.502368688583374},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.466668039560318},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4296375811100006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3671586215496063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2888914942741394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22209373116493225},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11299547553062439},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2670126","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2670126","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.9811","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.9811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/~liberti/acmjea13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W833447691","https://openalex.org/W1491427870","https://openalex.org/W1510939284","https://openalex.org/W1533159348","https://openalex.org/W1549911051","https://openalex.org/W1788719447","https://openalex.org/W1810931192","https://openalex.org/W1920501755","https://openalex.org/W1964915778","https://openalex.org/W1969483458","https://openalex.org/W1985327268","https://openalex.org/W1986797609","https://openalex.org/W1989529460","https://openalex.org/W1991739014","https://openalex.org/W1995367195","https://openalex.org/W1996936086","https://openalex.org/W2011824721","https://openalex.org/W2014889099","https://openalex.org/W2030166143","https://openalex.org/W2037998882","https://openalex.org/W2040481750","https://openalex.org/W2089338760","https://openalex.org/W2109923933","https://openalex.org/W2135282325","https://openalex.org/W2147095480","https://openalex.org/W2150418461","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2269184848","https://openalex.org/W2548579856"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":{"We":[0,24,51,76,87],"consider":[1],"shortest":[2,45],"paths":[3],"on":[4,14,71,93],"time-dependent":[5],"multimodal":[6,95],"transportation":[7,21,96],"networks":[8],"in":[9,65],"which":[10,61],"restrictions":[11,26],"or":[12],"preferences":[13,28],"the":[15,37,41,72],"use":[16],"of":[17,20,31,74,80],"certain":[18],"modes":[19],"may":[22],"arise.":[23],"model":[25],"and":[27,84],"by":[29],"means":[30],"regular":[32,42],"languages.":[33],"Methods":[34],"for":[35],"solving":[36],"corresponding":[38],"problem":[39,47],"(called":[40],"language":[43],"constrained":[44],"path":[46],")":[48],"already":[49],"exist.":[50],"propose":[52],"a":[53],"new":[54],"algorithm,":[55],"called":[56],"State":[57],"Dependent":[58],"ALT":[59],"(SDALT),":[60],"runs":[62],"considerably":[63],"faster":[64],"many":[66],"scenarios.":[67],"Speed-up":[68],"magnitude":[69],"depends":[70],"type":[73],"constraints.":[75],"present":[77],"different":[78],"versions":[79],"SDALT,":[81],"including":[82],"unidirectional":[83],"bidirectional":[85],"search.":[86],"also":[88],"provide":[89],"extensive":[90],"experimental":[91],"results":[92],"realistic":[94],"networks.":[97]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}