Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways |
| |
| Affiliation: | 1. School of Aeronautics and Astronautics, Purdue University, West Lafayette, Indiana 47907, USA;2. Department of MIS, Operations Management and Decision Sciences, University of Dayton, Dayton, Ohio 45469, USA;1. Department of Operations & Information Management, Isenberg School of Management, University of Massachusetts, Amherst, MA 01003, USA;2. Mario J. Gabelli School of Business, Roger Williams University, One Old Ferry Road, Bristol, RI 02809, USA |
| |
| 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. |
| |
| Keywords: | Airport operations Aircraft scheduling problem Discrete optimization Mixed-integer programming Dynamic programming Rolling planning horizon |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
