Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm
Journal article, Peer reviewed
Published version
View/ Open
Date
2018Metadata
Show full item recordCollections
- Publikasjoner fra CRIStin - SINTEF AS [5583]
- SINTEF Digital [2379]
Original version
SESAR Innovation Days. 2018, 7Abstract
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