A solution method for the shared resource-constrained multi-shortest path problem

We tackle the problem of finding, for each network within a collection, the shortest path between two given nodes, while not exceeding the limits of a set of shared resources. We present an integer programming (IP) formulation of this problem and propose a parallelizable matheuristic consisting of t...

Descripción completa

Detalles Bibliográficos
Autores: García-Heredia, David, Molina, Elisenda, Laguna, Manuel, Alonso-Ayuso, Antonio
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universidad Rey Juan Carlos
Repositorio:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:burjcdigital.urjc.es:10115/40516
Acceso en línea:https://hdl.handle.net/10115/40516
Access Level:acceso abierto
Palabra clave:Matheuristics
Shortest Path Problem
Shortest Path with Constrained Resources
Air Traffic Flow Management
id ES_4fb9262a92f3e4986e34efbc3d302b2c
oai_identifier_str oai:burjcdigital.urjc.es:10115/40516
network_acronym_str ES
network_name_str España
repository_id_str
spelling A solution method for the shared resource-constrained multi-shortest path problemGarcía-Heredia, DavidMolina, ElisendaLaguna, ManuelAlonso-Ayuso, AntonioMatheuristicsShortest Path ProblemShortest Path with Constrained ResourcesAir Traffic Flow ManagementWe tackle the problem of finding, for each network within a collection, the shortest path between two given nodes, while not exceeding the limits of a set of shared resources. We present an integer programming (IP) formulation of this problem and propose a parallelizable matheuristic consisting of three phases: (1) generation of feasible solutions, (2) combination of solutions, and (3) solution improvement. We show that the shortest paths found with our procedure correspond to the solution of some type of scheduling problems such as the Air Traffic Flow Management (ATFM) problem. Our computational results include finding optimal solutions to small and medium-size ATFM instances by applying Gurobi to the IP formulation. We use those solutions to assess the quality of the output produced by our proposed matheuristic. For the largest instances, which correspond to actual flight plans in ATFM, exact methods fail and we assess the quality of our solutions by means of Lagrangian bounds. Computational results suggest that the proposed procedure is an effective approach to the family of shortest path problems that we discuss here.Elsevier202420242021info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10115/40516reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlosinstname:Universidad Rey Juan CarlosInglésAttribution-NonCommercial-NoDerivs 4.0 Internationalhttps://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:burjcdigital.urjc.es:10115/405162026-06-24T12:48:17Z
dc.title.none.fl_str_mv A solution method for the shared resource-constrained multi-shortest path problem
title A solution method for the shared resource-constrained multi-shortest path problem
spellingShingle A solution method for the shared resource-constrained multi-shortest path problem
García-Heredia, David
Matheuristics
Shortest Path Problem
Shortest Path with Constrained Resources
Air Traffic Flow Management
title_short A solution method for the shared resource-constrained multi-shortest path problem
title_full A solution method for the shared resource-constrained multi-shortest path problem
title_fullStr A solution method for the shared resource-constrained multi-shortest path problem
title_full_unstemmed A solution method for the shared resource-constrained multi-shortest path problem
title_sort A solution method for the shared resource-constrained multi-shortest path problem
dc.creator.none.fl_str_mv García-Heredia, David
Molina, Elisenda
Laguna, Manuel
Alonso-Ayuso, Antonio
author García-Heredia, David
author_facet García-Heredia, David
Molina, Elisenda
Laguna, Manuel
Alonso-Ayuso, Antonio
author_role author
author2 Molina, Elisenda
Laguna, Manuel
Alonso-Ayuso, Antonio
author2_role author
author
author
dc.subject.none.fl_str_mv Matheuristics
Shortest Path Problem
Shortest Path with Constrained Resources
Air Traffic Flow Management
topic Matheuristics
Shortest Path Problem
Shortest Path with Constrained Resources
Air Traffic Flow Management
description We tackle the problem of finding, for each network within a collection, the shortest path between two given nodes, while not exceeding the limits of a set of shared resources. We present an integer programming (IP) formulation of this problem and propose a parallelizable matheuristic consisting of three phases: (1) generation of feasible solutions, (2) combination of solutions, and (3) solution improvement. We show that the shortest paths found with our procedure correspond to the solution of some type of scheduling problems such as the Air Traffic Flow Management (ATFM) problem. Our computational results include finding optimal solutions to small and medium-size ATFM instances by applying Gurobi to the IP formulation. We use those solutions to assess the quality of the output produced by our proposed matheuristic. For the largest instances, which correspond to actual flight plans in ATFM, exact methods fail and we assess the quality of our solutions by means of Lagrangian bounds. Computational results suggest that the proposed procedure is an effective approach to the family of shortest path problems that we discuss here.
publishDate 2021
dc.date.none.fl_str_mv 2021
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10115/40516
url https://hdl.handle.net/10115/40516
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv Attribution-NonCommercial-NoDerivs 4.0 International
https://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Attribution-NonCommercial-NoDerivs 4.0 International
https://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
instname:Universidad Rey Juan Carlos
instname_str Universidad Rey Juan Carlos
reponame_str BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
collection BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407837526949888
score 15.811543

Similares en LA Referencia