Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorKolovský, František
dc.contributor.authorJežek, Jan
dc.contributor.authorKolingerová, Ivana
dc.date.accessioned2023-03-20T11:00:14Z-
dc.date.available2023-03-20T11:00:14Z-
dc.date.issued2019
dc.identifier.citationKOLOVSKÝ, F. JEŽEK, J. KOLINGEROVÁ, I. The ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithm. In GISTAM 2019 - Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management2019. Heraklion: SciTePress, 2019. s. 26-32. ISBN: 978-989-758-371-1cs
dc.identifier.isbn978-989-758-371-1
dc.identifier.uri2-s2.0-85067445747
dc.identifier.urihttp://hdl.handle.net/11025/51709
dc.format7 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherSciTePressen
dc.rights© Scitepressen
dc.titleThe ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithmen
dc.typekonferenční příspěvekcs
dc.typeConferenceObjecten
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedThis paper is focused on searching the shortest paths for all departure times (profile search). This problem is called a time-dependent shortest path problem (TDSP) and is important for optimization in transportation. Particularly this paper deals with the ε-approximation of TDSP. The proposed algorithm is based on a label correcting modification of Dijkstra's algorithm (LCA). The main idea of the algorithm is to simplify the arrival function after every relaxation step so that the maximum relative error is maintained. When the maximum relative error is 0.001, the proposed solution saves more than 95% of breakpoints and 80% time compared to the exact version of LCA. A more efficient precomputation step for another time-dependent routing algorithms can be built using the developed algorithm.en
dc.subject.translatedApproximationen
dc.subject.translatedRoad Networken
dc.subject.translatedTime-dependent Shortest Path Problemen
dc.subject.translatedTravel Time Functionen
dc.identifier.doi10.5220/0007658200260032
dc.type.statusPeer-revieweden
dc.identifier.document-number570535400002
dc.identifier.obd43927498
dc.project.IDSGS-2019-015/Využití matematiky a informatiky v geomatice IVcs
Vyskytuje se v kolekcích:Konferenční příspěvky / Conference Papers (KGM)
OBD

Soubory připojené k záznamu:
Soubor VelikostFormát 
kolovsky-kolingerova.pdf1,09 MBAdobe PDFZobrazit/otevřít
Zobrazit minimální záznam Zobrazit statistiky


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/51709

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.

hledání
navigace
  1. DSpace at University of West Bohemia
  2. Publikační činnost / Publications
  3. OBD