Genetic algorithms: Mimicking evolution and natural selection in optimization models

Biomimetics: Biologically Inspired Technologies

Volumn , Issue , 2005, Pages 157-175

  Drezner, Tammy ^a   Drezner, Zvi ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745693594     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (45)

1. Ahuja, R.K., J.B. Orlin, and A. Tiwari (2000). A descent genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27, 917-934.
2. Allenson, R. (1992). Genetic algorithms with gender for multi-function optimisation, Technical Report EPCC-SS92-01, Edinburgh Parallel Computing Centre, Edinburgh, Scotland.
3. Anstreicher, K., N. Brixius, J.-P. Goux, and J. Linderoth (2002). Solving large quadratic assignment problems on computational grids. Mathematical Programming, 91, 563-588.
4. Burkard, R.E. (1990). Locations with spatial interactions: the quadratic assignment Problem. In: Mirchandani, P.B., R.L. Francis (Eds), Discrete Location Theory, Wiley, Berlin.
5. Burkard, R., S.E. Karisch, and F. Rendl (1997). QAPLIB - a quadratic assignment problem library. Journal of Global Optimization, 10, 391-403, electronic update: http://www.seas.upenn.edu/qaplib/(revised 02.04.2003).
6. Burkard, R.E. and J. Offermann (1977). Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Zeitschrift für Operations Research, 21, B121-B132.
7. Cantu-Paz, E. (1998). A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis, 10, 141-171.
8. Cantu-Paz, E. (1999). Migration policies and takeover times in genetic algorithms. In: Benzhaf, W., J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakeila, R.E. Smith (Eds), Proceedings of the Genetic and Evolutionary Computation Conference, Morgan-Kaufman, San Francisco, California, p. 775.
9. Cantu-Paz, E. and D.E. Goldberg (2000). Parallel genetic algorithms: theory and practice. Computer Methods in Applied Mechanics and Engineering, Elsevier, New York, New York.
10. Cela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic Publishers, Dordrecht, The Netherlands.
11. Colorni, A., M. Dorigo, and V. Maniezzo (1992). Distributed optimization by ant colonies. In: Varela, F.J., P. Bourgine (Eds), Proceedings of ECAL'91 -European Conference on Artificial Life, MIT Press, Cambridge, Massachusetts, pp. 134-142.
12. Current, J., M. Daskin, and D. Schilling (2002). Discrete network location models. In: Drezner, Z., H.W. Hamacher (Eds), Location Analysis: Applications and Theory, pp. 81-118.
13. Daskin, M. (1995). Network and Discrete Location: Models, Algorithms and Applications, John Wiley, New York, New York.
14. Dorigo, M., and L.M. Gambardella (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transanctions on Evolutionary Computation, 1, 53-66.
15. Drezner, Z. (1980). DISCON - A new method for the layout problem. Operations Research, 28, 1375-1384.
16. Drezner, Z. (2003). A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 15, 320-330.
17. Drezner, Z. (2005a). Compounded genetic algorithms. Operations Research Letters, 33, 475-480.
18. Drezner, Z. (2005b). Extended concentric tabu for the quadratic assignment problem. European Journal of the Operational Research, 160, 416-422.
19. Drezner, Z. (2005c). A distance based rule for removing population members in genetic algorithms. 4oR,In press.
20. Drezner, T. and Z. Drezner. (2005). Gender-specific genetic algorithms. Information Systems and Operational Research, accepted for publication.
21. Drezner, Z. and G.A. Marcoulides (2003). A distance-based selection of parents in genetic algorithms. In: Mauricio, G., C. Resende, Jorge P. de Sousa (Eds), Metaheuristics: Computer Decision-Making, Combinatorial Optimization Book Series, Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 257-278.
22. Edmands, S. (1999). Heterosis and outbreeding depression in interpopulation crosses spanning a wide range of divergence, Evolution, 53, 1757-1768.
23. Edmands, S. (2002). Does parental divergence predict reproductive compatibility? Trends in Ecology and Evolution, 17, 520-527.
24. Fleurent, C. and J. Ferland (1994). Genetic hybrids for the quadratic assignment problem. DIMACS Series in Mathematical Theoretical Computer Science,16, 190-206.
25. Gambardella, L., E. Taillard, and M. Dorigo (1999). Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50, 167-176.
26. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533-549.
27. Glover, F. and M. Laguna (1997). Tabu Search, Kluwer Academic Publishers, Boston, Massachusetts.
28. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Wokingham, England.
29. Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan.
30. Kirkpatrick, S., C.D. Gelat and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220, 671-680.
31. Koopmans, T. and M.J. Beckmann (1957). Assignment problems and the location of economics activities. Econometrica, 25, 53-76.
32. Land, A.H. and A.G. Doig (1960). An automatic method of solving discrete programming problems. Econometrica, 28, 497-520.
33. Laporte, G. and H. Mercure (1988). Balancing hydraulic turbine runners: a quadratic assignment problem. European Journal of Operational Research, 35, 378-381.
34. Moscato, P. (2002). Memetic algorithms. In: Pardalos, P.M., M.G.C. Resende (Eds), Handbook of Applied Optimization, Oxford University Press, Oxford, U.K.
35. Nemhauser, G.L. and L.A. Wolsey (1988). Integer and Combinatorial Optimization, Wiley, New York, New York.
36. Reeves, C.R. (1993). Genetic algorithms. In: Reeves, C.R. (Ed.), Modern Heuristic Techniques for Combinatorial Problems, pp. 151-196.
37. Rendl, F. (2002). The quadratic assignment problem. In: Drezner, Z., H. Hamacher (Eds), Facility Location: Applications and Theory, Springer, Berlin.
38. Salhi, S. (1998). Heuristic search methods. In: Marcoulides, G.A. (Ed.), Modern Methods for Business Research, Lawrence Erlbaum Associates, Mahwah, New Jersey.
39. Salhi, S. and M.D.H. Gamal (2003). A GA-based heuristic for the multi-Weber problem. Annals of Operations Research, 123, 203-222.
40. Segal, N.L. (2000). News, views and comments, Twin Research, 3, 338-343.
41. Spears, W.M. (2000). The Role of Mutation and Recombination, Natural Computing Series, Springer-Verlag, Berlin.
42. Steinberg, L. (1961). The backboard wiring problem: a placement algorithm. SIAM Review, 3, 37-50.
43. Taillard, E.D. (1991). Robust tabu search for the quadratic assignment problem, Parallel Computing, 17, 443-455.
44. Taillard, E.D. (1995). Comparison of iterative searches for the quadratic assignment problem, Location Science, 3, 87-105.
45. Tate, D.E. and A.E. Smith (1995). A genetic approach to the quadratic assignment problem. Computers and Operations Research, 22, 73-83.