To main content

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

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.

Category

Conference lecture

Language

English

Author(s)

Affiliation

  • SINTEF Digital / Mathematics and Cybernetics
  • University of Oslo

Presented at

SESAR Innovation Days 2018

Place

Salzburg

Date

03.12.2018 - 07.12.2018

Organizer

SESAR Joint Undertaking

Year

2018

View this publication at Norwegian Research Information Repository