Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study

References

• Armour GC, Buffa ES (1963) A heuristic algorithm and simulation approach to relative location of facilities. Management Sci. 9(2):294–309.Link, Google Scholar
• Benlic U, Hao J (2013) Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9):4800–4815.Crossref, Google Scholar
• Benlic U, Hao JK (2015) Memetic search for the quadratic assignment problem. Expert Systems Appl. 42(1):584–595.Crossref, Google Scholar
• Burkard RE (2013) The quadratic assignment problem. Pardalos PM, Du DZ, Graham RL, eds. Handbook of Combinatorial Optimization (Springer, New York), 2741–2814.Crossref, Google Scholar
• Burkard RE, Karisch SE, Rendl F (1997) QAPLIB—A quadratic assignment problem library. J. Global Optim. 10(4):391–403.Revised 02.04.2003 (electronic update): http://www.seas.upenn.edu/qaplib/.Crossref, Google Scholar
• Cela E (1998) The Quadratic Assignment Problem: Theory and Algorithms, Combinatorial Optimization, Vol. 1 (Springer, Boston).Crossref, Google Scholar
• Drezner Z (2005) The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160(2):416–422.Crossref, Google Scholar
• Drezner Z (2008a) Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput. Oper. Res. 35(3):717–736.Crossref, Google Scholar
• Drezner Z (2008b) Tabu search and hybrid genetic algorithms for quadratic assignment problems. Jaziri W, ed. Tabu Search (InTech, London), 89–108.Crossref, Google Scholar
• Drezner Z, Hahn P, Taillard ÉD (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1):65–94.Crossref, Google Scholar
• Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1):106–130.Crossref, Google Scholar
• James T, Rego C, Glover F (2009) A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3):810–826.Crossref, Google Scholar
• Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Proc. 6th Internat. Conf. Genetic Algorithms (Morgan Kaufmann, San Francisco), 184–192.Google Scholar
• Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53–76.Crossref, Google Scholar
• Kovac M (2013) Solving quadratic assignment problem in parallel using local search with simulated annealing elements. 2013 Internat. Conf. Digital Tech. (DT), Zilina, Slovakia, 18–20.Google Scholar
• Li Y, Pardalos PM, Ramakrishnan KG, Resende MGCM (1994) Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50(1):387–410.Crossref, Google Scholar
• Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2):657–690.Crossref, Google Scholar
• Murty KG (1988) Linear Complementarity, Linear and Non Linear Programming, Sigma Series in Applied Mathematics (Heldermann Verlag, Berlin).Google Scholar
• Oracle Labs (2016) Randomized decomposition project. Accessed August 1, 2017, https://labs.oracle.com/pls/apex/f?p=labs:49:::::P49_PROJECT_ID:141.Google Scholar
• Ramkumar A, Ponnambalam S, Jawahar N (2009) A population-based hybrid ant system for quadratic assignment formulations in facility layout design. Internat. J. Adv. Manufacturing Tech. 44(5–6):548–558.Crossref, Google Scholar
• Sahni S, Gonzalez T (1976) P-complete approximation problems. J. ACM 23(3):555–565.Crossref, Google Scholar
• Stutzle T (2006) Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3):1519–1539.Crossref, Google Scholar