To main content

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

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

Category
Conference lecture and academic presentation
Abstract
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.
Client
  • Norges forskningsråd / 237718
Language
English
Author(s)
Affiliation
  • University of Oslo
  • SINTEF Digital / Mathematics and Cybernetics
Presented at
SESAR Innovation Days 2018
Place
Salzburg
Date
02.12.2018 - 06.12.2018
Organizer
SESAR Joint Undertaking
Year
2018