Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Zakir Hussain Ahmed (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: