Application of Local Search Algorithm with Constraint PositionShifting in Flight Scheduling

Flight scheduling is a critical issue in airport scheduling, and its effective resolution is of great significance for improving runway capacity and operational efficiency.To tackle this challenge, this paper proposes the ILS-CPS algorithm.The algorithm combines the flexibility and high efficiency of iterated local search to achieve both real-time and optimal flight scheduling.Additionally, by incorporating constrained positional shifts, it ensures the operability and fairness of the scheduling process.Experimental results demonstrate that, compared to the First-Come, First-Served (FCFS) method, the proposed algorithm significantly reduces the total delay time of the flight queue.Even with a large number of flights, it can still find a high-quality solution within a short time, indicating its practical applicability.