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

Algorithm for the Incremental Augmenting Matching of Min-Distance Max-Quantity in 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.22, no.3, 2022 , pp. 177-183 More about this Journal
Abstract
There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n2) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(li,fj)} from li with minimum sum of distance in location matrix L and fj with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to li with minimum sum of distance and to fj with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n2) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.
Keywords
QAP; Random type; Maximum quantity; Mininum distance; Matching;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 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), pp. 106-117, 2006.
2 R. E. Burkard, S. E. Karisch, and F. Rendl, "QAPLIB-A Quadratic Assignment Problem Library," European Journal of Operational Research, Vol. 55, No. 1, pp. 115-119, Nov. 1991, https:// doi.org/10.1016/0377-2217(91)90197-4   DOI
3 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, https://doi.org/10.1016/j.ejor.2005.09.032   DOI
4 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, https:// doi.org/10.1016/j.cie.2008.01.018   DOI
5 L. Steinberg, "The Backboard Wiring Problem: A Placement Algorithm," SIAM Review, Vol. 3, No. 1, pp. 37-50, Jan. 1961, https://doi.org/ 0.1137/1003003   DOI
6 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, https://doi.org/10.1016/j.cie.2004.07.001   DOI
7 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.
8 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, https://doi.org/10.1016/S0951-5240(98)00018-4   DOI
9 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, https://doi.org/10.1145/ 1570256.1570355   DOI
10 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, https:// doi.org/10.1016/0360-8352(94)90049-3   DOI
11 S. Jannat, A. A. Khaled, and S. K. Paul, "Optimal Solution for Multi-Objective Facility Layout Problem Using Genetic Algorithm," Proceedings of the International Conference on Industrial Engineering and Operations Management, Dhaka, Bangladesh, pp. 1-10, Jan. 2010.
12 S. U. Lee, "The Random Type Quadratic Assignment Problem Algorithm," Journal of The Korea Society of Computer and Information, Vol. 21 No. 4, pp. 81-88, Apr. 2016, https:// doi.org/10.9708/jksci.2016.21.4.081   DOI
13 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, https://doi.org/10.5281/ zenodo.1086693   DOI
14 A. N. Elshafei, "Hospital Layout as a Quadratic Assignment Problem," Operations Research Quarterly, Vol. 28, No. 1, pp. 167-179, Mar. 1977, https://doi.org/10.1057/jors.1977.29   DOI
15 P. A. Jensen and J. F. Bard, "Operations Research Models and Methods, Section 7.4 Facility Location Problem," John Wiley and Sons. 2003.