Aircraft Landing Scheduling in the Small Aircraft Transportation System

摘要

Aircraft Scheduling in terminal areas is the key technology for diminishing delay and cost. Especially in SATS (Small Aircraft Transportation System), without the guidance of ATC (Air Traffic Control), efficiency is hard to reach. Considering diversity of aircrafts in SATS, traditional approaches to solve these problems, such as CPS (Constraint Position Switch) is not available. Promote to sequence aircrafts based on flying ability, and improve genetic algorithm by introduce local fitness value, using it as optimize function. Also, take vortex and conflict-free as the constraint. A potential algorithm is introduced to de-conflict for its ability to cover all possible conflict scenarios involving multiple agents. As a dynamic system, the cost of resolve conflict during the approach will feed back to the system to rescheduling. Simulation shows, a conflict-free sequence with lower delay is reached. Besides, the improved algorithm is more directive and convergence quickly, accelerating solving process. It can meet the application's needs in real-time.