Citation

Lieder A, Stolletz R. Transp. Res. E Logist. Transp. Rev. 2016; 88: 167-188.

Copyright

(Copyright © 2016, Elsevier Publishing)

DOI

10.1016/j.tre.2016.01.015

PMID

unavailable

Abstract

This paper presents an optimization method for the aircraft scheduling problem with general runway configurations. Take-offs and landings have to be assigned to a runway and a time while meeting the sequence-dependent separation requirements and minimizing the costs incurred by delays. Some runways can be used only for take-offs, landings, or certain types of aircraft while schedules for interdependent runways have to consider additional diagonal separation constraints.

Our dynamic programming approach solves realistic problem instances to optimality within short computation times. In addition, we propose a rolling planning horizon heuristic for large instances that returns close-to-optimal results.