Skip to main navigation Skip to search Skip to main content

Flying Safely by Bilevel Programming

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Preventing aircraft from getting too close to each other is an essential element of safety of the air transportation industry, which becomes ever more important as the air traffic increases. The problem consists in enforcing a minimum distance threshold between flying aircraft, which naturally results in a bilevel formulation with a lower-level subproblem for each pair of aircraft. We propose two single-level reformulations, present a cut generation algorithm which directly solves the bilevel formulation and discuss comparative computational results.

Original languageEnglish
Title of host publicationAIRO Springer Series
PublisherSpringer Nature
Pages197-206
Number of pages10
DOIs
Publication statusPublished - 1 Jan 2019

Publication series

NameAIRO Springer Series
Volume3
ISSN (Print)2523-7047
ISSN (Electronic)2523-7055

Keywords

  • Aircraft
  • Bilevel programming
  • Deconfliction

Fingerprint

Dive into the research topics of 'Flying Safely by Bilevel Programming'. Together they form a unique fingerprint.

Cite this