loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: František Kolovský 1 ; Jan Ježek 1 and Ivana Kolingerová 2

Affiliations: 1 Depatment of Geomatics, University of West Bohemia, Univerzitní 2732/8, Plzeň and Czech Republic ; 2 Department of Computer Science, University of West Bohemia, Univerzitní 2732/8, Plzeň and Czech Republic

Keyword(s): Time-dependent Shortest Path Problem, Approximation, Travel Time Function, Road Network.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Databases and Data Security ; Query Processing and Optimization

Abstract: This 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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.91.152

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kolovský, F.; Ježek, J. and Kolingerová, I. (2019). The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm. In Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management - GISTAM; ISBN 978-989-758-371-1; ISSN 2184-500X, SciTePress, pages 26-32. DOI: 10.5220/0007658200260032

@conference{gistam19,
author={František Kolovský. and Jan Ježek. and Ivana Kolingerová.},
title={The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm},
booktitle={Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management - GISTAM},
year={2019},
pages={26-32},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007658200260032},
isbn={978-989-758-371-1},
issn={2184-500X},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management - GISTAM
TI - The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm
SN - 978-989-758-371-1
IS - 2184-500X
AU - Kolovský, F.
AU - Ježek, J.
AU - Kolingerová, I.
PY - 2019
SP - 26
EP - 32
DO - 10.5220/0007658200260032
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic