Abstract
In this paper we present different exact and heuristic optimization methods for scheduling planes which want to land (and start) at an airport - the Aircraft Sequencing Problem (ASP). We compare two known integer programming formulations with four new exact and heuristic solution methods regarding quality, speed and flexibility. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Fahle, T., Feldmann, R., Götz, S., Grothklags, S., & Monien, B. (2003). The aircraft sequencing problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2598, 152–166. https://doi.org/10.1007/3-540-36477-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free