2026-06-02T05:19:25Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/281892026-02-03T12:15:29Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Mandow-Andaluz, Lorenzo author Pérez-de-la-Cruz-Molina, José Luis author 2023 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. https://hdl.handle.net/10630/28189 Programación heurística Algoritmos Improving Bi-Objective Shortest Path Search with Early Pruning.