The strategic airport slot allocation problem concerns the scheduling of airlines’ requests for landings and take-offs at congested airports for a series of days within a given scheduling season. Relevant scheduling models dealing with the strategic airport slot allocation problem have employed various combinations of the total schedule displacement criterion with several variations of acceptability metrics. However, most variations of schedule displacement pursued in existing literature do not thoroughly capture the real-world scheduling practice, and, most importantly, do not guarantee the allocation of acceptable/tolerable or viable displacement among competing airlines’ slot requests. Α novel hybrid heuristic algorithm integrating the Objective Feasibility Pump (FP) algorithm
with the Large Neighborhood Search technique (LNS) is proposed.
Collected and summarized from the source below by Minh Pham https://db.vista.gov.vn:2095/science/article/abs/pii/S0377221719309920