Airline Scheduling Model Using Genetic Algorithm

Airline scheduling, the backbone of airline expansion and survival, faces a monumental challenge: finding the opti-mal flight schedule among countless possibilities under numerous constraints. This nondeterministic polynomial time (NP problem) demands innovative solutions. This paper proposes a genetic algorithm approach to build feasible daily schedules and assign optimal aircraft for hub-and-spoke airlines. The model delivers near-optimal solutions suitable for practical implementation, demonstrating the effectiveness of the genetic approach.