Self-Adaptive Heuristics for Evolutionary Computation: Studies in Computational Intelligence, cartea 147
Autor Oliver Krameren Limba Engleză Hardback – 19 aug 2008
This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 640.51 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 28 oct 2010 | 640.51 lei 6-8 săpt. | |
Hardback (1) | 645.14 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 19 aug 2008 | 645.14 lei 6-8 săpt. |
Din seria Studies in Computational Intelligence
- 50% Preț: 264.48 lei
- 20% Preț: 1158.26 lei
- 20% Preț: 986.66 lei
- 20% Preț: 1452.76 lei
- 20% Preț: 168.78 lei
- 18% Preț: 1112.30 lei
- 20% Preț: 565.38 lei
- 20% Preț: 649.28 lei
- 20% Preț: 1047.73 lei
- 20% Preț: 1578.96 lei
- 20% Preț: 643.50 lei
- 20% Preț: 657.49 lei
- 20% Preț: 993.28 lei
- 20% Preț: 990.80 lei
- 20% Preț: 989.96 lei
- 20% Preț: 1165.69 lei
- 20% Preț: 1444.52 lei
- 20% Preț: 1041.96 lei
- 20% Preț: 1047.73 lei
- 20% Preț: 1046.06 lei
- 18% Preț: 2500.50 lei
- 20% Preț: 989.13 lei
- 20% Preț: 1165.69 lei
- 20% Preț: 1164.05 lei
- 20% Preț: 1042.79 lei
- 20% Preț: 1460.19 lei
- 18% Preț: 1403.52 lei
- 18% Preț: 1124.92 lei
- 20% Preț: 1039.47 lei
- 20% Preț: 1008.11 lei
- 20% Preț: 1045.25 lei
- 20% Preț: 1275.42 lei
- 20% Preț: 1040.32 lei
- 20% Preț: 988.32 lei
- 20% Preț: 1169.79 lei
- 20% Preț: 1162.37 lei
- 20% Preț: 1059.26 lei
- 20% Preț: 1164.05 lei
- 20% Preț: 1166.52 lei
- 20% Preț: 1459.38 lei
- 18% Preț: 1005.74 lei
- 20% Preț: 997.38 lei
- 20% Preț: 1055.94 lei
- 20% Preț: 1284.47 lei
- 20% Preț: 994.08 lei
- 20% Preț: 1048.72 lei
- 20% Preț: 1066.02 lei
- 20% Preț: 943.78 lei
- 20% Preț: 1173.10 lei
- 20% Preț: 1457.72 lei
Preț: 645.14 lei
Preț vechi: 806.42 lei
-20% Nou
Puncte Express: 968
Preț estimativ în valută:
123.48€ • 127.25$ • 104.25£
123.48€ • 127.25$ • 104.25£
Carte tipărită la comandă
Livrare economică 04-18 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540692805
ISBN-10: 3540692800
Pagini: 180
Ilustrații: XII, 182 p. 39 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540692800
Pagini: 180
Ilustrații: XII, 182 p. 39 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
I: Foundations of Evolutionary Computation.- Evolutionary Algorithms.- Self-Adaptation.- II: Self-Adaptive Operators.- Biased Mutation for Evolution Strategies.- Self-Adaptive Inversion Mutation.- Self-Adaptive Crossover.- III: Constraint Handling.- Constraint Handling Heuristics for Evolution Strategies.- IV: Summary.- Summary and Conclusion.- V: Appendix.- Continuous Benchmark Functions.- Discrete Benchmark Functions.
Textul de pe ultima copertă
Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves.
This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.
This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.
Caracteristici
Presents recent research on Self-Adaptive Heuristics for Evolutionary Computation