A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The Quadratic Assignment Problem (QAP) is a well known combinatorial optimization problem with a diverse set of applications. It can be transformed into many problems such as the travelling salesman, weapon target assignment, and query optimization in distributed databases. Exhaustive search methods are inadequate to solve large data sets. Genetic algorithms and tabu search meta-heuristics may provide near optimal solutions for large QAP instances taking a reasonable time to complete. In thisdoi:10.1016/j.procs.2014.05.394 fatcat:guprzxrcpngn3py3uyfzlofw4y