|
 
|
[FAYa14] Solving the Aircraft Landing Problem with time discretization approach
Revue Internationale avec comité de lecture : Journal European Journal of Operational Research, vol. 242(2015), pp. 1028-1038, 2014, (doi:10.1016/j.ejor.2014.10.064)Mots clés: Aircraft Landing Problem; Time discretization; Mixed Integer Programming; Dynamic constraint generation algorithm.
Résumé:
This paper studies the multiple runway aircraft landing problem. The aim is to schedule arriving aircraft to available runways at the airport. Landing times lie within predefined time windows and safety separation constraints between two successive landings must be satisfied. We propose a new approach for solving the problem. The method is based on an approximation of the separation time matrix and on time discretization. The separation matrix is approximated by a rank two matrix. This provides lower bounds or upper bounds depending on the choice of the approximating matrix. These bounds are used in a constraint generation algorithm to, exactly or heuristically, solve the problem. Computational tests, performed on publicly available problems involving up to 500 aircraft, show the efficiency of the approach.
Equipe:
oc
BibTeX
| @article { | |||
| FAYa14, | |||
| title | = | "{Solving the Aircraft Landing Problem with time discretization approach}", | |
| author | = | "A. Faye", | |
| journal | = | "European Journal of Operational Research", | |
| year | = | 2014, | |
| volume | = | 242, | |
| number | = | 2015, | |
| pages | = | "1028-1038", | |
| doi | = | "10.1016/j.ejor.2014.10.064", | |
| } | |||
