A Memetic Heuristic for the Generalized Quadratic Assignment Problem

Published Online:https://doi.org/10.1287/ijoc.1040.0128

References

  • Anstreicher K. M. Recent advances in the solution of quadratic assignment problems. Math. Programming (2003) 97:27–42CrossrefGoogle Scholar
  • Barr R. S., Golden B. L., Kelly J. P., Resende M. G. C., Stewart W. R. Designing and reporting on computational experiments with heuristic methods. J. Heuristics (1995) 1:9–32CrossrefGoogle Scholar
  • Burkard R. E., Çela E., Pardalos P. M., Pitsoulis L. S., Du D.-Z., Pardalos P. M. The quadratic assignment problem. Handbook of Combinatorial Optimization (1998) (Kluwer, Boston, MA) 241–337CrossrefGoogle Scholar
  • Connoly D. T. An improved annealing scheme for the qap. Eur. J. Oper. Res. (1990) 46:93–100CrossrefGoogle Scholar
  • Drezner Z. Heuristic algorithms for the solution of the quadratic assignment problem. J. Appl. Math. Decision Sci. (2002) 6:163–173Google Scholar
  • Drezner Z. A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. (2003) 15:320–330LinkGoogle Scholar
  • Fleurent C., Ferland J. A. Genetic hybrids for the quadratic assignment problem. DIMACS Ser. Math. Theoret. Comput. Sci. (1994) 16:190–206Google Scholar
  • Frieze A., Jadegar J. On the quadratic assignment problem. Discrete Appl. Math. (1983) 5:89–98CrossrefGoogle Scholar
  • Gambardella L. M., Taillard E. D., Dorigo M. Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. (1999) 50:167–176CrossrefGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
  • Gaudioso M., Chiodo A., Paese D. Un modello per la gestione degli spazi di piazzale per il terminale marittimo container di Gioia Tauro. (2001) . Tech. Rep. 1, Laboratorio di Logistica, Università della Calabria, Calabria, ItalyGoogle Scholar
  • Gaudioso M., Matteo R., Morrone G. Sviluppo di un sistema per l’analisi e la clusterizzazione dei servizi: SACS. (1999) . Tech. Rep. 3, Laboratorio di Logistica, Università della Calabria, Calabria, ItalyGoogle Scholar
  • Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13:533–549CrossrefGoogle Scholar
  • Holland J.Adaptation in Natural and Artificial Systems (1992) (The MIT Press, Cambridge, MA) CrossrefGoogle Scholar
  • Koopmans T. C., Beckmann M. J. Assignment problems and the location of economics activities. Econometrica (1957) 25:53–76CrossrefGoogle Scholar
  • Lee C., Ma Z. The generalized quadratic assignment problem. (2003) . Technical report, Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, CanadaGoogle Scholar
  • Li Y., Pardalos P. M., Resende M. G. C. A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Ser. Math. Theoret. Comput. Sci. (1994) 16:237–261CrossrefGoogle Scholar
  • Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24:1097–1100CrossrefGoogle Scholar
  • Moscato P., Cotta C., Glover F., Kochenberger G. A. A gentle introduction to memetic algorithms. Handbook of Metaheuristics (2003) (Kluwer, Boston, MA) 105–144CrossrefGoogle Scholar
  • Nugent E., Vollman T. E., Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. (1968) 16:150–173LinkGoogle Scholar
  • Padberg M. W., Rijal M. P.Location, Scheduling, Design and Integer Programming (1996) (Kluwer, Boston, MA) CrossrefGoogle Scholar
  • Rendl F., Drezner Z., Hamacher H. W. The quadratic assignment problem. Facility Location: Applications and Theory (2002) (Springer-Verlag, Berlin, Germany) 439–457CrossrefGoogle Scholar
  • Steinberg L. The backboard wiring problem: A placement algorithm. SIAM Rev. (1961) 3:37–50CrossrefGoogle Scholar
  • Taillard E. D. Robust taboo search for the quadratic assignment problem. Parallel Comput. (1991) 17:443–455CrossrefGoogle Scholar
  • Taillard E. D. Parallel iterative search methods for vehicle routing problems. Networks (1993) 23:661–673CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.