Practical genetic algorithms

Practical Genetic Algorithms

Volumn , Issue , 2004, Pages 1-253

  Haupt, Randy L ^a   Haupt, Sue Ellen ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85134856905     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471671746     Document Type: Book

References (139)

1. De Jong, K. A. 1975. Analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation. University of Michigan, Ann Arbor.
2. Michalewicz, Z. 1992. Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag.
3. Schwefel, H. 1995. Evolution and Optimum Seeking. New York:Wiley.
4. Whitley, D., K. Mathias, S. Rana, and J. Dzubera. 1996. Evaluating Evolutionary Algorithms. Artificial Intelligence Journal 85:1-32.
5. Whitley, D., R. Beveridge, C. Graves, and K. Mathias. 1995. Test Driving Three 1995 Genetic Algorithms: New Test Functions and Geometric Matching. Journal of Heuristics 1:77-104.
6. Anderson, D. Z. 1992. Linear programming. In McGraw-Hill Encyclopedia of Science and Technology 10. New York: McGraw-Hill, pp. 86-88.
7. Borowski, E. J., J. M. Borwein. 1991. Mathematics Dictionary. New York: HarperCollins.
8. Box, M. J. 1965. A comparison of several current optimization methods and the use of transformations in constrained problems. Comput. J. 8:67-77.
9. Boyer, C. B., U. C. Merzbach. 1991. A History of Mathematics. New York: Wiley.
10. Broyden, G. C. 1965. A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19:577-593.
11. Curtis, H. 1975. Biology, 2nd ed. New York:Worth.
12. Cuthbert, T. R. Jr. 1987. Optimization Using Personal Computers. New York:Wiley.
13. De Jong, K. A. 1975. Analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation. University of Michigan, Ann Arbor.
14. Dorigo, M., G. Maria. 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1:53-66.
15. Fletcher, R. 1963. Generalized inverses for nonlinear equations and optimization. In R. Rabinowitz (ed.), Numerical Methods for Non-linear Algebraic Equations. London: Gordon and Breach.
16. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.
17. Goldfarb, D., B. Lapidus. 1968. Conjugate gradient method for nonlinear programming problems with linear constraints. I&EC Fundam. 7:142-151.
18. Grant, V. 1985. The Evolutionary Process. New York: Columbia University Press.
19. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
20. Kirkpatrick, S., C. D. Gelatt Jr., M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
21. Luenberger, D. G. 1984. Linear and Nonlinear Programming, Reading, MA: Addison-Wesley.
22. Nelder, J. A., R. Mead. 1965.A simplex method for function minimization. Comput. J. 7:308-313.
23. Parsopoulos, K. E., M.N. Vrahatis. 2002. Recent approaches to global optimization problems through particle swarm optimization. In Natural Computing. Netherlands: Kluwer Academic, pp. 235-306.
24. Pierre, D. A. 1992. Optimization. In McGraw-Hill Encyclopedia of Science and Technology 12. New York: McGraw-Hill, pp. 476-482.
25. Schwefel, H. 1995. Evolution and Optimum Seeking. New York:Wiley.
26. Shanno, D. F. 1970. An accelerated gradient projection method for linearly constrained nonlinear estimation. SIAM J. Appl. Math. 18:322-334.
27. Thompson, G. L. 1992. Game theory. In McGraw-Hill Encyclopedia of Science and Technology 7. New York: McGraw-Hill, pp. 555-560.
28. Williams, H. P. 1993. Model Solving in Mathematical Programming. New York: Wiley.
29. Angeline, P. J. 1995. Evolution revolution: An introduction to the special track on genetic and evolutionary programming. IEEE Exp. Intell. Syst. Appl. 10:6-10.
30. Bäck, T. 1994. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Proc. 1st IEEE Conf. on Evolutionary Computation. Piscataway, NJ: IEEE Press, pp. 57-62.
31. Goldberg, D. E., K. Deb. 1991. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 69-93.
32. Goldberg, D. E. 1993. Making genetic algorithms fly: A lesson from the Wright brothers. Adv. Technol. Dev. 2:1-8.
33. Holland, J. H. 1992. Genetic algorithms. Sci. Am. 267:66-72.
34. Janikow, C. Z., D. St. Clair. 1995. Genetic algorithms simulating nature's methods of evolving the best design solution. IEEE Potentials 14:31-35.
35. Malasri, S., J. R. Martin, and L.Y. Lin. 1995. Hands-on software for teaching genetic algorithms. Comput. Educ. J. 6:42-47.
36. Adewuya, A. A. 1996. New methods in genetic search with real-valued chromosomes. Master's thesis. Massachusetts Institute of Technology, Cambridge.
37. Davis, L. 1991. Hybridization and numerical representation. In L. Davis (ed.), The Handbook of Genetic Algorithms. New York:Van Nostrand Reinhold, pp. 61-71.
38. Eshelman, L. J., D. J. Shaffer. 1993. Real-coded genetic algorithms and intervalschemata. In D.L.Whitley (ed.), Foundations of Genetic Algorithms 2. San Mateo, CA: Morgan Kaufman, pp. 187-202.
39. Michalewicz, Z. 1994. Genetic Algorithms + Data Structures = Evolution Programs, 2nd ed. New York: Springer-Verlag.
40. Radcliff, N. J. 1991. Forma analysis and random respectful recombination. In Proc. 4th Int. Conf. on Genetic Algorithms, San Mateo, CA: Morgan Kauffman.
41. Wright, A. 1991. Genetic algorithms for real parameter optimization. In G.J. E. Rawlins (ed.), Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 205-218.
42. Angeline, P. J. 1996. Evolving Fractal Movies. Proc. 1st An. Conf. on Genetic Programming, MIT Press, Cambridge, MA, pp. 503-511.
43. Biles, J. A. 1994. GenJam: A GA for generating jazz solos. Proc. Int. Computer Music Conf, San Francisco: 131-137.
44. Biles, J. A. 2002. GenJam in transition: From genetic jammer to generative jammer, 5th Int. Conf. on Generative Arts, Milan, Italy.
45. Haupt, R. L., S. E. Haupt. 2000. Creativity with a GA. IEEE Potentials 19:26-29.
46. Horner, A., D. Goldberg. 1991. GAs and computer-assisted music composition. Proc. 4th Int. Conf. on GAs. Urbana-Champaign, IL.
47. Horner, A., D. Goldberg. 1993. Machine tongues XVI: GAs and their application to FM matching synthesis. Compu. Music J. 17:17-29.
48. D. Horowitz. 1994. Generating rhythms with GAs. Proc. Int. Computer Music Conf., Aarhus, Denmark.
49. Jacob, B. L. 1995. Composing with GAs. Proc. Int. Computer Music Conf.
50. Johnson, C.G., J. J. Romero Cardalda. 2002. GAs in visual art and music. Leonardo 35:175-184.
51. Juliany, J., M. D.Vose. 1993. The GA fractal. Proc. 5th Int. Conf. on GAs, p. 639.
52. Meerschaert, M. M. 1993. Mathematical Modeling. Boston: Academic Press, pp. 66-70.
53. Mendelbrot, B. B. 1982. The Fractal Geometry of Nature. New York: Freeman.
54. Putnam, J. B. 1994. Genetic Programming of Music. Socorro, NM: New Mexico Institute of Mining and Technology.
55. Todd, S., W. Latham. 1992. Evolutionary Art and Computers. San Diego, CA: Academic Press.
56. Wiggins, G., G. Papadopoulos, S. Phon-Amnuaisuk, and A. Tuson. 1999. Evolutionary methods for musical composition. Int. J. Comput. Anticipat. Syst.
57. Alga, E., M.Tomassini. 2002. Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput. 6:443-462.
58. Aytug, H., G. J.Koehler. 1996. Stopping criteria for finite length genetic algorithms. ORSA J. Comp. 8:183-191.
59. Bäck, T. 1993. Optimal mutation rates in genetic search. In S. Forrest (ed.), Proc. 5th Int. Conf. on Genetic Algorithms, San Mates, CA: Morgan Kaufmann, pp. 2-9.
60. Bäck, T., M. Schutz. 1996a. Intelligent mutation rate control in canonical genetic algorithms. In Z.W. Ras and M. Michalewicz (eds.), Foundations of Intelligent Systems 9th Int. Symp. Berlin: Springer-Verlag, pp. 158-167.
61. Bäck, T. 1996b. Evolution strategies: An alternative evolutionary algorithm. In J.M. Alliot et al. (eds.), Artificial Evolution. Berlin: Springer-Verlag, pp. 3-20.
62. Booker, L. 1987. Improving search in genetic algorithms. In L. Davis (ed.), Genetic Algorithms and Simulated Annealing. London: Pitman, pp. 61-73.
63. Cantu-Paz, E., D. E. Goldberg. 1999. On the scalability of parallel genetic algorithms. Evol. Comput. 7:429-449.
64. Cantu-Paz, E., D. E. Goldberg. 2003. Are multiple runs of genetic algorithms better than one? In GECCO 2003, Berlin: Springer-Verlag, pp. 801-812.
65. Cantu-Paz, E. 1999. Migration policies, selection pressure, and parallel evolutionary algorithms. J. Heurist. 7:311-334.
66. Cantu-Paz, E. 2000. Efficient and Accurate Parallel Genetic Algorithms. Dordrecht: Kluwer Academic.
67. Cantu-Paz. 2000. Markov chain models of parallel genetic algorithms. IEEE Trans. Evol. Comput. 4:216-226.
68. Caruana, R.A., J.D. Schaffer. 1988. Representation and hidden bias: Gray vs. binary coding for genetic algorithms. Proc. 5th Int. Conf. on Machine Learning, Los Altos, CA: Morgan Kaufmann, pp. 153-161.
69. Deb, K., D. E. Goldberg. 1991. mGA in C: A Messy Genetic Algorithm in C. IlliGAL Report 91008.
70. De Jong, K. A. 1975. Analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation. University of Michigan, Ann Arbor.
71. Eby, D., R. Averill, W. Punch, and E.E. Goodman. 1999. Optimal design of flywheels using an injection island genetic algorithm. Art. Intell. Eng. Des. Manuf. 13:289-402.
72. Eiben, A. E., R. Hinterding, and Z. Michalewicz. 1999. Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3:124-141.
73. Eiben, A. E., P. E. Raue, and S. Ruttkay. 1994. Genetic algorithms with multi-parent recombination. In Parallel Problem Solving from Nature-PPSN III, Int. Conf. on Evolutionary Computation. Berlin: Springer-Verlag, pp. 78-87.
74. Eshelman, L. J., R. A. Caruna, and J.D. Schaffer. 1989. Biases in the crossover landscape. In Proc. 3rd Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 10-19.
75. Fogarty, T. C. 1989. Varying the probability of mutation in the genetic algorithm. In J.D. Schaffer (ed.), Proc. 3rd Int. Conf. on Genetic Algorithms. Los Altos, CA: Morgan Kaufmann, pp. 104-109.
76. Folino, G., C. Pizzuti, and G. Spezzano. 2001. Parallel hybrid method for SAT that couples genetic algorithms and local search. IEEE Trans. Evol. Comput. 5:323-334.
77. Foneseca, C. M., P. J. Flemming. 1993. Genetic algorithms for multi-objective optimization: Formulation, discussion, and generalization. Proc. 5th Int. Conf. on Genetic Algorithms. San Francisco, CA: Morgan Kaufmann, pp. 416-423.
78. Francois, O. 1998. An evolutionary strategy for global minimization and its Markov chain analysis. IEEE Trans. Evol. Comput. 2:77-90.
79. Haupt, R. L. 1995. Optimization of aperiodic conducting grids. 11th An. Rev. Progress in Applied Computational Electromagnetics Conf. Monterey, CA.
80. Haupt, R. L. 1996. Speeding convergence of genetic algorithms for optimizing antenna arrays. 12th An. Rev. Progress in Applied Computational Electromagnetics Conference. Monterey, CA.
81. Haupt, R.L., S.E.Haupt.2000.Practical Genetic Algorithms, 1st ed.New York:Wiley.
82. Haupt, R. L., S. E. Haupt. 2000. Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors. Appl. Comput. Electromagn. Soc. J. 15:94-102.
83. Hinterding, R., H. Gielewski, and T.C. Peachey. 1989.The nature of mutation in genetic algorithms. In L.J. Eshelman (ed.), Proc. 6th Int. Conf. on Genetic Algorithms. Los Altos, CA: Morgan Kaufmann, pp. 70-79.
84. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
85. Kazarlis, S. A., et al. 2001. Microgenetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Trans. Evol. Comp. 5:204-217.
86. Knjazew, D. 2002. OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems: Genetic Algorithms and Evolutionary Computation, Vol. 6. Norwell, MA: Kluwer Academic.
87. Liepins, G. E., et al. 1990. Genetic algorithm applications to set covering and traveling salesman problems. In Operations Research and Artificial Intelligence, D. E. Brown and C.C. White (eds.), OR/AI: The Integration of Problem Solving Strategies. Norwell, MA: Kluwer Academic, pp. 29-57.
88. Schaffer, J. D., et al., 1989. A study of control parameters affecting online performance of genetic algorithms for function optimization. In J.D. Schaffer (ed.), Proc. 3rd Int. Conf. on Genetic Algorithms. Los Altos, CA: Morgan Kaufmann, pp. 51-60.
89. Syswerda, G. 1989. Uniform crossover in genetic algorithms. In J.D. Schaffer (ed.), Proc. 3rd Int. Conf. on Genetic Algorithms. Los Altos, CA: Morgan Kaufmann, pp. 2-9.
90. Syswerda, G. 1991. Schedule optimization using genetic algorithms. In L. Davis (ed.), Handbook of Genetic Algorithms. New York:Van Nostrand Reinhold, p. 347.
91. Taub, H., D. L. Schilling. 1986. Principles of Communication Systems. New York: McGraw-Hill.
92. Watson, J.-P. 1999. A performance assessment of modern niching methods for parameter optimization problems. Genetic and Evolutionary Computation Conf. GECCO-1999, Orlando, FL: Morgan Kaufmann.
93. Zitzler, E., L. Thiele. 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3:257-271.
94. Beychok, M. R. 1994. Fundamentals of Stack Gas Dispersion, 3rd ed. Irvine, CA: Milton Beychok.
95. Boyd, J. P. 1986. Solitons from sine waves: Analytical and numerical methods for nonintegrable solitary and cnoidal waves. Physica 21D:227-246.
96. Branstator, G., S. E. Haupt. 1998. An empirical model of barotropic atmospheric dynamics and its response to forcing. J. Climate 11:2645-2667.
97. Cartwright, H. M., S. P. Harris. 1993. Analysis of the distribution of airborne pollution using GAs. Atmos. Environ 27A:1783-1791.
98. Chambers, L. (ed.). 1995. GAs, Applications, Vol. 1. New York: CRC Press.
99. Davidor, Y. 1991. GAs and Robotics. River Edge, NJ:World Scientific.
100. Davis, L. 1991. Handbook of GAs. New York:Van Nostrand Reinhold.
101. Fausett, L. 1994. Fundamentals of Neural Networks: Architectures, Algorithms, and Applications. Upper Saddle River, NJ: Prentice Hall.
102. Hagan, M.T., H. B. Demuth, and M. Beale. 1995. Neural Network Design. Boston: PWS.
103. Hasselmann, K. 1976. Stochastic climate models. Part I: Theory. Tellus 28:473-485.
104. Haupt, R. L. 1995. An introduction to GAs for electromagnetics. IEEE Ant. Propagat. Mag. 37:7-15.
105. Haupt, S. E. 1988. Solving nonlinear wave problems with spectral boundary value techniques. Ph.D. dissertation. University of Michigan, Ann Arbor.
106. Haupt, S. E., J. P. Boyd. 1988. Modeling nonlinear resonance: A modification to the Stokes' perturbation expansion. Wave Motion 10:83-98.
107. Haupt, S. E., J. P. Boyd. 1988. Double cnoidal waves of the Korteweg De Vries equation: Solution by the spectral boundary value approach. Physica 50D:117-134.
108. Holland, J. H. 1992. Genetic Algorithms. Sci. Am. 267:66-72.
109. Karr, C. L. 2003. Minimization of sonic boom using an evolutionary algorithm. Paper AIAA 2003-0463. 40st AIAA Aerospace Sciences Meeting and Exhibit, Reno, NV.
110. Karr, C. L., I.Yakushin, and K. Nicolosi. 2001. Solving inverse initial-value, boundaryvalue problems via GA. Eng. Appl. Art. Intell. 13:625-633.
111. Kirkpatrick, S., C.D. Gelatt, and M.P.Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
112. Koza, J. R. 1992. The Genetic Programming Paradigm: Genetically Breeding Populations of Computer Programs to Solve Problems. In B. Soucek (ed.), Dynamic, Genetic, and Chaotic Programming: The Sixth Generation. New York: J.Wiley, pp. 203-321.
113. Loughlin, D. H., S. R. Ranjithan, J.W. Baugh, Jr., E. D. Brill Jr. 2000. Application of GAs for the design of ozone control strategies. J. Air Waste Manage. Assoc. 50:1050-1063.
114. Penland, C. 1996. A stochasic model of IndoPacific sea surface temperature anomalies. Physica 98D:534-558.
115. Penland, C., M. Ghil. 1993. Forecasting northern hemisphere 700 mb geopotential height anomalies using empirical normal modes. Mon.Weather Rev. 121:2355.
116. Penland, C., T. Magorian. 1993. Prediction of NINO3 sea-surface temperatures using linear inverse modeling. J. Climate 6:1067.
117. Whitley, D., T. Starkweather, and D. Shaner. 1991.The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In L. Davis (ed.), Handbook of GAs. New York:Van Nostrand Reinhold.
118. Widrow, B., S.D. Sterns, 1985. Adaptive Signal Processing. Upper Saddle River, NJ: Prentice-Hall.
119. Yao, X. (ed.). 1995. Progress in Evolutionary Computation. New York: Springer-Verlag.
120. Ahuja, R. K., J. B. Orlin. 2003.Very large-scale neighborhood search in airline fleet scheduling. SIAM News 35:11-13.
121. Bäck, T. 1997. Evolutionary computation: comments on the history and current state. IEEE Trans. Evol. Comput. 1:3-17.
122. Bonabeau, E., M. Dorigo, and G. Theraulaz. 1999. Swarm Intelligence from Natural to Artificial Systems. New York: Oxford University Press.
123. Dorigo, M., G. Maria. 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1:53-66.
124. Fogel, L. J., A. J. Owens, and M.J.Walsh. 1966. Artificial Intelligence through Simulated Evolution. New York:Wiley.
125. Graham, P. 1995. ANSI Common LISP. Upper Saddle River, NJ: Prentice Hall.
126. Harvey, B., M. Wright. 1994. Simply Scheme: Introducing Computer Science. Cambridge: MIT Press.
127. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
128. Kennedy, J., R. C. Eberhart. 2001. Swarm Intelligence. San Francisco: Morgan Kaufmann.
129. Kennedy, J., R. C. Eberhart. 1995. Particle swarm optimization. Proc. IEEE Int. Conf. on Neural Networks, IV. Piscataway, NJ: IEEE Service Center, pp. 1942-1948.
130. Kirkpatrick, S., C. D. Gelatt Jr., M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
131. Koza, J. R. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge: MIT Press.
132. Koza, J. R. 1994. Genetic Programming II:Automatic Discovery of Reusable Programs, Cambridge: MIT Press.
133. Koza, J. R., et al. 1999. Genetic Programming III: Darwinian Invention and Problem Solving. San Francisco: Morgan Kaufmann.
134. Parsopoulos, K. E., M.N. Vrahatis. 2002. Recent approaches to global optimization problems through particle swarm optimization. In Natural Computing. Netherlands: Kluwer Academic, 1:235-306.
135. Ray, T., K. M. Liew. 2003. Society and civilization: An optimization algorithm based on the simulation of social behavior. IEEE Trans. Evol. Comput. 7:386-396.
136. Rechenberg, I. 1965. Cybernetic solution path of an experimental problem. In Royal Aircraft Establishment, Library Translation 1122. Farnborough, Hants, England.
137. Reynolds, R. G. 1994. An Introduction to Cultural Algorithms. In A.V. Sebald and L.J. Fogel (eds), Proc. 3rd An. Conf. on Evolutionary Programming. River Edge, NJ: World Scientific, pp. 131-139.
138. Schwefel, H. 1995. Evolution and Optimum Seeking. New York:Wiley.
139. Wolpert, D. H., W. G. Macready. 1997. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1:67-82.