Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty

Management and scheduling of flights and assignment of gates to aircraft play a significant role in improving the procedure of the airport, due to the growing number of flights, decreasing the flight times. this research addresses assigning and scheduling of runways and gates in the main airport simultaneously. moreover, this research considers the unavailability of runway’s constraint and the uncertain parameters relating to both areas of runway and gate assignment. the proposed model is formulated as a comprehensive bi-level bi-objective problem.the leader’s objective function minimizes the total waiting time for runways and gates for all aircrafts based on their importance coefficient. meanwhile, the total distance traveled by all passengers in the airport terminal is minimized by a follower’s objective function. to solve the proposed model, the decomposition approach based on benders’ decomposition method is applied. empirical data are used to show the validation and application of our model. a comparison shows the effectiveness of the proposed model and its significant impact on cost decreasing.