2026-05-27T05:36:07Zhttps://riuma.uma.es/rest/oai/requestoai:riuma.uma.es:10630/281892026-02-03T12:15:29Zcom_10630_2254col_10630_37959
Improving Bi-Objective Shortest Path Search with Early Pruning.
Mandow-Andaluz, Lorenzo
Pérez-de-la-Cruz-Molina, José Luis
Programación heurística
Algoritmos
Bi-objective search problems are a useful generalization
of shortest path search. This paper reviews some recent contributions
for the solution of this problem with emphasis on the efficiency of the
dominance checks required for pruning, and introduces a new algorithm
that improves time efficiency over previous proposals. Experimental
results are presented to show the performance improvement
using a set of standard problems over bi-objective road maps.
2023-12-01T07:42:01Z
2023-12-01T07:42:01Z
2023
2023
conference output
https://hdl.handle.net/10630/28189
eng
26th European Conference on Artificial Intelligence (ECAI 2023)
Krakow, Polonia
30.09 - 04.10, 2023
open access