Lidé
Ing. Temirlan Kurbanov
Všechny publikace
Heuristics for Fast One-to-Many Multicriteria Shortest Path Search
- Autoři: Ing. Temirlan Kurbanov, Ing. Marek Cuchý, doc. Ing. Jiří Vokřínek, Ph.D.,
- Publikace: ITSC 2022: IEEE Conference on Intelligent Transportation Systems. Institute of Electrical and Electronics Engineers, Inc., 2022. p. 594-599. ISBN 9781665468800.
- Rok: 2022
- DOI: 10.1109/ITSC55140.2022.9922586
- Odkaz: https://doi.org/10.1109/ITSC55140.2022.9922586
- Pracoviště: Katedra počítačů, Centrum umělé inteligence
-
Anotace:
Being an NP-hard problem, multicriteria shortest path search is difficult to solve with speed satisfactory for real-world use. Therefore, this article examines the combination of t-discarding kPC-MLS [1] and multiple pruning heuristics. Apart from comparing the efficiency of the individual techniques, the research also evaluates the ability of t-discarding kPC-MLS to employ such heuristics. Since the experiments were conducted on country-size roadmaps, the results are expected to be relevant to real-world applications. According to the measurements, t-discarding kPC-MLS gains a higher speedup than standard MLS [2], operating on comparable roadmaps in a matter of seconds.
