Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.4.091

The Grid Type Quadratic Assignment Problem Algorithm  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.4, 2014 , pp. 91-99 More about this Journal
Abstract
TThis paper suggests an heuristic polynomial time algorithm to solve the optimal solution for QAP (quadratic assignment problem). While Hungarian algorithm is most commonly used for a linear assignment, there is no polynomial time algorithm for the QAP. The proposed algorithm derives a grid type layout among unit distances of a distance matrix. And, we apply max-flow/min-distance approach to assign this grid type layout in such a descending order way that the largest flow is matched to the smallest unit distance from flow matrix. Evidences from implementation results of the proposed algorithm on various numerical grid type QAP examples show that a solution to the QAP could be obtained by a polynomial algorithm.
Keywords
LAP; QAP; NP-complete; Max-flow/Min-distance; Grid type;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 A. N. Elshafei, "Hospital Layout as a Quadratic Assignment Problem," Journal of the Operational Research Society, Vol. 28, pp. 167-179, Apr. 1977.   DOI
2 B. Rainer, M. Dell'Amico, and S. Martello, "Assignment Problems," SIAM, 2009.
3 D. N. Kumar, "Optimization Methods," http://www.nptel.iitm.ac.in/Courses/Webcourse-contents/IISc-BANG/OPTIMIZATIONMETHODS/pdf/Module_4/M4L3_LN.pdf, IISc, Bangalore, 2008.
4 E. M. Loiola, N. M. M. Abreu, P. O. Boaventura-Netto, P. Hahn, and T. Querido, "A Survey of the Quadratic Assignment Problem," European Journal of Operational Research, Vol. 176, No. 2, pp. 657-690, Jan. 2007.   DOI   ScienceOn
5 P. Ji, Y. Wu, and H. Liu, "A Solution Method for the Quadratic Assignment Problem (QAP)," The 6th International Symposium on Operations Research and Its Applications (ISORA'06), Xinjiang, China, pp. 106-117, Aug. 2006.
6 L. Steinberg, "The Backboard Wiring Problem: A Placement Algorithm," SIAM Review, Vol. 3, No. 1, pp. 37-50, Jan. 1961.   DOI   ScienceOn
7 H. W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, Vol. 2, No. 1-2, pp. 83-97, Mar. 1955.   DOI
8 R. E. Burkard, S. E. Karisch, and F. Rendl, "QAPLIB-A Quadratic Assignment Problem Library," http://www.seas.upenn.edu/ qaplib/, Journal of Global Optimization, Vol. 10, No. 4, pp. 391-403, Jun. 1997.   DOI
9 P. M. Pardolas and J. V. Crouse, "A Parallel Algorithm for the Quadratic Assignment Problem," Proceedings of the ACM/IEEE Conference on Supercomputing, pp. 351-360, Nov. 1989.
10 S. U. Lee, "A Reverse-delete Algorithm for Assignment Problem," Journal of Korean Institute of Information Technology, Vol. 10, No. 8, pp. 117-126, Aug. 2012.
11 S. U. Lee, "The Optimal Algorithm for Assignment Problem," Journal of The Korea Society of Computer and Information, Vol. 17, No. 9, pp. 139-147, Sep. 2012.   과학기술학회마을   DOI   ScienceOn
12 A. A. Assad and W. Xu, "On Lower Bounds for a Class of Quadratic {0,1} Programs," Operations Research Letters, Vol. 4, No. 4, pp. 175-180, Dec. 1985.   DOI   ScienceOn