Fourier Analysis of Genetic Algorithms
✍ Scribed by Walter A. Kosters; Joost N. Kok; Patrik Floréen
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 358 KB
- Volume
- 229
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Fourier method is used to analyze the dispersive, dissipative, and isotropy errors of various spatial and time discretizations ap-ized to include the modeling of curved surfaces [8][9] and plied to the Maxwell equations on multi-dimensional grids. Both body oriented grids [10][11][12][13]. It is
Battle, D.L. and M.D. Vose, Isomorphisms of genetic algorithms (Research Note), Artificial Intelligence 60 (1993) 155-165. We begin with the premise that the role of Holland schemata in directing genetic search should be granted both as a matter of empirical fact and as a natural consequence of the
In this paper, we deal with promising crossover operators developed in the genetic algorithm (GA) and analyze the performance of these crossovers on the traveling salesman problem (TSP) which is one of the most popular NP-hard problems. Many crossovers that efficiently generate good solutions have b
In application to numerical analysis of geotechnical problems, the limit-state surface is usually not known in any closed form. The probability of failure can be assessed via the so-called reliability index. A minimization problem can naturally be formed with an implicit equality constraint defined