An improved hybrid optimization algorithm for the quadratic assignment problem

References

• Aarts , E.H.L. and Korst , J.H.M. 1989 . Simulated Annealing and Boltzmann Machines , Chichester : Wiley .
   Google Scholar
• Aarts , E.H.L. , Korst , J.H.M. and van Laarhoven , RIM. 1997 . “ Simulated annealing ” . In Local Search in Combinatorial Optimization , Edited by: Aarts , E. and Lenstra , J.K. 91 – 120 . Chichester : Wiley .
   Google Scholar
• Amin , S. 1999 . Simulated jumping . Annals of Operations Research , 86 : 23 – 38 .
   Google Scholar
• Armour , G.C. and Buffa , E.S. 1963 . A heuristic algorithm and simulation approach to relative location of facilities . Management Science , 9 : 294 – 304 .
   Web of Science ®Google Scholar
• Battiti , R. and Tecchiolli , G. 1994 . The reactive tabu search . ORSA Journal on Computing , 6 : 126 – 140 .
   Google Scholar
• Boelte , A. and Thonemann , U.W. 1996 . Optimizing simulated annealing schedules with genetic programming . European Journal of Operational Research , 92 : 402 – 416 .
   Google Scholar
• Burkard , R.E. 1984 . Quadratic assignment problems . European Journal of Operational Research , 15 : 283 – 289 .
   Web of Science ®Google Scholar
• Burkard , R.E. , Çela , E. , Pardalos , P.M. and Pitsoulis , L. 1998 . “ The quadratic assignment problem ” . In Handbook of Combinatorial Optimization, , volume 3 , 241 – 337 . Dordrecht : Kluwer .
   Google Scholar
• Burkard , R.E. , Karisch , S. and Rendl , F. 1997 . QAPLIB‐a quadratic assignment problem library . Journal of Global Optimization , 10 : 391 – 403 .
   Web of Science ®Google Scholar
• Çela , E. 1998 . The Quadratic Assignment Problem: Theory and Algorithms , Dordrecht : Kluwer .
   Google Scholar
• Cern , V. 1982 . “ A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm ” . In Tech. Report, , Bratislava : Comenius University . CSSR
   Google Scholar
• Chen , H. and Flann , N.S. 1994 . Parallel simulated annealing and genetic algorithms: a space of hybrid methods . Proceedings of Third Conference on Parallel Problem Solving from Nature . 1994 , Berlin Springer, Jerusalem, Israel. pp. 428 – 436 .
   Google Scholar
• Connolly , D.T. 1990 . An improved annealing scheme for the QAP . European Journal of Operational Research , 46 : 93 – 100 .
   Web of Science ®Google Scholar
• Drezner , Z. 2002 . Heuristic algorithms for the solution of the quadratic assignment problem . Journal of Applied Mathematics and Decision Sciences , 6 : 163 – 173 .
   Google Scholar
• Drezner , Z. 2003 . A new genetic algorithm for the quadratic assignment problem . INFORMS Journal on Computing , (in press)
   Google Scholar
• Fleurent , C. and Ferland , JA. 1994 . “ Genetic hybrids for the quadratic assignment problem ” . In Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, , volume 16 , 173 – 188 . Providence : AMS .
   Google Scholar
• Fleurent , C. and Ferland , J.A. 1996 . Genetic and hybrid algorithms for graph coloring . Annals of Operations Research , 63 : 437 – 461 .
   Web of Science ®Google Scholar
• Fox , B.L. 1993 . Integrating and accelerating tabu search, simulated annealing and genetic algorithms . Annals of Operations Research , 41 : 47 – 67 .
   Google Scholar
• Freisleben , B. and Merz , P. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems . Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC ‘96) . pp. 616 – 621 . Nagoya, Japan
   Google Scholar
• Glover , F. 1989 . Tabu search: part I . ORSA Journal on Computing , 1 : 190 – 206 .
   Google Scholar
• Glover , F. 1990 . Tabu search: part II . ORSA Journal on Computing , 2 : 4 – 32 .
   Google Scholar
• Glover , F. and Laguna , M. 1997 . Tabu search , Dordrecht : Kluwer .
   Google Scholar
• Hanan , M. and Kurtzberg , J.M. 1972 . “ Placement techniques ” . In Design Automation of Digital Systems: Theory and Techniques, , volume 1 , 213 – 282 . Englewood Cliffs : Prentice‐Hall .
   Google Scholar
• Hansen , P. and Jaumard , B. 1987 . Algorithms for the maximum satisfiability problem , 43 – 87 . USA : Rutgers University . RUTCOR Search Report
   Google Scholar
• Hertz , A. , Taillard , E. and de Werra , D. 1997 . “ Tabu search ” . In Local Search in Combinatorial Optimization, , 121 – 136 . Chichester : Wiley .
   Google Scholar
• Hu , T.C. and Kuh , E.S. , eds. 1985 . VLSI Circuit Layout: Theory and Design , New York : IEEE Press .
   Google Scholar
• Kirkpatrick , S. Jr. , Gelatt , C.D. and Vecchi , M.P. 1983 . Optimization by simulated annealing , volume 220 , Science .
   Google Scholar
• van Laarhoven , P.J.M. and Aarts , E.H.L. 1987 . Simulated Annealing: Theory and Applications , Dordrecht : Reidel .
   Google Scholar
• Lim , M.H. , Yuan , Y. and Omatu , S. 2000 . Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem . Computational Optimization and Applications , 15 : 249 – 268 .
   Web of Science ®Google Scholar
• Lundy , M. and Mees , A. 1986 . Convergence of an annealing algorithm . Mathematical Programming , 34 : 111 – 124 .
   Web of Science ®Google Scholar
• Martin , O. and Otto , S.W. 1996 . Combining simulated annealing with local search heuristics . Annals of Operations Research , 63 : 57 – 75 .
   Web of Science ®Google Scholar
• Merz , P. and Freisleben , B. 2000 . Fitness landscape analysis and mimetic algorithms for the quadratic assignment problem . IEEE Transactions on Evolutionary Computation , 4 : 337 – 352 .
   Web of Science ®Google Scholar
• Metropolis , N. , Rosenbluth , A. , Rosenbluth , M. , Teller , A. and Teller , E. 1953 . Equation of state calculation by fast computing machines . Journal of Chemical Physics , 21 : 1087 – 1092 .
   Web of Science ®Google Scholar
• Misevičius , A. 2001 . Combining simulated annealing and tabu search for the quadratic assignment problem . Information Technology and Control , 3 (20) : 37 – 50 .
   Google Scholar
• Misevičius , A. A new simulated annealing algorithm for the quadratic assignment problem . Materials of the International Conference on Production Research (ICPR‐16) (Prague, Czech Republic) . Prague. Czech Association of Scientific and Technical Societies .
   Google Scholar
• Osman , I.H. and Christofides , N. 1994 . Capacitated clustering problem by hybrid simulated annealing and tabu search . International Transactions in Operational Research , 1 : 317 – 336 .
   Google Scholar
• Pardalos , P.M. , Rendl , F. and Wolkowicz , H. 1994 . “ The quadratic assignment problem: a survey and recent developments ” . In Quadratic Assignment and Related Problems. DIMACS Series an Discrete Mathematics and Theoretical Computer Science, , volume 16 , 1 – 41 . Providence : AMS .
   Google Scholar
• Sahni , S. and Gonzalez , T. 1976 . p‐complete approximation problems . Journal of ACM , 23 : 555 – 565 .
   Web of Science ®Google Scholar
• Skorin‐Kapov , J. 1990 . Tabu search applied to the quadratic assignment problem . ORSA Journal on Computing , 2 : 33 – 45 .
   Google Scholar
• Steinberg , L. 1961 . The backboard wiring problem: a placement algorithm . SIAM Review , 3 : 37 – 50 .
   Web of Science ®Google Scholar
• Stuetzle , T. 1999 . Iterated local search for the quadratic assignment problem , Technical report Darmstadt University of Technology .
   Google Scholar
• Taillard , E. 1991 . Robust taboo search for the QAP . Parallel Computing , 17 : 443 – 455 .
   Web of Science ®Google Scholar
• Talbi , E.G. 2002 . A taxonomy of hybrid metaheuristies . Journal of Heuristics , 8 : 541 – 564 .
   Web of Science ®Google Scholar
• Wilhelm , M. and Ward , T. 1987 . Solving quadratic assignment problems by simulated annealing . IIE Transactions , 19 : 107 – 119 .
   Web of Science ®Google Scholar
• Zeng , Q. and Mouskos , K.C. 1997 . Heuristic search strategies to solve transportation network design problem , Tech. Report USA : New Jersey Dept. of Transportation and the National Center for Transportation and Industrial Productivity .
   Google Scholar