A Computationally Simplified Pair-Exchange Algorithm for the Quadratic Assignment Problem
CENTER FOR NAVAL ANALYSES ALEXANDRIA VA ALEXANDRIA
Pagination or Media Count:
Recently, considerable interest has been generated in efficient quadratic assignment problem algorithms as a result of computer-aided design automation system projects. Currently available QAP algorithms can be characterized as being computationally complex and requiring medium to large scale computers for implementation. Computer-aided design applications, however, are frequently centered around small process control computers with limited available memory so that the more sophisticated QAP procedures cannot be used. The paper presents a computationally simplified pair-exchange algorithm which has proven to be comparable with the currently available QAP algorithm and which is implementable on a small computer. A CDC 3800 FORTRAN 4 subroutine listing is included.