JOURNAL BROWSE
Search
Advanced SearchSearch Tips
The Random Type Quadratic Assignment Problem Algorithm
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
The Random Type Quadratic Assignment Problem Algorithm
Lee, Sang-Un;
  PDF(new window)
 Abstract
The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.
 Keywords
LAP;QAP;NP-complete;Max-flow/Min-distance;Mesh type;Random type;
 Language
Korean
 Cited by
 References
1.
C. W. Commander, "A Survey of the Quadratic Assignment Problem, with Applications," European Journal of Operational Research, Vol. 176, Issue. 2, pp. 657-690, 2007. crossref(new window)

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'06), Xinjiang, China, pp. 106-117, 2006.

3.
L. Steinberg, "The Backboard Wiring Problem: A Placement Algorithm," SIAM Review, Vol. 3, pp. 37-50, 1961. crossref(new window)

4.
A. N. Elshafei, "Hospital Layout as a Quadratic Assignment Problem," Operations Research Quartly, Vol. 28, pp. 167-179, 1977. crossref(new window)

5.
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, 1997. crossref(new window)

6.
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 (GECCO), pp. 2523-2530, 2009.

7.
E. Lawler, "Combinatorial Optimization: Networks and Matroids, 4.5. Combinatorial Implications of Max-Flow Min-Cut Theorem, 4.6. Linear Programming Interpretation of Max-Flow Min-Cut Theorem," Dover. pp. 117-120, 2001.

8.
S. U. Lee, "Maximum Capacity-based Minimum Cut Algorithm," Journal of Korea Society of Computer Information, Vol. 16, No. 5, pp. 153-162, May 2011.

9.
M. B. Choi and S. U. Lee, "A Minimum Cut Algorithm for Undirected Graph Using Maximum Adjacency Merging Method," Journal of the Institute of Internet, Broadcasting and Communication, Vol. 13, No. 1, pp. 143-152, Feb. 2013.

10.
P. A. Jensen and J. F. Bard, "Operations Research Models and Methods, Section 7.4 Facility Location Problem," http://www.me.utexas.edu/-jensen/ORMM/computation/unit/combin/qap.html, John Wiley and Sons. 2003.

11.
K. C. Chan and H. Tansri, "A Study of Genetic Crossover Operations on the Facilities Layout Problem," Computers and Industrial Engineering, Vol. 26, Issue. 3, pp. 537-550, 1994. crossref(new window)

12.
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, 1998. crossref(new window)

13.
M. A. El-Baz, "A Genetic Algorithm for Facility Layout Problems of Different Manufacturing Environments," Computers & Industrial Engineering, Vol. 47, pp. 233-246, 2004. crossref(new window)

14.
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, 2007.

15.
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, 2010.