Heuristics for Fast One-to-Many Multicriteria Shortest Path Search
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00363869" target="_blank" >RIV/68407700:21230/22:00363869 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/ITSC55140.2022.9922586" target="_blank" >http://dx.doi.org/10.1109/ITSC55140.2022.9922586</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ITSC55140.2022.9922586" target="_blank" >10.1109/ITSC55140.2022.9922586</a>
Alternative languages
Result language
angličtina
Original language name
Heuristics for Fast One-to-Many Multicriteria Shortest Path Search
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ITSC 2022: IEEE Conference on Intelligent Transportation Systems
ISBN
9781665468800
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
594-599
Publisher name
Institute of Electrical and Electronics Engineers, Inc.
Place of publication
—
Event location
Macau
Event date
Sep 18, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—