A New Genetic Algorithm for the Quadratic Assignment Problem

References

• Ahuja R. K., Orlin J. B., Tiwari A. A descent genetic algorithm for the quadratic assignment problem. Computers and Oper. Res. (2000) 27:917–934Crossref, Google Scholar
• Armour G. C., Buffa E. S. A heuristic algorithm and simulation approach to relative location of facilities. Management Sci. (1963) 9:294–309Link, Google Scholar
• Battiti R., Tecchiolli G. The reactive tabu search. ORSA J. on Computing (1994) 6:126–140Link, Google Scholar
• Burkard R. E., Mirchandani P. B., Francis R. L. Locations with spatial interactions: The quadratic assignment problem. Discrete Location Theory (1990) (Wiley, Berlin, Germany) Google Scholar
• Burkard R. E., Rendl F. A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur. J. of Oper. Res. (1984) 17:169–174Crossref, Google Scholar
• Cela E.The Quadratic Assignment Problem: Theory and Algorithms (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Drezner Z. Heuristic algorithms for the solution of the quadratic assignment problem. J. of Appl. Math. and Decision Sci. (2002) 6:163–173Google Scholar
• Drezner Z., Salhi S. Using metaheuristics for the one-way and two-way network design problem. Naval Res. Logist. (2002) Crossref, Google Scholar
• Eschermann B., Wunderlich H. J. Optimized synthesis of self-testable finite state machines. (1990) . 20th Internat. Sympos. On Fault-Tolerant Comput. (FFTCS 20), Newcastle upon Tyne, U.KCrossref, Google Scholar
• Fleurent C., Ferland J. A., Pardalos P., Wolkowicz H. Genetic hybrids for the quadratic assignment problem. Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) 16:173–187Crossref, Google Scholar
• Gambardella L., Taillard E., Dorigo M. Ant colonies for the quadratic assignment problem. J. of the Oper. Res. Soc. (1999) 50:167–176Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston MA) Crossref, Google Scholar
• Goldberg D. E.Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Wokingham, U.K) Google Scholar
• Krarup J., Pruzan P. M. Computer-aided layout design. Mathematical Programming Studies (1978) 9:75–94Crossref, Google Scholar
• Li Y., Pardalos P. M., Resende M., Pardalos P., olkowicz H. A descent randomized adaptive search procedure for the quadratic assignment problem. Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) 16:237–261Google Scholar
• Nugent C. E., Vollman T. E., Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. (1968) 16:150–173Link, Google Scholar
• Radcliffe N. J., Fogarty T. Formal memetic algorithms. Evolutionary Computing. Springer Lecture Notes in Computer Science (1994) 865:250–263Crossref, Google Scholar
• Salhi S., Marcoulides G. Heuristic search methods. Modern Methods for Business Research (1998) (Lawrence Erlbaum Associates, Mahwah, NJ) 147–175Google Scholar
• Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J. on Comput. (1990) 2:33–45Link, Google Scholar
• Steinberg L. The backboard wiring problem: A placement algorithm. SIAM Rev. (1961) 3:37–50Crossref, Google Scholar
• Taillard E. D. Robust tabu search for the quadratic assignment problem. Parallel Comput. (1991) 17:443–455Crossref, Google Scholar
• Taillard E. D. Comparison of iterative searches for the quadratic assignment problem. Location Sci. (1995) 3:87–105Crossref, Google Scholar
• Tate D. M., Smith A. E. A genetic approach to the quadratic assignment problem. Comput. and Oper. Res. (1995) 22:73–83Crossref, Google Scholar
• Thonemann U. W., Bolte A. An improved simulated annealing algorithm for the quadratic assignment problem. (1994) . Working paper, School of Business, Department of Production and Operations Research, University of Paderborn, GermanyGoogle Scholar
• Wilhelm M. R., Ward T. L. Solving quadratic assignment problems by simulated annealing. IIE Trans. (1987) 19:107–119Crossref, Google Scholar