Ji Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ji Ma has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Delahaye
Lab ENAC, Ecole Nationale de l’Aviation Civile, Université de Toulouse, 31400 Toulouse, France
1 shared publication - Mohammed Sbihi
ENAC, Université de Toulouse, Toulouse, France
1 shared publication
Latest Publications
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 615-637
Optimization of departure runway scheduling incorporating arrival crossings
The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two integer linear programming models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first‐come‐first‐served rule. Moreover, SA has sufficiently small computation time for real‐time deployment.
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 615-637
Optimization of departure runway scheduling incorporating arrival crossings
The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two integer linear programming models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first‐come‐first‐served rule. Moreover, SA has sufficiently small computation time for real‐time deployment.