Study of migration topology in parallel evolution algorithm for flight assignment

Abstract

Airspace congestion has become more and more serious in recent years due to the sharp increase of aircraft which has caused many unsafe factors and economic losses. Hence, how to assign flights to reduce congestion and delay has attracted much more attention. However, the flight assignment problem is very difficult to deal with it because in general has multiple objectives and involves in a large amount of flights. In this paper, we propose a new flight assignment method based on parallel evolution algorithm (PEA), which has great superiority for largescale complicated problem. Besides, a left–right probability migration topology is presented to further improve the optimization capability. Experiments on real data of the national route of China show that our method outperforms the current three flight assignment approaches. Moreover, the congestion and delay are effectively alleviated.