Indian Journal of Science and Technology
Year: 2013, Volume: 6, Issue: 4, Pages: 1-10
Zakir Hussain Ahmed
Department of Computer Science, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), P.O. E-mail: [email protected]
In this paper, we consider the quadratic assignment problem (QAP), one of the hardest NP-hard combinatorial optimization problems. We first present a new reformulation of the problem. Then a Lexisearch Algorithm (LSA) is developed for obtaining exact optimal solution to the problem. Finally, a comparative study has been carried out to show the efficiency of the algorithm against an existing algorithm for some medium sized instances from the quadratic assignment problem library, QAPLIB. The comparative study shows the efficiency of the proposed LSA based on the reformulation.
Keywords: Quadratic Assignment Problem, NP-hard, Reformulation, Exact Algorithm, Lexisearch, Alphabet Table, Bound.
Subscribe now for latest articles and news.