Genetic algorithms + data structures = evolution programs / Zbigniew Michalewicz
Tipo de material:
TextoDetalles de publicación: Berlin : Springer, 1996 Edición: 3rd ed. rev.Descripción: XX, 387 p. : gráf. ; 25 cmISBN: 3-540-60676-9Tema(s): Algoritmos | Programación de ordenadoresResumen: Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.Resumen: INDICE: Introduction.- Part I. Genetic Algorithms. GAs: What Are They? - GAs: How Do They Work? - GAs: Why Do They Work? - GAs: Selected Topics.- Part II. Numerical Optimization. Binary or Float? - Fine Local Tuning.- Handling Constraints.- Evolution Strategies and Other Methods.- Part III. Evolution Programs. The Transportation Problem.- The Traveling Salesman Problem.- Machine Learning.- Evolutionary Programming and Genetic Programming.- A Hierarchy of Evolution Programs.- Evolution Programs and Heuristics.- Conclusions.- Appendices.- References.- Index.
| Tipo de ítem | Biblioteca de origen | Signatura | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems |
|---|---|---|---|---|---|---|---|
| Monografías | 02. BIBLIOTECA CAMPUS PUERTO REAL | 510.5/MIC/gen (Navegar estantería(Abre debajo)) | Disponible Ubicación en estantería | Bibliomaps® | 374506448X | |||
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 510.5/MIC/gen (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3741385755 | ||
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 510.5/MIC/gen (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3741384802 |
Navegando 03. BIBLIOTECA INGENIERÍA PUERTO REAL Estantes Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
Indice
Bibliografía: p. [361]-382
Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.
INDICE: Introduction.- Part I. Genetic Algorithms. GAs: What Are They? - GAs: How Do They Work? - GAs: Why Do They Work? - GAs: Selected Topics.- Part II. Numerical Optimization. Binary or Float? - Fine Local Tuning.- Handling Constraints.- Evolution Strategies and Other Methods.- Part III. Evolution Programs. The Transportation Problem.- The Traveling Salesman Problem.- Machine Learning.- Evolutionary Programming and Genetic Programming.- A Hierarchy of Evolution Programs.- Evolution Programs and Heuristics.- Conclusions.- Appendices.- References.- Index.
No hay comentarios en este titulo.