Browse > Article
http://dx.doi.org/10.7236/JIIBC.2018.18.3.201

The Min-Distance Max-Quantity Assignment Algorithm for Random Type Quadratic Assignment Problem  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.18, no.3, 2018 , pp. 201-207 More about this Journal
Abstract
There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.
Keywords
Linear assignment problem; Quadratic assignment problem; Random type; Max-flow/min-distance; Concentration;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 E. M. Loiola, N. M. M. Abreu, P. O. Boaventura-Netto, P. Hahn, and T. Querido, "A Survey for the Quadratic Assignment Problem," European Journal of Operational Research, Vol. 176, No. 2, pp. 657-690, Jan. 2007. doi:10. 1016/j.ejor.2005.09.032   DOI
2 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), Xinjiang, China, pp. 106-117, 2006.
3 M. Solimanpur and A. Jafari, "Optimal Solution for the Two-dimensional Facility Layout Problem using a Branch-and-bound Algorithm," Journal of Computers and Industrial Engineering, Vol. 55, No. 3, pp. 606-619, Oct. 2008. doi:10.1016/j.cie. 008.01.018   DOI
4 I. Mihajlovic, Z. Zivkovic, N. Strbac, D. Zivkovic, and A. Jovanovic, "Using Genetic Algorithms to Resolve Facility Layout Problem," Serbian Journal of Management, Vol. 2, No. 1, pp. 35-46, Jan. 2007.
5 S. U. Lee, "A Reverse-Delete Algorithm for Assignment Problems," Journal of KIIT, Vol. 10, No. 8, pp. 117-126, Aug. 2012. uci:G704-001947.2012.10.8.007
6 S. U. Lee, "Assignment Problem Algorithm Using Dual-path Competition Method," Journal of KIIT, Vol. 13, No. 12, pp. 75-83, Dec. 2015. doi:10. 4801/jkiit.2015.13.12.75
7 L. Steinberg, "The Backboard Wiring Problem: A Placement Algorithm," SIAM Review, Vol. 3, pp. 37-50, Jan. 1961. doi:10.1137/1003003   DOI
8 A. N. Elshafei, "Hospital Layout as a Quadratic Assignment Problem," Operations Research Quarterly, Vol. 28, No. 1, pp. 167-179, Mar. 1977.   DOI
9 S. U. Lee, "The Grid Type Quadratic Assignment Problem Algorithm," Journal of KSCI, Vol. 19, No. 4, pp. 91-99, Apr. 2014. doi:/10.9708/jksci.2014.19.4.091
10 S. U. Lee, "The Random Type Quadratic Assignment Problem Algorithm," Journal of KSCI, Vol. 21, No. 4, pp. 81-88, Apr. 2016. doi:10. 9708/jksci.2016.21.4.081
11 K. C. Chan and H. Tansri, "A Study of Genetic Crossover Operations on the Facilities Layout Problem," Computers and Industrial Engineering, Vol. 26, No. 3, pp. 537-550, Jul. 1994. doi: 10.1016/0360-8352(94)90049-3   DOI
12 R. E. Burkard, S. E. Karisch, and F. Rendl, "QAPLIB-A Quadratic Assignment Problem Library," Journal of Global Optimization, Vol. 10, No. 4, pp. 391-403, Jun. 1997. doi:10.1023/A:1008293323270   DOI
13 S. Tsutsui and N. Fujimoto, "Solving Quadratic Assignment Problems by Genetic Algorithms with GPU Computation: a Case Study," Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, pp. 2523-2530, Jul. 2009. doi:10.1145/1570256.1570355
14 P. A. Jensen and J. F. Bard, "Operations Research Models and Methods, Section 7.4 Facility Location Problem," John Wiley and Sons. 2003. ISBN:0-471-38004-0
15 K. L. Mak, Y. S. Wong, and F. T. S. Chan, "A Genetic Algorithm for Facility Layout Problems," Computer Integrated Manufacturing Systems, Vol. 11, No. 1-2, pp. 113-127, Sep. 1998. doi:10. 1016/S0951-5240(98)00018-4   DOI
16 M. G. Misola and B. B. Navarro, "Optimal Facility Layout Problem Solution Using Genetic Algorithm," World Academy of Science, Engineering and Technology, Vol. 7, No. 8, pp. 545-550, Aug. 2013. doi:scholar.waset.org/1307-6892/16153
17 M. A. El-Baz, "A Genetic Algorithm for Facility Layout Problems of Different Manufacturing Environments," Computers & Industrial Engineering, Vol. 47, No. 2-3, pp. 233-246, Nov. 2004. doi:10.1016/j.cie.2004.07.001   DOI
18 S. Jannat, A. A. Khaled, and S. K. Paul, "Optimal Solution for Multi-Objective Facility Layout Problem Using Genetic Algorithm," International Conference on Industrial Engineering and Operations Management, Dhaka, Bangladesh, Jan. 2010.