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

authors

  • GARC√ćA HEREDIA, DAVID
  • MOLINA FERRAGUT, ELISENDA
  • Laguna, Manuel
  • Alonso Ayuso, Antonio

publication date

  • November 2021

start page

  • 1

end page

  • 12

volume

  • 182

International Standard Serial Number (ISSN)

  • 0957-4174

Electronic International Standard Serial Number (EISSN)

  • 1873-6793

abstract

  • 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.

subjects

  • Mathematics

keywords

  • air traffic flow management; matheuristics; shortest path problem; shortest path with constrained resources