Research on MPS Optimization to Landing Schedule Problem
飞机着陆调度问题的MPS优化算法研究

This paper presents an efficient optimization algorithm and complicated code for Airciraft Landing Scheduling Problem,Based on Depth-first-search implicit emumeration algorithm,subject to MPS limiting,position lock limiting and optimization depth limiting. This algorithm can apply to any real complicated ATC enviroment with flexible goal cost function,and static or dynamic real-time ATC automation system,to minimize traffic delay and improve landing capacity.