D. García Heredia, A. Alonso Ayuso, M. Laguna, E. Molina
In this work we propose a matheuristic algorithm to tackle the problem of finding, for each independent network within a collection, the shortest path between two points while respecting common capacity constraints that link all the nets together. These capacity constraints, which commonly represent the usage of limited resources (e.g.: train tracks), restrict the simultaneous use of arcs.
For real applications in which this problem structure arises (e.g.: Air Traffic Flow Management), the size of the problems might rapidly exceed the computational resources when solving them with MIP commercial software. That is why, jointly with the aim of obtaining competent results in short periods of time, that we develop this algorithm. To show its performance, an exhaustive computational experience is presented.
Palabras clave: Constrained Shortest Path, Matheuristics, Scheduling problems
Programado
HEU-1 Heurísticas y Metaheurísticas
6 de septiembre de 2019 15:30
I3L10. Edificio Georgina Blanes