空中交通地面等待问题的网络流规划模型

Network Programming Algorithms for Ground -Holding Strategy Problem

在将网络流方法应用于解决空中交通流量管理问题中 ,由于其形象直观和求解简单 ,因而倍受国内外学者的关注 .本文针对确定容量条件下的单机场地面等待策略问题 ,研究了简单网络流规划方法 ,建立了数学模型和网络流规划模型 .在简单网络模型的基础上 ,考虑更多的实际约束 ,改进成本函数 ,建立了修正的网络流规划模型 ,并对冲突航班算例进行仿真 。

The network programming algorithms for ground holding strategy problem of single airport have been researched in this paper. The simple network programming models are developed and a new network program algorithm based on network model is studied. Considering more restrictions of flight schedule and cost functions, the ameliorated network model is built. The reality of the model and method presented by this paper is verified by the simulation result.