{"id":"https://openalex.org/W3186417409","doi":"https://doi.org/10.3390/a14080220","title":"Time-Dependent Alternative Route Planning: Theory and Practice","display_name":"Time-Dependent Alternative Route Planning: Theory and Practice","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3186417409","doi":"https://doi.org/10.3390/a14080220","mag":"3186417409"},"language":"en","primary_location":{"id":"doi:10.3390/a14080220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080220","pdf_url":"https://www.mdpi.com/1999-4893/14/8/220/pdf?version=1626937648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/8/220/pdf?version=1626937648","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086270340","display_name":"Spyros Kontogiannis","orcid":"https://orcid.org/0000-0002-8559-6418"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Spyros Kontogiannis","raw_affiliation_strings":["Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","Department of Computer Science & Engineering, University of Ioannina, 45110 Ioannina, Greece","Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Ioannina, 45110 Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]},{"raw_affiliation_string":"Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020766684","display_name":"Andreas Paraskevopoulos","orcid":"https://orcid.org/0000-0002-6981-5625"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]},{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Andreas Paraskevopoulos","raw_affiliation_strings":["Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","Department of Computer Engineering & Informatics, University of Patras, 26504 Patras, Greece","Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Department of Computer Engineering & Informatics, University of Patras, 26504 Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Zaroliagis","raw_affiliation_strings":["Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","Department of Computer Engineering & Informatics, University of Patras, 26504 Patras, Greece","Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Technology Institute & Press \u201cDiophantus\u201d, 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Department of Computer Engineering & Informatics, University of Patras, 26504 Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Computer Technology Institute & Press \"Diophantus\", 26504 Patra, Greece","institution_ids":["https://openalex.org/I120729142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086270340"],"corresponding_institution_ids":["https://openalex.org/I120729142","https://openalex.org/I194019607"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7684,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7089467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"8","first_page":"220","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9865999817848206,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"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/computer-science","display_name":"Computer science","score":0.7762511372566223},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5868542194366455},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5355771780014038},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5232021808624268},{"id":"https://openalex.org/keywords/metadata","display_name":"Metadata","score":0.5192606449127197},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.47354668378829956},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4088565707206726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4034527838230133},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15404313802719116}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7762511372566223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5868542194366455},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5355771780014038},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5232021808624268},{"id":"https://openalex.org/C93518851","wikidata":"https://www.wikidata.org/wiki/Q180160","display_name":"Metadata","level":2,"score":0.5192606449127197},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.47354668378829956},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4088565707206726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4034527838230133},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15404313802719116},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14080220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080220","pdf_url":"https://www.mdpi.com/1999-4893/14/8/220/pdf?version=1626937648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:488772e777af41c8b19ba27cfbdf22fb","is_oa":true,"landing_page_url":"https://doaj.org/article/488772e777af41c8b19ba27cfbdf22fb","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 8, p 220 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/8/220/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14080220","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 8; Pages: 220","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14080220","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080220","pdf_url":"https://www.mdpi.com/1999-4893/14/8/220/pdf?version=1626937648","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3186417409.pdf","grobid_xml":"https://content.openalex.org/works/W3186417409.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W85206208","https://openalex.org/W119169328","https://openalex.org/W191895701","https://openalex.org/W197429550","https://openalex.org/W1489344685","https://openalex.org/W1552451308","https://openalex.org/W1557047551","https://openalex.org/W1969483458","https://openalex.org/W1993451940","https://openalex.org/W2011282943","https://openalex.org/W2050634818","https://openalex.org/W2051956023","https://openalex.org/W2085248615","https://openalex.org/W2089338760","https://openalex.org/W2100293260","https://openalex.org/W2104317982","https://openalex.org/W2116643655","https://openalex.org/W2119167984","https://openalex.org/W2127620007","https://openalex.org/W2131058166","https://openalex.org/W2140946282","https://openalex.org/W2144050074","https://openalex.org/W2173413334","https://openalex.org/W2611711374","https://openalex.org/W2906899199","https://openalex.org/W3007023388","https://openalex.org/W3043093646","https://openalex.org/W4251169695","https://openalex.org/W4294563810","https://openalex.org/W6603367671","https://openalex.org/W6663210459","https://openalex.org/W6677481295","https://openalex.org/W6677555952","https://openalex.org/W6720830320"],"related_works":["https://openalex.org/W2392768766","https://openalex.org/W2058118494","https://openalex.org/W2095118173","https://openalex.org/W2382021449","https://openalex.org/W2104269053","https://openalex.org/W2106424170","https://openalex.org/W2501188010","https://openalex.org/W4299935056","https://openalex.org/W2768810474","https://openalex.org/W4206575749"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,48,89,100,117,123,127,136,152,160,185,210],"problem":[3],"of":[4,8,50,60,83,91,129,144,207],"computing":[5],"a":[6,37,51,57,74,92,141,167,175],"set":[7,82,143],"meaningful":[9],"alternative":[10,32,84,94,130,172],"origin-to-destination":[11],"routes,":[12],"in":[13,63,72,88,126,151,162],"real-world":[14],"road":[15,194],"network":[16],"instances":[17],"whose":[18],"arcs":[19],"are":[20],"accompanied":[21],"by":[22,99],"travel-time":[23,61,138],"functions":[24],"rather":[25],"than":[26,209],"fixed":[27],"costs.":[28],"In":[29],"this":[30,115],"time-dependent":[31,93,124,193],"route":[33,102],"scenario,":[34],"we":[35],"present":[36],"novel":[38],"query":[39,156],"algorithm,":[40],"called":[41],"Time-Dependent":[42],"Alternative":[43],"Graph":[44],"(TDAG),":[45],"that":[46,120,197],"exploits":[47],"outcome":[49],"time-consuming":[52],"preprocessing":[53],"phase":[54,169,177],"to":[55,65],"create":[56],"manageable":[58],"amount":[59],"metadata,":[62],"order":[64],"provide":[66],"answers":[67],"for":[68,77],"arbitrary":[69],"alternative-routes":[70],"queries,":[71],"only":[73],"few":[75],"milliseconds":[76],"continental-size":[78],"instances.":[79],"The":[80,132,154],"resulting":[81],"routes":[85,183],"is":[86,97,116],"aggregated":[87],"form":[90],"graph,":[95],"which":[96],"characterized":[98],"minimum":[101,137],"overlap,":[103],"small":[104,107,142],"stretch":[105],"factor,":[106],"size,":[108],"and":[109,147],"low":[110],"complexity.":[111],"To":[112],"our":[113],"knowledge,":[114],"first":[118],"work":[119,161],"deals":[121],"with":[122],"setting":[125],"framework":[128],"routes.":[131],"preprocessed":[133],"metadata":[134],"prescribe":[135],"informations":[139],"between":[140],"\u201clandmark\u201d":[145],"nodes":[146,150],"all":[148],"other":[149],"graph.":[153],"TDAG":[155,198],"algorithm":[157],"carries":[158],"out":[159],"two":[163,205],"distinct":[164],"phases:":[165],"initially,":[166],"collection":[168],"constructs":[170],"candidate":[171,186],"routes;":[173],"consequently,":[174],"pruning":[176],"cautiously":[178],"discards":[179],"uninteresting":[180],"or":[181,204],"low-quality":[182],"from":[184],"set.":[187],"Our":[188],"experimental":[189],"evaluation":[190],"on":[191],"real-world,":[192],"networks":[195],"demonstrates":[196],"performed":[199],"much":[200],"better":[201],"(by":[202],"one":[203],"orders":[206],"magnitude)":[208],"existing":[211],"baseline":[212],"approaches.":[213]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-03-06T13:50:29.536080","created_date":"2025-10-10T00:00:00"}