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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
