Page 189 - Biomimetics : Biologically Inspired Technologies

Bar-Cohen : Biomimetics: Biologically Inspired Technologies DK3163_c005 Final Proof page 175 6.9.2005 12:11pm

Genetic Algorithms in Optimization Models 175

Drezner, T. and Z. Drezner. (2005). Gender-specific genetic algorithms. Information Systems and Operational
Research, accepted for publication.
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.
Edmands, S. (1999). Heterosis and outbreeding depression in interpopulation crosses spanning a wide range of
divergence, Evolution, 53, 1757–1768.
Edmands, S. (2002). Does parental divergence predict reproductive compatibility? Trends in Ecology and
Evolution, 17, 520–527.
Fleurent, C. and J. Ferland (1994). Genetic hybrids for the quadratic assignment problem. DIMACS Series in
Mathematical Theoretical Computer Science,16, 190–206.
Gambardella, L., E. Taillard, and M. Dorigo (1999). Ant colonies for the quadratic assignment problem.
Journal of the Operational Research Society, 50, 167–176.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and
Operations Research, 13, 533–549.
Glover, F. and M. Laguna (1997). Tabu Search, Kluwer Academic Publishers, Boston, Massachusetts.
Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley,
Wokingham, England.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor,
Michigan.
Kirkpatrick, S., C.D. Gelat and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220, 671–
680.
Koopmans, T. and M.J. Beckmann (1957). Assignment problems and the location of economics activities.
Econometrica, 25, 53–76.
Land, A.H. and A.G. Doig (1960). An automatic method of solving discrete programming problems. Econ-
ometrica, 28, 497–520.
Laporte, G. and H. Mercure (1988). Balancing hydraulic turbine runners: a quadratic assignment problem.
European Journal of Operational Research, 35, 378–381.
Moscato, P. (2002). Memetic algorithms. In: Pardalos, P.M., M.G.C. Resende (Eds), Handbook of Applied
Optimization, Oxford University Press, Oxford, U.K.
Nemhauser, G.L. and L.A. Wolsey (1988). Integer and Combinatorial Optimization, Wiley, New York, New
York.
Reeves, C.R. (1993). Genetic algorithms. In: Reeves, C.R. (Ed.), Modern Heuristic Techniques for Combina-
torial Problems, pp. 151–196.
Rendl, F. (2002). The quadratic assignment problem. In: Drezner, Z., H. Hamacher (Eds), Facility Location:
Applications and Theory, Springer, Berlin.
Salhi, S. (1998). Heuristic search methods. In: Marcoulides, G.A. (Ed.), Modern Methods for Business
Research, Lawrence Erlbaum Associates, Mahwah, New Jersey.
Salhi, S. and M.D.H. Gamal (2003). A GA-based heuristic for the multi-Weber problem. Annals of Operations
Research, 123, 203–222.
Segal, N.L. (2000). News, views and comments, Twin Research, 3, 338–343.
Spears, W.M. (2000). The Role of Mutation and Recombination, Natural Computing Series, Springer-Verlag,
Berlin.
Steinberg, L. (1961). The backboard wiring problem: a placement algorithm. SIAM Review, 3, 37–50.
Taillard, E.D. (1991). Robust tabu search for the quadratic assignment problem, Parallel Computing, 17,
443–455.
Taillard, E.D. (1995). Comparison of iterative searches for the quadratic assignment problem, Location
Science, 3, 87–105.
Tate, D.E. and A.E. Smith (1995). A genetic approach to the quadratic assignment problem. Computers and
Operations Research, 22, 73–83.