Abstract
Variants of QAP have become the hot lines in research on NP-Hard combinatorial optimization problems. There exists a new kind of problem which can’t be modeled as QAP or its existing variants, in applications such as hospital layout whose facility must be assigned to one location in some predefined subset. This new problem is modeled as the subset QAP (SQAP) in this paper. We show that SQAP is NP-Hard and no ε – approximation algorithm exists for it (ε > 0). Furthermore, we prove that it can be determined in polynomial time whether a feasible solution exists or not, by proving its equivalence to perfect matching problem on bipartite graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)
Eliane, M.L., Nair, M.M.A., Paulo, O.B.N., Peter, H., Tania, Q.: An analytical survey for the quadratic assignment problem. European Journal Operational Research 176(2), 657–690 (2007)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
Zou, P., Zhou, Z., Chen, G.L., Jiang, H., Gu, J.: Approximate-Backbone guided fast ant algorithms to QAP. Journal of Software 16(10), 1691–1698 (2005)
Gambardella, L., Taillard, E.D., Dorigo, M.: Ant colonies for the QAP. Journal of the Operations Research Society (1999)
Nissen, V.: Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Networks 5(1), 66–72 (1994)
Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. Informs Journal on Computing 15(3), 320–330 (2003)
Tsuchiya, K., Nishiyama, T., Tsujita, K.: A deterministic annealing algorithm for a combinatorial optimization problem using replicator equations. Physica D: Nonlinear Phenomena 149(3), 161–173 (2002)
Ishii, S., Sato, M.: Doubly constrained network for combinatorial optimization. Neurocomputing 43(4), 239–257 (2002)
Misevicius, A.: A modification of tabu search and its applications to the quadratic assignment problem. Information Technology and Control 27, 12–20 (2003)
Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. European Journal of Operational Research 160, 416–422 (2005)
Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the QAP. In: MIC 2003: The Fifth Metaheuristics International Conference (2003)
Burkard, R.E., Çela, E., Klinz, B.: On the biquadratic assignment problem. In: Pardalos, P.M., et al. (eds.) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 117–146. AMS, Rhode Island (1994)
Burkard, R.E.: Selected topics on assignment problems. Discrete Applied Mathematics 123(3), 257–302 (2002)
Knowles, J.D., Corne, D.W.: Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. In: Abraham, A., et al. (eds.) Soft Computing Systems: Design, Management and Applications, pp. 271–279. IOS Press, Amsterdam (2002)
Knowles, J.D., Corne, D.W.: Instance generators and test suites for the multiobjective quadratic assignment problem. IRIDIA technical report TR/IRIDIA/2002-25
Chi-Guhn, L., Zhong, M.: The generalized quadratic assignment problem. Department of Mechanical and Industrial Engineering, University of Toronto, working paper (2003)
Billionnet, A., Elloumi, S.: Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics 109(3), 197–213 (2001)
Hahn, P.M., Kim, B.J., Hightower, W.L., Stützle, T., Kanthak, S., Samra, H., Ding, Z., Guignard, M.: The quadratic three-dimensional assignment problem: exact and heuristic solution methods. OPIM Working Report No. 04-08-02, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania, USA (2004)
Eiselt, H.A., Laporte, G.: A combinatorial optimization problem arising in dartboard design. Journal of the Operational Research Society 42, 113–118 (1991)
Christian, S., Karl, D., Axel, F., Kurt, H.: Determining location and size of medical departments in a hospital network: a multiobjective decision support approach. Health Care Management Science 7, 63–71 (2004)
Potte, J.G., Kaiser, J.W.: Wireless integrated network sensors. In: Proc. of Communications of the ACM, New York, USA, pp. 551–558 (2000)
Akyildiz, I.F., Kasimoglu, I.H.: Wireless sensor and actor networks: research challenges. Ad Hoc Networks 2, 351–367 (2004)
Edmonds, J.: Matching and a polyhedron with 0-1 vertices. J. Res. NBS 69B, 125–130 (1965)
Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 225–231 (1973)
Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing maximum cardinality matching in time \( O(|{V}|^{1.5}\sqrt{|E|/log|V|}) \). Information Process Letters 37, 237–240 (1991)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, H., Hu, Y. (2012). Subset Quadratic Assignment Problem. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds) Advanced Research in Applied Artificial Intelligence. IEA/AIE 2012. Lecture Notes in Computer Science(), vol 7345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31087-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-31087-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31086-7
Online ISBN: 978-3-642-31087-4
eBook Packages: Computer ScienceComputer Science (R0)