{"id":"https://openalex.org/W2991035745","doi":"https://doi.org/10.3390/ijgi8120538","title":"The \u03b5-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times","display_name":"The \u03b5-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times","publication_year":2019,"publication_date":"2019-11-27","ids":{"openalex":"https://openalex.org/W2991035745","doi":"https://doi.org/10.3390/ijgi8120538","mag":"2991035745"},"language":"en","primary_location":{"id":"doi:10.3390/ijgi8120538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi8120538","pdf_url":"https://www.mdpi.com/2220-9964/8/12/538/pdf?version=1575284366","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"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":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2220-9964/8/12/538/pdf?version=1575284366","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055812091","display_name":"Franti\u0161ek Kolovsk\u00fd","orcid":"https://orcid.org/0000-0002-2070-5871"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Franti\u0161ek Kolovsk\u00fd","raw_affiliation_strings":["Department of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-2070-5871","affiliations":[{"raw_affiliation_string":"Department of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic","institution_ids":["https://openalex.org/I92715842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101771963","display_name":"Jan Je\u017eek","orcid":"https://orcid.org/0000-0002-1868-117X"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Je\u017eek","raw_affiliation_strings":["Department of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-1868-117X","affiliations":[{"raw_affiliation_string":"Department of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic","institution_ids":["https://openalex.org/I92715842"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042317568","display_name":"Ivana Kolingerov\u00e1","orcid":"https://orcid.org/0000-0003-4556-2771"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ivana Kolingerov\u00e1","raw_affiliation_strings":["Department of Computer Science, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-4556-2771","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of West Bohemia, Univerzitn\u00ed 2732/8, 301 00 Plze\u0148, Czech Republic","institution_ids":["https://openalex.org/I92715842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055812091"],"corresponding_institution_ids":["https://openalex.org/I92715842"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.654,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69448631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":96},"biblio":{"volume":"8","issue":"12","first_page":"538","last_page":"538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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.9919000267982483,"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/precomputation","display_name":"Precomputation","score":0.8418163657188416},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7637425065040588},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6641311645507812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5655972957611084},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.557858943939209},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5536478757858276},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5440172553062439},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5415066480636597},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5361696481704712},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5221712589263916},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.43846043944358826},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43559694290161133},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42322707176208496},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4207548499107361},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4128355085849762},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.40885841846466064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33587247133255005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15741455554962158},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15321564674377441},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.093709796667099}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.8418163657188416},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7637425065040588},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6641311645507812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5655972957611084},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.557858943939209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5536478757858276},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5440172553062439},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5415066480636597},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5361696481704712},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5221712589263916},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.43846043944358826},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43559694290161133},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42322707176208496},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4207548499107361},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4128355085849762},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40885841846466064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33587247133255005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15741455554962158},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15321564674377441},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.093709796667099},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/ijgi8120538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi8120538","pdf_url":"https://www.mdpi.com/2220-9964/8/12/538/pdf?version=1575284366","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"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":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},{"id":"pmh:oai:dspace5.zcu.cz:11025/39605","is_oa":false,"landing_page_url":"http://hdl.handle.net/11025/39605","pdf_url":null,"source":{"id":"https://openalex.org/S4306400586","display_name":"Digital Library (University of West Bohemia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I92715842","host_organization_name":"University of West Bohemia in Pilsen","host_organization_lineage":["https://openalex.org/I92715842"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"\u010dl\u00e1nek"},{"id":"pmh:oai:mdpi.com:/2220-9964/8/12/538/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/ijgi8120538","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":"ISPRS International Journal of Geo-Information","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/ijgi8120538","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi8120538","pdf_url":"https://www.mdpi.com/2220-9964/8/12/538/pdf?version=1575284366","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"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":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1630010039","display_name":null,"funder_award_id":"SGS-2019-015","funder_id":"https://openalex.org/F4320310981","funder_display_name":"Z\u00e1pado\u010desk\u00e1 Univerzita v Plzni"},{"id":"https://openalex.org/G3411598287","display_name":"Sustainability support of the centre NTIS - New Technologies for the Information Society","funder_award_id":"LO1506","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G4447851798","display_name":null,"funder_award_id":"SGS-2019-015","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"}],"funders":[{"id":"https://openalex.org/F4320310981","display_name":"Z\u00e1pado\u010desk\u00e1 Univerzita v Plzni","ror":"https://ror.org/040t43x18"},{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2991035745.pdf","grobid_xml":"https://content.openalex.org/works/W2991035745.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W42546367","https://openalex.org/W43621356","https://openalex.org/W101345945","https://openalex.org/W189036138","https://openalex.org/W1671142266","https://openalex.org/W1964416868","https://openalex.org/W1988189387","https://openalex.org/W2050634818","https://openalex.org/W2089338760","https://openalex.org/W2116643655","https://openalex.org/W2163978269","https://openalex.org/W2227557434","https://openalex.org/W2947589198","https://openalex.org/W3043093646","https://openalex.org/W6604066609"],"related_works":["https://openalex.org/W2368259793","https://openalex.org/W651485002","https://openalex.org/W2597144308","https://openalex.org/W2381419702","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2300444527","https://openalex.org/W2100214387","https://openalex.org/W2808045650","https://openalex.org/W3039948179"],"abstract_inverted_index":{"In":[0],"this":[1,33],"paper,":[2],"the":[3,37,62,67,76,83,89,104,110,124],"shortest":[4,21],"paths":[5],"search":[6,42],"for":[7,28,148],"all":[8],"departure":[9,126],"times":[10],"(profile":[11],"search)":[12],"are":[13,47],"discussed.":[14],"This":[15],"problem":[16,23],"is":[17,26,64,80,87],"called":[18],"a":[19,50,140],"time-dependent":[20,29],"path":[22],"(TDSP)":[24],"and":[25,98],"suitable":[27],"travel-time":[30],"analysis.":[31,152],"Particularly,":[32],"paper":[34],"deals":[35],"with":[36],"\u03b5":[38],"-approximation":[39],"of":[40,54,61,96,100,107,123],"profile":[41],"computation.":[43],"The":[44,58,132],"proposed":[45,90],"algorithms":[46,133,146],"based":[48],"on":[49],"label":[51],"correcting":[52],"modification":[53],"Dijkstra\u2019s":[55],"algorithm":[56,63],"(LCA).":[57],"main":[59],"idea":[60],"to":[65,103,118,129],"simplify":[66],"arrival":[68],"function":[69],"after":[70],"every":[71],"relaxation":[72],"step":[73,142],"so":[74],"that":[75],"maximum":[77,84],"relative":[78,85],"error":[79,86],"maintained.":[81],"When":[82],"0.001,":[88],"solution":[91],"saves":[92],"more":[93],"than":[94],"97%":[95],"breakpoints":[97],"80%":[99],"time":[101,127,151],"compared":[102],"exact":[105],"version":[106],"LCA.":[108],"Furthermore,":[109],"runtime":[111],"can":[112,136],"be":[113,137],"improved":[114],"by":[115],"other":[116,144],"15%":[117],"40%":[119],"using":[120],"heuristic":[121],"splitting":[122],"original":[125],"interval":[128],"several":[130],"subintervals.":[131],"we":[134],"developed":[135],"used":[138],"as":[139],"precomputation":[141],"in":[143],"routing":[145],"or":[147],"some":[149],"travel":[150]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}