Genetic algorithm based on receding horizon control for real-time implementations in dynamic environments

This paper introduces the concept of Receding Horizon Control (RHC) to Genetic Algorithm (GA) for real-time implementations in dynamic environments. The methodology of the new GA is presented with the emphases on how to effectively integrate the RHC strategy by following some RHC practices in control engineering, particularly, how to choose the length of receding horizon and how to design terminal penalty. Simulation results show that, when the RHC based GA is applied in dynamic environments, both computational efficiency and performance are improved in comparison with existing GAs

Genetic algorithm based on receding horizon control for arrival sequencing and scheduling

The concept of Receding Horizon Control (RHC) is introduced into Genetic Algorithm (GA) in this paper to solve the problem of Arrival Scheduling and Sequencing (ASS) at a busy hub airport. A GA based method is proposed for solving the dynamic ASS problem, and the focus is put on the methodology of integrating the RHC strategy into the GA for real-time implementations in a dynamic environment of air traffic control (ATC). Receding horizon and terminal penalty are investigated in depth as two key techniques of this novel RHC based GA. Simulation results show that the new method proposed in this paper is effective and efficient to solve the ASS problem in a dynamic environment. Key words: Receding Horizon Control, Genetic Algorithm, Air Traffic Contr

Receding horizon control for aircraft arrival sequencing and scheduling.

Airports, especially busy hub airports, proved to be the bottleneck resources in the air traffic control system. How to carry out arrival scheduling and sequencing effectively and efficiently is one of main concerns to improve the safety, capacity, and efficiency of the airports. This paper introduces the concept of receding horizon control (RHC) to the problem of arrival scheduling and sequencing in a dynamic environment. The potential benefits RHC could bring in terms of airborne delay and computational burden are investigated by means of Monte Carlo simulations. It is pointed out that while achieving similar performance as existing schemes, the new arrival scheduling and sequencing scheme significantly reduces the computational burden and provides potential for developing new optimization algorithms for further reducing airborne delay