Allocation of flights to land at the terminals of an airport. (January 2021)

• Record Type: Journal Article
• Authors: Kumar, Pradeep; Sharma, Shambhu
• Is Part Of: Journal of physics. Volume 1714(2020)
• Publication Date: 2021-01
• Subjects: Allocation -- Flight -- Terminal -- Optimal Solution -- NP-hard; Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1714/1/012034
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: In this paper, an algorithm for solving flight landing problem has been developed to reduce the chaos at the airport. This algorithm starts with an initial basic feasible solution and then the algorithm works on the principle of steepest descent direction search method from current solution. The algorithm is easy to comprehend. The performance of this algorithm has been checked using a numerical example with known results. The flight landing problem is an application of Quadratic Assignment Problem. Since Quadratic Assignment Problem is NP- hard, it is quite tedious to get an optimal solution even for small size instances. However, as far as optimality of the solution is concerned, this algorithm leads to very favourable results.