航班恢复规划的数学建模

The Mathematical Model on Flight Recovery Planning

针对第十四届全研究生数学建模竞赛C题的航班恢复规划问题展开研究，将多机场问题简化为双机场航班重排问题，研究了中枢机场应急关闭之后航班的规划．首先，建立了单一机型的航班恢复模型，通过飞机置换使该机型航班航班延误总时间最小．然后，弓l入多机型及不同机型交换成本，建立多机型，双机场的类时空网络模型，并引入航班串的概念，进一步减小航班重排后的整体延误时间．最后，增加旅客总体延误时间的考虑．进一步考虑航班之间不同机型交换带来的影响，将计划起飞时间位于18：00到22：30的航班，在21：00到22：30时间段中进行重新排列．通过Lingo计算包括航班延误，航班取消和飞机置换的方法所有航班的最小化延误．

According to C problem in 14th National Graduate Mathematicl Contest, this paper aims at the study of the flight recovery planning, this problem can be simplified as flight rearrangement between double airport, studying the central airport emergency shut down flight planning. Firstly, a single model flight recovery model is established, and the total time delay of the flight can be minimized by the replacement of the aircraft. Secondly, we introduce multiple airplane model and the cost because of changing of different types of airplane. Dual airport class space-time network model and concept of flight strings also be introduced in to further reduce the overall delay time after flight rearrangement. Finally, considering the total delay time of the numbers of passengers. We will further consider the impact of different types of flights between flights and different types of airplane. The flight scheduled to take off from 18：00 to 22：30 will be rearranged between 21：00 and 22：30. The Lingo calculation includes flight delays, flight cancellations and flight replacement methods to minimize delays in all flights.