Heuristics and meta-heuristics for runway scheduling problems

Document Type

Article

Publication Title

International Series in Operations Research and Management Science

Publication Date

1-1-2016

Abstract

This chapter addresses the state-of-the-art heuristic and meta-heuristic approaches for solving aircraft runway scheduling problem under variety of settings. Runway scheduling has been one of the emerging challenges in air traffic control as the congestion figures continue to rise. From a modeling point of view, mixed-integer programming formulations for single and multiple dependent and independent runways are presented. A set partitioning reformulation of the problem is demonstrated which suggests development of a column generation scheme. From a solution methodology viewpoint, generic heuristic algorithms, optimization-based approaches, and a dynamic programming scheme within the column generation algorithm are presented. Common meta-heuristic approaches that model variant problem settings under static and dynamic environments are discussed.

Volume

236

First Page

141

Last Page

163

DOI

10.1007/978-3-319-26024-2_8

ISSN

08848289

Funding Number

SCOPUS_ID:84956511164

This document is currently not available here.

Share

 
COinS