Til hovedinnhold

Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm

Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm

Kategori
Konferansebidrag og faglig presentasjon
Sammendrag
We extend the new, efficient Path&Cycle formulation for the Hotspot Problem with two methods for dealing with windowed capacity constraints. We also discuss how to combine constraints to allow two-level capacity restricions for peak and average load respectively. Finally, we present computational results for the sliding window capacity constraint.
Oppdragsgiver
  • Norges forskningsråd / 237718
Språk
Engelsk
Forfatter(e)
Institusjon(er)
  • Universitetet i Oslo
  • SINTEF Digital / Mathematics and Cybernetics
Presentert på
SESAR Innovation Days 2018
Sted
Salzburg
Dato
02.12.2018 - 06.12.2018
Arrangør
SESAR Joint Undertaking
År
2018