García Heredia, DavidMolina Ferragut, ElisendaLaguna, ManuelAlonso Ayuso, AntonioUniversidad Carlos III de Madrid. Departamento de Estadística2020-09-042020-09-042020-09-042387-0303https://hdl.handle.net/10016/30793We tackle the problem of finding, for each network within a collection, the shortest path betweentwo 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 consistingof 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 the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and that a particular case of the RCMPSP occurs in Air Traffic Flow Management (ATFM). 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.engAtribución-NoComercial-SinDerivadas 3.0 EspañaMatheuristicsShortest PathResource-Constrained Multi-Project Scheduling ProblemAir Traffic Flow Managementworking paperDT/0000001807