Author:
Kumar Pradeep,Sharma Shambhu
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.
Subject
General Physics and Astronomy
Reference29 articles.
1. A data-guided lexisearch algorithm for the quadratic assignment problem;Ahmed;Indian journal of Science and Technology,2014
2. A branch-and-bound based heuristic for solving the quadratic assignment problem;Bazara;Naval Research Logistics (NRL),1983
3. On the use of exact and heuristic cutting plane methods for the quadratic qssignment problem;Bazara;The Journal of Operational Research Society,1982
4. An exact branch and bound procedure for quadratic assignment problems;Bazara;Naval Research Logistics Quarterly,1979
5. A quadratic assignment problem solved by simulated annealing;Bose;Journal of Environmental Management,1993