Genetic algorithm hybridized with ruin and recreate procedure: Application to the quadratic assignment problem

Knowledge-Based Systems

Volumn 16, Issue 5-6 SPEC., 2003, Pages 261-268

  Misevicius, Alfonsas ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Genetic algorithms; Optimization; Quadratic assignment problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; OPTIMIZATION;

QUADRATIC ASSIGNMENT PROBLEM;

GENETIC ALGORITHMS;

EID: 0038392552     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0950-7051(03)00027-3     Document Type: Conference Paper

References (30)

1. Holland J.H. Adaptation in Natural and Artificial Systems. 1975;University of Michigan Press, Ann Arbor, MI.
2. E. Falkenauer, A, Delchambre, A genetic algorithm for bin packing and line balancing, Proceedings of the IEEE International Conference on Robotics and Automation, (RA92), Nice, France, 1992.
3. Chu P.C., Beasley J.E. A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. 24:1997;17-23.
4. Bui T.N., Moon B.R. Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45:1996;841-855.
5. Yamada T., Nakano R. A genetic algorithm applicable to large-scale job-shop problems. Männer R., Manderick B. Parallel Problem Solving from Nature 2. 1992;281-290 North-Holland, Amsterdam.
6. Beasley J.E., Chu P.C. A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94:1996;392-404.
7. P. Merz, B. Freisleben, Genetic local search for the TSP: new results, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, USA, 1997.
8. Blanton J. Jr., Wainwright R.L. Multiple vehicle routing with time and capacity constraints using genetic algorithms. Forrest S. Proceedings of Fifth International Conference on Genetic Algorithms. 1993;Morgan Kaufmann, San Mateo, CA.
9. Davis L. Handbook of Genetic Algorithms. 1991;Van Nostrand, New York.
10. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading, MA.
11. Mühlenbein H. Genetic algorithms. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;137-171 Wiley, Chichester.
12. Schrimpf G., Schneider K., Stamm-Wilbrandt H., Dueck V. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159:2000;139-171.
13. Mladenović N., Hansen P. Variable neighbourhood search. Comput. Oper. Res. 24:1997;1097-1100.
14. Koopmans T., Beckmann M. Assignment problems and the location of economic activities. Econometrica. 25:1957;53-76.
15. Hu T.C., Kuh E.S. VLSI Circuit Layout: Theory and Design. 1985;IEEE Press, New York.
16. Dickey J.W., Hopkins J.W. Campus building arrangement using TOPAZ. Transp. Res. 6:1972;59-68.
17. Elshafei A.N. Hospital layout as a quadratic assignment problem. Oper. Res. Q. 28:1977;167-179.
18. Taillard E. Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3:1995;87-105.
19. Burkard R.E., Offermann J. Entwurf von schreibmaschinentastaturen mittels quadratischer zuordnungsprobleme. Z. Oper. Res. 21:1977;121-132.
20. Burkard R.E., Çela E., Pardalos P.M., Pitsoulis L. The quadratic assignment problem. Du D.Z., Pardalos P.M. Handbook of Combinatorial Optimization. vol. 3:1998;241-337 Kluwer, Dordrecht.
21. Sahni S., Gonzalez T. P-complete approximation problems. JACM. 23:1976;555-565.
22. Gambardella L.M., Taillard E., Dorigo M. Ant colonies for the quadratic assignment problems. J. Oper. Res. Soc. 50:1999;167-176.
23. Bölte A., Thonemann U.W. Optimizing simulated annealing schedules with genetic programming. Eur. J. Oper. Res. 92:1996;402-416.
24. Taillard E. Robust taboo search for the QAP. Parallel Comput. 17:1991;443-455.
25. Fleurent C., Ferland J.A. Genetic hybrids for the quadratic assignment problem. Pardalos P.M., Wolkowicz H. Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. vol. 16:1994;173-188 AMS, Providence.
26. Lim M.H., Yuan Y., Omatu S. Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Comput. Optim. Appl. 15:2000;249-268.
27. P. Merz, B. Freisleben, A genetic local search approach to the quadratic assignment problem, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA'97), East Lansing, USA, 1997.
28. Tate D.M., Smith A.E. A genetic approach to the quadratic assignment problem. Comput. Oper. Res. 1:1995;73-83.
29. Burkard R.E., Karisch S., Rendl F. QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10:1997;391-403.
30. E. Taillard, L.M. Gambardella, Adaptive memories for the quadratic assignment problem, Technical Report IDSIA-87-97, Lugano, Switzerland, 1997.