The enhanced evolutionary Tabu Search and its application to the Quadratic Assignment Problem

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 975-982

  McLoughlin III, John F ^a   Cedeno, Walter ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b JOHNSON AND JOHNSON PHARMACEUTICAL RESEARCH AND DEVELOPMENT   (United States)

Author keywords

Evolutionary Algorithms; Genetic Algorithms; Optimization; Quadratic Assignment Problem; Soft Computing; Tabu Search

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

QUADRATIC ASSIGNMENT PROBLEM; SOFT COMPUTING; TABU SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 32444442255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068175     Document Type: Conference Paper

References (20)

1. Battiti, R. and Tecchiolli, G. The reactive tabu search. ORSA Journal on Computing, 6, 2, 126-140, 1994.
2. Glover, F. and Kochenberger, O. A. Handbook of Metaheuristics. Kluwer Academic Publishers, 2003.
3. Nugent, C.E., Vollmann, and I.E., Ruml, J. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research, 16:150-173, 1968.
4. Resende, M., Pitsoulis, L., Pardalos, P. Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discrete Applied Mathematics, 100: 95-113, 2000.
5. Burkhard, R.E., Karish, S.E., and Rendl, F. QAPLIB - A quadratic assignment problem library. Journal of Global Optimization, 10:391-403, 1997.
6. Sahni, S. and Gonzalez, T. P-complete approximation problems. J. ACM 23, 555-565, 1976.
7. Anstreicher, K.M. Recent advances in the solution of quadratic assignment problems. Mathematical Programming, Series B 97:27-42, 2003.
8. Taillard, E. D. Robust tabu search for the quadratic assingnment problem, Parallel Computing, 17:443-455, 1991.
9. Skorin-Kapov. Tabu search applied to the quadratic assingnment problem. ORSA Journal on Computing, 2(1):33-45, 1990.
10. Taillard, E. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3:87-103, 1995.
11. Glover, F. Future Paths for Integer Programming and Link to Artificial Intelligence. Computers and Operations Research, 12:533-549, 1986.
12. Glover, F. Tabu search - part I. ORSA Journal on Computing, 1(3): 109-206, 1989.
13. Glover, F. Tabu Search - part II. ORSA Journal on Computing, 2:4-32, 1990.
14. Glover, F., Laguna, M. Tabu Search. Kluwer Academic Publishers, 1997.
15. Glover, F. Laguna, M. Tabu Search. Modem Heuristic Techniques for Combinatorial Problems. Colin Reeves, ed. Blackwell Scientific Publishing, 71-140, 1993.
16. De Falco, I., Del Balio, R., Tarantino, E., and Vaccaro, R. Improving search by incorporating evolution principles in parallel tabu search. IEEE World Congress on Computational Intelligence, 2:823-828, June 27-29, 1994.
17. Holland, J.H. Adaptation in Natural and Artificial Systems, 2nd Edition, Cambridge: MIT Press, 1992.
18. Mitchell, M. An Introduction to Genetic Algorithms, Cambridge: MIT Press, 1996.
19. Cedeflo, W. The Multi-Niche Crowding Genetic Algorithm: Analysis and Applications, Ph.D. Dissertation, Computer Science Department, University of California, Davis, September 1995. UMI Dissertation Services, Microfilm Number 9617947.
20. Merz, P. and Freisleben, B. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In Proceedings of the 1999 International Congress of Evolutionary Computation (CEC'99), Washington DC, USA, 1999.