liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Integer Programming-Based Airspace Sectorization for Terminal Maneuvering Areas with Convex Sectors
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-5868-2388
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2019 (English)In: Journal of Air Transportation, E-ISSN 2380-9450, Vol. 27, no 4Article in journal (Refereed) Published
Abstract [en]

In this paper an airspace sectorization framework for terminal maneuvering areas based on mixed integer programming is presented. It incorporates an airspace complexity representation, as well as various constraints on the sectors’ geometry, for example, the requirement that points demanding increased attention from air traffic controllers should lie in the sector’s interior to allow for enough time to resolve possible conflicts. The method can enforce convex sectors. In contrast to earlier integer/constraint programming approaches, which used synthesis methods with variables per elementary airspace piece that were glued together to form sectors, the integer programming formulation uses a variable per potential edge on the sector boundary. It is also the first step toward an integrated design of routes, the resulting complexity, and a sectorization. This paper presents results for Stockholm Arlanda airport and compares the integer programming results to convex sectorizations obtained by enumerating all possible topologies for a given number of sectors. This yields a proof-of-concept for the application of this highly flexible approach to terminal maneuvering areas.

Place, publisher, year, edition, pages
American Institute of Aeronautics and Astronautics, 2019. Vol. 27, no 4
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:liu:diva-161306DOI: 10.2514/1.D0148OAI: oai:DiVA.org:liu-161306DiVA, id: diva2:1366102
Available from: 2019-10-28 Created: 2019-10-28 Last updated: 2019-11-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Andersson Granberg, TobiasPolishchuk, TatianaPolishchuk, ValentinSchmidt, Christiane

Search in DiVA

By author/editor
Andersson Granberg, TobiasPolishchuk, TatianaPolishchuk, ValentinSchmidt, Christiane
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 5 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf