Til hovedinnhold
Norsk English

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

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.

Kategori

Vitenskapelig artikkel

Oppdragsgiver

  • Research Council of Norway (RCN) / 237718

Språk

Engelsk

Forfatter(e)

Institusjon(er)

  • Universitetet i Oslo
  • SINTEF Digital / Mathematics and Cybernetics

År

2018

Publisert i

SESAR Innovation Days

ISSN

0770-1268

Vis denne publikasjonen hos Cristin