Testing of hybrid genetic algorithms for structured quadratic assignment problems

Informatica

Volumn 20, Issue 2, 2009, Pages 255-272

  Miseviius, Alfonsas ^a   Rubliauskas, Dalius ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Combinatorial optimization; Heuristics; Hybrid genetic algorithms; Meta heuristics; Quadratic assignment problem

Indexed keywords

EID: 67651222596     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Ahuja, R.K., J.B. Orlin and A. Tiwari (2000). A greedy genetic algorithm for the quadratic assignment problem. Computers & Operations Research, 27, 917-934.
2. Blum, C., and A. Roli (2003). Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys, 35, 268-308.
3. Burkard, R.E., S. Karisch and F. Rendl (1997). QAPLIB - a quadratic assignment problem library. Journal of Global Optimization, 10, 391-403. See also http://www.seas.upenn.edu/qaplib/
4. Burkard, R.E., E. Çela, P.M. Pardalos and L. Pitsoulis (1998). The quadratic assignment problem. In D.Z. Du and P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 3. Kluwer, Dordrecht. pp. 241-337.
5. Çela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht.
6. Drezner, Z. (2003). A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 15, 320-330.
7. Drezner, Z. (2005). Compounded genetic algorithms for the quadratic assignment problem. Operations Research Letters, 33, 475-480.
8. Drezner, T., and Z. Drezner (2006). Gender specific genetic algorithms. INFOR (Information Systems and Operations Research), 44, 117-128.
9. Fleurent, C., and J.A. Ferland (1994). Genetic hybrids for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16. AMS, Providence. pp. 173-188.
10. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading.
11. Koopmans, T., and M. Beckmann (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53-76.
12. Lim, M.H., Y. Yuan and S. Omatu (2000). Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Computational Optimization and Applications, 15, 249-268.
13. Loiola, E.M., N.M.M. de Abreu, P.O. Boaventura-Netto, P. Hahn and T. Querido (2007). A survey for the quadratic assignment problem. European Journal of Operational Research, 176, 657-690.
14. Misevicius, A. (2004). An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowledge-Based Systems, 17, 65-73.
15. Misevicius, A. (2005). A tabu search algorithm for the quadratic assignment problem. Computational Optimization and Applications, 30, 95-111.
16. Misevicius, A. (2006). A fast hybrid genetic algorithm for the quadratic assignment problem. In M. Keijzer et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006). ACM Press, New York. pp. 1257-1264.
17. Reeves, C.R., and J.E. Rowe (2001). Genetic Algorithms: Principles and Perspectives. Kluwer, Norwell.
18. Sahni, S., and T. Gonzalez. (1976). P-complete approximation problems. Journal of ACM, 23, 555-565.
19. Taillard, E. (1991). Robust taboo search for the QAP. Parallel Computing, 17, 443-455.
20. Taillard, E. (1995). Comparison of iterative searches for the quadratic assignment problem. Location Science, 3, 87-105.
21. Taillard, E. (1998). FANT: fast ant system. Tech. Report, IDSIA-46-98, Lugano, Switzerland.
22. Tate, D.M., and A.E. Smith (1995). A genetic approach to the quadratic assignment problem. Computers & Operations Research, 1, 73-83.
23. Vázquez, M., and L.D. Whitley. (2000). A hybrid genetic algorithm for the quadratic assignment problem. In L.D. Whitley, D.E. Goldberg, E. Cantú-Paz et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'00). Morgan Kaufmann, San Francisco. pp. 135-142.
24. Voß, S. (2000). Heuristics for nonlinear assignment problems. In P.M. Pardalos and L. Pitsoulis (Eds.), Nonlinear Assignment Problems. Kluwer, Boston. pp. 175-215.