RT Conference Proceedings
T1 Improving Bi-Objective Shortest Path Search with Early Pruning.
A1 Mandow-Andaluz, Lorenzo
A1 Pérez-de-la-Cruz-Molina, José Luis
K1 Programación heurística
K1 Algoritmos
AB Bi-objective search problems are a useful generalizationof shortest path search. This paper reviews some recent contributionsfor the solution of this problem with emphasis on the efficiency of thedominance checks required for pruning, and introduces a new algorithmthat improves time efficiency over previous proposals. Experimentalresults are presented to show the performance improvementusing a set of standard problems over bi-objective road maps.
YR 2023
FD 2023
LK https://hdl.handle.net/10630/28189
UL https://hdl.handle.net/10630/28189
LA eng
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. Financiado por Plan Propio de Investigación de la Universidad de Málaga (UMA), Campus de Excelencia Internacional Andalucía Tech. Work supported by the Spanish Ministry of Science and Innovation, European Regional Development Fund (FEDER), Junta de Andalucía, and Universidad de Málaga through the research projects with reference IRIS PID2021-122812OB-I00, PID2021-122381OB-I00 and UMA20-FEDERJA-065.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 20 ene 2026