Home > Research > Publications & Outputs > A Constructive Heuristic Approach for Single Ai...

Electronic data

  • paper_175

    Rights statement: ©2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 421 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A Constructive Heuristic Approach for Single Airport Slot Allocation Problems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
  • S. Wang
  • J.H. Drake
  • J. Fairbrother
  • J.R. Woodward
  • IEEE; IEEE Computational Intelligence Society
Close
Publication date20/02/2020
Host publication2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
PublisherIEEE
Pages1171-1178
Number of pages8
ISBN (electronic)9781728124858
ISBN (print)9781728124865
<mark>Original language</mark>English

Abstract

With growth in air transportation expected to continue, the mitigation of operational inefficiency and consequent delays is becoming increasingly important. Slot allocation, as a means of demand management at congested airports, has a significant impact on wider airport operations. This requires sophisticated approaches, to intelligently allocate scarce airport resources to unevenly distributed traffic demand for the use of airport facilities. This paper presents a novel heuristic approach to solve the single airport slot allocation problem. The approach has been tested on real-world data from three medium-sized airports. We introduce a constructive heuristic framework which is able to generate feasible solutions to the model. Within this framework, a number of ordering heuristics are developed to order slot requests to be scheduled, and an allocation algorithm is developed to allocate slots to a request determined by the ordering heuristic. Experimental results suggest that the order in which slot requests are scheduled has a significant impact on the solution quality.

Bibliographic note

©2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.