Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Eaglewood Cliffs, NJ) Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Programming (2001a) 91:71–97Crossref, Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Oper. Res. Lett. (2001b) 31:185–194Crossref, Google Scholar
• Ahuja R. K., Orlin J. B., Tiwari A. A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. (2000) 27:917–934Crossref, Google Scholar
• Ahuja R. K., Ergun Ö., Orlin J. B., Punnen A. P. A survey of very large scale neighborhood search techniques. Discrete Appl. Math. (2002) 123:75–102Crossref, Google Scholar
• Ahuja R. K., Goodstein J., Mukherjee A., Orlin J. B., Sharma D. A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model. INFORMS J. Comput. (2007) 19:416–428Link, Google Scholar
• Anstreicher K. M., Brixius N. W., Goux J. P., Linderoth J. Solving large quadratic assignment problems on computational grids. Math. Programming (2002) 91:563–588Crossref, Google Scholar
• Bazaraa M. S., Sherali M. D. Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res. Logist. Quart. (1980) 27:29–41Crossref, Google Scholar
• Buffa E. S., Armour G. C., Vollmann T. E. Allocating facilities with CRAFT. Harvard Bus. Rev. (1964) 42:136–158Google Scholar
• Burkard R. E., Bönniger T. A heuristic for quadratic boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. (1983) 13:374–386Crossref, Google 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) 3(Kluwer Academic Publishers, Boston, MA) 241–337Crossref, Google Scholar
• Çela E.The Quadratic Assignment Problem—Theory and Algorithms (1998) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Christofides N., Benavent E. An exact algorithm for the quadratic assignment problem. Oper. Res. (1989) 37:760–768Link, Google Scholar
• Cormen T. H., Leiserson C. E., Rivest R. L., Stein C.Introduction to Algorithms (2001) 2nd ed.(MIT Press, Cambridge, MA) Google Scholar
• Deineko V. G., Woeginger G. J. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math. Programming (2000) 87:519–542Crossref, Google Scholar
• Drezner Z. A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. (2003) 15:320–330Link, Google Scholar
• Ergun Ö. New neighborhood search algorithms based on exponentially large neighborhoods. (2001) . Doctoral thesis, Operations Research Center, MIT, Cambridge, MAGoogle Scholar
• Fleurent C., Ferland J. A. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) 16(American Mathematical Society, Providence, RI) 173–187Crossref, Google Scholar
• Gendreau M., Guertin F., Potvin J.-Y., Seguin R. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. (1998) . CRT Research Report CRT-98-10, Centre for Research on Transportation, University of Montreal, Montreal, CanadaGoogle Scholar
• Glover F. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. (1996) 65:223–253Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Hahn P. M., Hightower W. L., Johnson T. A., Guignard-Spielberg M., Roucairol C. Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslavian J. Oper. Res. (2001) 11:41–60Google Scholar
• Kelly J. P., Xu J. A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. (1999) 11:161–172Link, Google Scholar
• Lawler E. L. The quadratic assignment problem. Management Sci. (1963) 9:586–599Link, Google Scholar
• Li Y., Pardalos P. M., Resende M. G. C., Pardalos P. M., Wolkowicz H. A greedy randomized adaptive search procedure for the quadratic assignment problem. Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) (American Mathematical Society, Providence, RI) 237–261Crossref, Google Scholar
• Malucelli F.Quadratic Assignment Problems: Solution Methods and Applications (1993) (Dipartimento di Informatica, Università di Pisa, Italy) Google Scholar
• Maniezzo V., Colorni A., Dorigo M. The ant system applied to the quadratic assignment problem. (1994) . Technical Report IRIDIA/94-28, Université libre de Bruxelles, Brussels, BelgiumGoogle Scholar
• Müller-Merbach H.Optimale Reihenfolgen (1970) (Springer Verlag, Berlin, Germany) 158–171Crossref, Google Scholar
• Pardalos P. M., Crouse J. A parallel algorithm for the quadratic assignment problem. Proc. Supercomputing 1989 Conf. (1989) (ACM Press, New York) 351–360Crossref, Google Scholar
• Pardalos P. M., Rendl F., Wolkowicz H., Pardalos P. M., Wolkowicz H. The quadratic assignment problem. Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) (American Mathematical Society, Providence, RI) 1–42Google Scholar
• QAPLIB (2005) . QAPLIB home page, http://www.seas.upenn.edu/qaplib/Google Scholar
• Rego C., Roucairol C., Osman I. H., Kelly J. P. Parallel tabu search algorithm using ejection chains for the vehicle routing problem. Metaheuristics: Theory and Applications (1996) (Kluwer Academic Publishers, Boston, MA) 661–675Crossref, Google Scholar
• Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J. Comput. (1990) 2:33–45Link, Google Scholar
• Taillard E. Robust tabu search for the quadratic assignment problem. Parallel Comput. (1991) 17:443–455Crossref, Google Scholar
• Talluri K. T. Swapping applications in a daily fleet assignment. Transportation Sci. (1996) 31:237–248Link, Google Scholar
• Tate D. E., Smith A. E. A genetic approach to the quadratic assignment problem. Comput. Oper. Res. (1995) 22:73–83Crossref, Google Scholar
• Thompson P. M., Orlin J. B. The theory of cyclic transfers. (1989) . Operations Research Center Working Paper, MIT, Cambridge, MAGoogle Scholar
• Thompson P. M., Psaraftis H. N. Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Oper. Res. (1993) 41:935–946Link, Google Scholar
• West D. H. Algorithm 608: Approximate solution of the quadratic assignment problem. ACM Trans. Math. Software (1983) 9:461–466Crossref, Google Scholar
• Wilhelm M. R., Ward T. L. Solving quadratic assignment problems by simulated annealing. IEEE Trans. (1987) 19:107–119Crossref, Google Scholar