Improving Bi-Objective Shortest Path Search with Early Pruning.
| dc.centro | E.T.S.I. Informática | es_ES |
| dc.contributor.author | Mandow-Andaluz, Lorenzo | |
| dc.contributor.author | Pérez-de-la-Cruz-Molina, José Luis | |
| dc.date.accessioned | 2023-12-01T07:42:01Z | |
| dc.date.available | 2023-12-01T07:42:01Z | |
| dc.date.created | 2023 | |
| dc.date.issued | 2023 | |
| dc.departamento | Lenguajes y Ciencias de la Computación | |
| dc.description.abstract | 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. | es_ES |
| dc.description.sponsorship | 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. | es_ES |
| dc.identifier.uri | https://hdl.handle.net/10630/28189 | |
| dc.language.iso | eng | es_ES |
| dc.relation.eventdate | 30.09 - 04.10, 2023 | es_ES |
| dc.relation.eventplace | Krakow, Polonia | es_ES |
| dc.relation.eventtitle | 26th European Conference on Artificial Intelligence (ECAI 2023) | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.subject | Programación heurística | es_ES |
| dc.subject | Algoritmos | es_ES |
| dc.subject.other | Multiobjective search | es_ES |
| dc.subject.other | Graph search | es_ES |
| dc.subject.other | Shortest path problem | es_ES |
| dc.subject.other | Heuristic search | es_ES |
| dc.title | Improving Bi-Objective Shortest Path Search with Early Pruning. | es_ES |
| dc.type | conference output | es_ES |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | b4b11711-73ab-4cd0-854c-8ab2735e829d | |
| relation.isAuthorOfPublication | b7e65043-46cc-445b-8d8f-b4c7ad4f1c06 | |
| relation.isAuthorOfPublication.latestForDiscovery | b4b11711-73ab-4cd0-854c-8ab2735e829d |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 2023_ECAI-riuma.pdf
- Size:
- 254.03 KB
- Format:
- Adobe Portable Document Format
- Description:

