Genetic algorithms and beyond

Data Handling in Science and Technology

Volumn 23, Issue C, 2003, Pages 3-54

  Luke, Brian T ^a  

^a SAIC FREDERICK INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956772065     PISSN: 09223487     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0922-3487(03)23001-X     Document Type: Review

References (86)

1. Ahuja R.K., Orlin J.B., and Tiwari A. A greedy algorithm for the quadratic assignment problem. Computers Oper. Res. 27 (2000) 917-934
2. Back, T., Rudolph, G., Schwefel, H.P., 1995. Private communication.
3. Bagley, J.D., 1967. The behavior of adaptive systems which employ genetic and correlation algorithms. Doctoral dissertation. University of Michigan, Dissertation Abstracts International, 28, 5106B (University Microfilms No. 68-7556).
4. Bandyopadhyay S., Pal S.K., and Maulik U. Incorporating chromosome differentiation in genetic algorithms. Informat. Sci. 104 (1998) 293-319
5. Bledsoe, W.W., 1961. The use of biological concepts in the analytical study of systems. Paper presented at ORSA-TIMS National Meeting, San Francisco.
6. Bosworth J., Foo N., and Zeigler B.P. Comparison of Genetic Algorithms with Conjugate Gradient Methods (CR-2093) (1972), National Aeronautics and Space Administration, Washington, DC
7. Botee H.M., and Bonabeau E. Evolving ant colony optimization. Adv. Complex Syst. 1 (1998) 149-159
8. Brown E.C., and Sumichrast R.T. Impact of the replacement heuristic in a grouping genetic algorithm. Computers Oper. Res. 30 (2003) 1575-1593
9. Calabretta R., Galbiati R., Nolfi S., and Parisi D. Two is better than one: a diploid genotype for neural networks. Neural Process. Lett. 4 (1996) 149-155
10. Cavicchio, D.J., 1970. Adaptive search using simulated evolution. Unpublished Doctoral Dissertation. University of Michigan, Ann Arbor.
11. Cobb, H., 1990. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001.
12. Cobb H., and Grefenstette J.J. Genetic algorithms for tracking changing environments. Proceedings of the Fifth International Conference on Genetic Algorithms (1993), Morgan Kaufmann, Los Altos, CA pp. 523-530
13. Colorni A., Dorigo M., and Maniezzo V. Distributed optimization by ant colonies. In: Varela F., and Bourgine P. (Eds). Proceedings of the First European Conference on Artificial Life (1991), MIT Press, Cambridge, MA 134-142
14. Craighurst, R., Martin, W., 1995. Enhancing GA performance through crossover prohibitions based on ancestry. Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 115-122.
15. Davis, L., 1985. Job shop scheduling with genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and their Application, pp. 162-164.
16. Davis L. Order-based genetic algorithm and the graph coloring problem. Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold, New York
17. De S., Pal S.K., and Ghosh A. Genotypic and phenotypic assortative mating in genetic algorithms. J. Inform. Sci. 105 (1998) 209-226
18. De Falco I., Della Cioppa A., and Tarantino E. Mutation-based genetic algorithm: performance evaluation. Appl. Soft Comput. 1 (2002) 285-299
19. Dymek Captain, A., 1992. An examination of hypercube implementations of genetic algorithms. Thesis. Air Force Institute of Technology AFIT/GCS/ENG/92M-02.
20. Eshelman, L.J., 1991a. Preventing premature convergence in the genetic algorithms by preventing incest. In: Belew, R.K., Booker, L.B., (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, July 1991, pp. 115-122.
21. Eshelman L. The CHC adaptive search algorithm. How to have safe search when engaging in nontraditional genetic recombination. In: Rawlings G. (Ed). Foundations of Genetic Algorithms (1991), Morgan Kaufmann, San Mateo, CA 265-283
22. Falkenauer E., and Bouffouix S. A Genetic Algorithm for Job-Shop. Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento vol. 1 (1991) pp. 824-829
23. Fogel D.B. Applying evolutionary programming to selected traveling salesman problems. Cybernet. Syst. (USA) 24 (1993) 27-36
24. Fogel L.J., Owens A.J., and Walsh M.J. Artificial Intelligence Through Simulated Evolutions (1966), Wiley, New York
25. Fogel, D.B., Fogel, L.J., Porto, V.W., 1991. Evolutionary methods for training neural networks. IEEE Conference on Neural Networks for Ocean Engineering, 91CH3064-3, pp. 317-327.
26. Foo N.Y., and Bosworth J.L. Algebraic, Geometric, and Stochastic Aspects of Genetic Operators (CR-2099) (1972), National Aeronautics and Space Administration, Washington, DC
27. Gardner E.J., Simmons M.J., and Snustad D.P. Principles of Genetics (1991), Wiley, New York
28. Gelfand A.E., and Smith A.F.M. Sampling-based approaches to calculating marginal densities. J. Am. Statist. Assoc. 85 (1990) 398-409
29. Gelfand A.E., Hils S.E., Racine-Poon A., and Smith A.F.M. Illustration of Bayesian inference in normal data models using Gibbs sampling. J. Am. Statist. Assoc. 85 (1990) 972-985
30. Gillespie J.H. Population Genetics: A Concise Guide (1998), Johns Hopkins University Press, Baltimore
31. Glover F. Future paths for integer programming and links to artificial intelligence. Computers Oper. Res. 5 (1986) 533-549
32. Glover F. Tabu search: a tutorial. Interfaces 20 (1990) 74-94
33. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning (1989), Addison-Wesley, Berkeley, CA
34. Goldberg, D.E., Kerzic, T., 1990. mGA 1.0: a common LISP implementation of a messy genetic algorithm. NASA-CR-187260, Cooperative Agreement NCC 9-16, Research Activity AI.12, N91-13084.
35. Goldberg D.E., and Smith R.E. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Grefenstette J.J. (Ed). Proceedings of the Second International Conference on Genetic Algorithms (1987), Laurence Erlbaum Associates, Hillsdale, NJ 59-68
36. Goldberg D.E., Korb B., and Deb K. Messy genetic algorithm: motivation, analysis, and first results. Complex Syst. 3 (1989) 493-530
37. Goldberg D.E., Deb K., and Clark J.H. Genetic algorithms, noise, and the sizing of populations. Complex Syst. 6 (1992) 333-362
38. Grefenstette J.J. Genetic algorithms for changing environments. In: Maenner R., and Manderick B. (Eds). Parallel Problem Solving from Nature 2 (1992), North-Holland, Amsterdam 137-144
39. Grefenstette J.J., and Ramsey C.L. An approach to anytime learning. In: Sleeman D., and Edwards P. (Eds). Proceedings of the Ninth International Conference on Machine Learning (1992), Morgan Kaufmann, Los Altos, CA 180-195
40. Guo L.X., and Zhao M.Y. A parallel search genetic algorithm based on multiple peak values and multiple rules. J. Mater. Process. Technol. 129 (2002) 539-544
41. Hadad B., and Eick C. Supporting polyploidy in genetic algorithms using dominance vectors. In: Angeline P., Reynolds R.G., McDonnell J.R., and Eberhart R. (Eds). Proceedings of the Sixth International Conference on Evolutionary Programming. Volume 1213 of LNCS (1997), Springer
42. Hasancebi O., and Erbatur F. Evaluation of crossover techniques in genetic algorithm based optimum structural design. Computers Struct. 78 (2000) 435-448
43. Herrera F., Lozano M., and Verdegay J.L. Fuzzy connectives based crossover operators to model genetic algorithms population diversity. Fuzzy Sets Syst. 92 (1997) 21-30
44. Holland J. Adaptation in Natural and Artificial Systems (1975), University of Michigan Press, Ann Arbor, MI
45. Hollstein, R.B., 1971. Artificial genetic adaptation in computer control systems. Doctoral dissertation, University of Michigan, Dissertation Abstracts International, 32, 1510B. (University Microfilms No. 71-23,773).
46. van Kampen A.H.C., and Buydens L.M.C. The ineffectiveness of recombination in a genetic algorithm for the structure elucidation of a heptapeptide in torsion angle space. A comparison to simulated annealing. Chemom. Intel. Lab. Syst. 36 (1997) 141-152
47. Kennedy, J., 1997. The particle swarm: social adaptation of knowledge. Proceedings of the 1997 International Conference on Evolutionary Computation, Indianapolis, IN, IEEE Service Center, Piscataway, NJ, pp. 303-308.
48. Kennedy, J., Eberhart, R.C., 1995. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, IEEE Service Center, Piscataway, NJ, IV, pp. 1942-1948.
49. Keser M., and Stupp S.I. A genetic algorithm for conformational search of organic molecules: implications for materials chemistry. Computers Chem. 22 (1998) 345-351
50. Kim, Y., Kim, J.K., Lee, S.-S., Cho, C.-H., Lee-Kwang, H., 1996. Winner take all strategy for a diploid genetic algorithm. The First Asian Conference on Simulated Evolution and Learning.
51. Kim J.O., Shin D.-J., Park J.-N., and Singh C. Atavistic genetic algorithm for economic dispatch with valve point effect. Electric Power Syst. Res. 62 (2002) 201-207
52. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
53. Konig R., and Dandekar T. Improving genetic algorithms for protein folding simulations by systematic crossover. BioSystems 50 (1999) 17-25
54. Liepins, G.E., Baluja, S., 1991. apGA: an adaptive parallel genetic algorithm. Fourth International Conference on Genetic Algorithms, San Diego, CONF-910784-2.
55. Luke B.T. Evolutionary programming applied to the development of quantitative structure-activity relationships and quantitative structure-property relationships. J. Chem. Informat. Computer Sci. 34 (1994) 1279-1287
56. Luke B.T. An overview of genetic methods. In: Devillers J. (Ed). Genetic Algorithms in Molecular Modeling (1996), Academic Press, London 35-66
57. Luke B.T. In: Truhlar D.G., Howe W.J., Hopfinger A.J., Blaney J., and Dammkoehler R.A. (Eds). Applications of Distributed Computing to Conformational Searches. The IMS Volumes in Mathematics and Its Applications vol. 108 (1999), Springer, New York 191-206
58. Luke, B.T., web, Substructure searching using genetic methods. http://members.aol.com/btluke/mcdga2.htm.
59. Mansfield Squadron Leader, R.A., 1990. Genetic Algorithms. Dissertation. School of Electrical, Electronic and Systems Engineering, College of Cardiff, University of Wales, Crown Copyright.
60. Mathias, K.E., Whitley, L.D., 1995. Private communication.
61. Moscato, P., 1989. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Tech. Rep. Caltech Concurrent Computation Program, Report 826, California Institute of Technology, Pasadena, CA, USA.
62. Muhlenbein H., Schpmisch M., and Born J. The parallel genetic algorithm as a function optimizer. Parallel Comput. 17 (1991) 619-632
63. Narayanan L., and Lucas S.B. A genetic algorithm to improve a neural network to predict a patient's response to Warfarin. Methods of Information in Medicine 32 (1993) 55-58
64. Ng K.P., and Wong W.C. A new diploid scheme and dominance change mechanism for non-stationary function optimization. Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann, Los Altos, CA pp. 159-166
65. Osmera, P., Kvasnicka,V., Pospichal, J., 1997. Genetic algorithms with diploid chromosomes. Mendel '97, PC-DIR Brno, ISBN 80-214-0084-7, pp. 111-116.
66. Park T.-Y., and Froment G.F. A hybrid genetic algorithm for the estimation of parameters in detailed kinetic models. Computers Chem. Engng 22 (1998) S103-S110
67. Rechenberg I. Evolutionsstrategie: Optimierung technischer Systeme nach Prinsipien der Biologischen Evolution (1973), Frommann-Holzboog Verlag, Stuttgart
68. Rosenberg, R.S., 1967. Simulation of Genetic Populations with Biochemical Properties. Doctoral dissertation. University of Michigan, Dissertation Abstracts International, 28, 2732B. (University Microfilms No. 67-17,836).
69. Schwefel H.-P. Numerische Optimierung von Computer-Modellen Mittels der Evolutionstrategie. Interdisciplinary Systems Research vol. 26 (1977), Birkhauser, Basel
70. Simões, A., Costa, E., 2001a. Using biological inspiration to deal with dynamic environments. Proceedings of the Seventh International Conference on Soft Computing (MENDEL'01), Brno, Czech Republic, 6-8 June.
71. Simões, A., Costa, E., 2001b. On biologically inspired genetic operators: transformation in the standard genetic algorithm. Proceedings of the Genetic and Evolutionary Computing Conference (GECCO'2001), San Francisco, USA, July.
72. Simões A., and Costa E. Using GAs to deal with dynamic environments: A comparative study of several approaches based on promoting diversity. In: Langdon W.B., et al. (Ed). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'02) (2002), Morgan Kaufmann, New York New York, 9-13 July
73. Simões A., and Costa E. Parametric study to enhance the genetic algorithm's performance when using transformation. In: Langdon W.B., et al. (Ed). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'02) (2002), Morgan Kaufmann, New York New York, 9-13 July
74. Smith R.E., and Goldberg D.E. Diploidy and dominance in artificial genetic search. Complex Syst. 6 (1992) 251-285
75. Sorensen, H., Jacobsen, J.F., web, Maintaining diversity through triggerable inheritance. http://www.daimi.au.dk/~manaic/ToEC/triggerEA.ps.
76. Strickberger M.W. Genetics (1985), Prentice-Hall of India, New Delhi
77. Syswerda G. Uniform crossover in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms (1989), Morgan Kaufman, New York pp. 2-9
78. Syswerda G. Schedule optimization using genetic algorithms. In: Davis L. (Ed). Handbook of Genetic Algorithms. Chapter 21 (1990), Van Nostrand Reinhold, New York
79. Trojanowsky, K., Michalewicz, Z., Xiao, J., 1997. Adding memory to the evolutionary planner/navigator. IEEE International Conference on Evolutionary Computation, pp. 483-487.
80. Weinberg, R., 1970. Computer simulation of a living cell. Doctoral dissertation. University of Michigan, Dissertation Abstracts International, 31, 5312B. (University Microfilms No. 71-4766).
81. Whitley D. The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In: Schaffer J.D. (Ed). Proceedings of the Third International Conference on Genetic Algorithms (1989), Morgan Kaufmann, Los Altos, CA 116-121
82. Wolpert D.H., and Macready W.G. No Free Lunch Theorems for Search. Technical Report TR-95-02-010 (1995), The Santa Fe Institute, Santa Fe, NM, USA
83. Yang S. Genetic algorithms based on primal-dual chromosomes for royal road functions. In: Grmela A., and Mastorakis N.E. (Eds). Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation (2002), WSEAS Press, Athens 174-179 ISBN 960-8052-49-1
84. Yoon H.-S., and Moon B.-R. An empirical study on the synergy of multiple crossover operators. IEEE Trans. Evolut. Comput. 6 (2002) 212-223
85. Yu H., Fang H., Yao P., and Yuan Y. A combined genetic algorithm/simulated annealing algorithm for large scale system energy integration. Computers Chem. Engng 24 (2000) 2023-2035
86. Zeigler B.P., Bosworth J.L., and Bethke A.D. Noisy Function Optimization by Genetic Algorithms. Technical Report No. 143 143 (1973), Department of Computer and Communication Sciences, University of Michigan, Ann Arbor