Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm
Journal article, Peer reviewed
Published version
Permanent lenke
http://hdl.handle.net/11250/2580278Utgivelsesdato
2018Metadata
Vis full innførselSamlinger
- Publikasjoner fra CRIStin - SINTEF AS [5642]
- SINTEF Digital [2381]
Originalversjon
SESAR Innovation Days. 2018, 7Sammendrag
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. Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm