Abstract
The quadratic assignment problem deals with the arrangement of facilities in plants for minimizing the communication cost among the facilities. This problem is one of the focal problems both in academia and industry, absorbing the attention of researchers for more than five decades. Having a variety of applications, this problem has still no effective exact solution strategy, as the number of possible feasible solutions, even for medium-sized problems, is extremely large. This makes effective heuristics as the only viable solution strategy for this problem. In this paper, a technique is presented which aims at achieving local minimization through refining layouts structurally. For this purpose, the technique uses an efficient linear assignment technique, and enhances layouts based on the feedback provided. The results of extensive computational experiments on different benchmark instances indicate that the procedure is both robust and efficient.
The PhD scholarship awarded by SMART infrastructure facility, University of Wollongong, to Dr Mehrdad Amirghasemi facilitated the research reported in this paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
https://asteroidsathome.net/boinc/cpu_list.php (Intel(R) Core(TM) i7 CPU 870 @ 2.93Â GHz).
References
Ahuja, R., Jha, K., Orlin, J., Sharma, D.: Very large-scale neighborhood search for the quadratic assignment problem. INFORMS J. Comput. 19(4), 646–657 (2007)
Anstreicher, K., Brixius, N., Goux, J., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91(3), 563–588 (2002)
Battiti, R., Tecchiolli, G.: Simulated annealing and tabu search in the long run: a comparison on QAP tasks. Comput. Math. Appl. 28(6), 1–8 (1994)
Baykasoglu, A.: A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J. Intell. Manuf. 15(6), 753–759 (2004)
Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391–403 (1997)
Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1–21 (1996)
Connolly, D.T.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93–100 (1990)
Crainic, T.G., Cun, B.L., Roucairol, C.: Parallel branch-and-bound algorithms. In: Zomaya, A.Y., Talbi, E. (eds.) Parallel Combinatorial Optimization Chap. 1, pp. 1–28. Wiley, Hoboken (2006). https://doi.org/10.1002/9780470053928.ch1
Demirel, N., Toksar, M.: Optimization of the quadratic assignment problem using an ant colony algorithm. Appl. Math. Comput. 183(1), 427–435 (2006)
Drezner, Z.: Heuristic algorithms for the solution of the quadratic assignment problem. J. Appl. Math. Decis. Sci. 6, 163–173 (2002)
Drezner, Z.: Compounded genetic algorithms for the quadratic assignment problem. Oper. Res. Lett. 33(5), 475–480 (2005)
Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. 15(3), 320–330 (2003)
Drezner, Z.: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput. Oper. Res. 35(3), 717–736 (2008)
Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167–176 (1999)
James, T., Rego, C., Glover, F.: Multistart Tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum. 39(3), 579–596 (2009)
Kelley, C.T.: Solving Nonlinear Equations with Newton’s Method. SIAM (2003)
Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica: J. Econometr. Soc. 25(1), 53–76 (1957)
Kuhn, H.: The Hungarian method for the assignment problem. Naval Res. Logist. 2, 83–97 (1952)
Lee, Y., Orlin, J.: Quickmatch: a very fast algorithm for the assignment problem. Report, Sloan School of Management, Massachusetts Institute of Technology (Report number: WP# 3547–93) (1993)
Loiola, E.M., De Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007)
Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng. 11(5), 769–778 (1999)
Matai, R., Singh, S., Mittal, M.: A non-greedy systematic neighbourhood search heuristic for solving facility layout problem. Int. J. Adv. Manuf. Technol. 68, 1665–1675 (2013)
Mavridou, T., Pardalos, P.: Simulated annealing and genetic algorithms for the facility layout problem: a survey. Comput. Optim. Appl. 7(1), 111–126 (1997)
Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Comput. Optim. Appl. 30(1), 95–111 (2005)
Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 356–368. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24838-5_27
Rego, C., James, T., Glover, F.: An ejection chain algorithm for the quadratic assignment problem. Networks 56(3), 188–206 (2010)
Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM (JACM) 23(3), 555–565 (1976)
Silva, R., Resende, M., Pardalos, P., Mateus, G., De Tomi, G.: Grasp with path-relinking for facility layout. In: Goldengorin, B., Kalyagin, V., Pardalos, P. (eds.) Models, Algorithms, and Technologies for Network Analysis, vol. 59, pp. 175–190. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-8588-9_11
Solimanpur, M., Vrat, P., Shankar, R.: Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur. J. Oper. Res. 157(3), 592–606 (2004)
Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4), 443–455 (1991)
Taillard, E.: FANT: fast ant system. Technical report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale (1998)
Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441–449 (2001)
Voß, S.: Solving quadratic assignment problems using the reverse elimination method. In: Nash, S.G., Sofer, A., Stewart, W.R., Wasil, E.A. (eds.) The Impact of Emerging Technologies on Computer Science and Operations Research, pp. 281–296. Kluwer, Dordrecht (1995). https://doi.org/10.1007/978-1-4615-2223-2_14
Votaw, D.F., Orden, A.: The personnel assignment problem. In: Symposium on Linear Inequalities and Programming, pp. 155–163 (1952)
Zhang, H., Beltran-Royo, C., Constantino, M.: Effective formulation reductions for the quadratic assignment problem. Comput. Oper. Res. 37(11), 2007–2016 (2010)
Zhang, H., Beltran-Royo, C., Ma, L.: Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Ann. Oper. Res. 207, 261–278 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Amirghasemi, M., Zamani, R. (2018). An Effective Structural Iterative Refinement Technique for Solving the Quadratic Assignment Problem. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-00898-7_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00897-0
Online ISBN: 978-3-030-00898-7
eBook Packages: Computer ScienceComputer Science (R0)