Committee login






Small thumbnail

Secure Connected Objects

Small thumbnail

Banach, Fréchet, Hilbert and Neumann Spaces

Analysis for PDEs Set – Volume 1

Small thumbnail

Semi-Markov Migration Models for Credit Risk

Stochastic Models for Insurance Set – Volume 1

Small thumbnail

Human Exposure to Electromagnetic Fields

From Extremely Low Frequency (ELF) to Radio Frequency

Small thumbnail

Enterprise Interoperability


Small thumbnail

Data Treatment in Environmental Sciences

Multivaried Approach

Small thumbnail

From Pinch Methodology to Pinch-Exergy Integration of Flexible Systems

Thermodynamics – Energy, Environment, Economy Set

Small thumbnail

Exterior Algebras

Elementary Tribute to Grassmann's Ideas

Small thumbnail

Nonlinear Theory of Elastic Plates

Small thumbnail

Cognitive Approach to Natural Language Processing

Small thumbnail

Guided Randomness in Optimization

Metaheuristics Set – Volume 1

Maurice Clerc, Consultant

ISBN: 9781848218055

Publication Date: May 2015   Hardback   316 pp.

135.00 USD

Add to cart




Optimization metaheuristics proceed to “pot luck” as to whether to carry out certain choices or apply certain rules, for which they must use one or several random number generators (RNGs).
There are several types of RNG, from the truly random to the simply coded. They can be manipulated to produce specific distributions.The performances of an algorithm depend on the RNG used.
This book concerns the comparison of optimizers, it defines an effort–result approach where all classical (median, average, etc.) and some more sophisticated criteria can be derived.
The source codes used for examples are also presented, which enables a reflection of the “unnecessary randomness”, succinctly explaining why and how the stochastic aspect of the optimization could be avoided in certain cases.


Part 1. Randomness in Optimization
1. Necessary Risk.
2. Random Number Generators (RNGS).
3. The Effects of Randomness.
Part 2. Optimizer Comparison
4. Algorithms and Optimizers.
5. Performance Criteria.
6. Comparing Optimizers.
Part 3. Appendices
7. Mathematical Notions.
8. Biases and Signatures.
9. A Pseudo-Scientific Article.
10. Common Mistakes.
11. Unnecessary Randomness? List-based Optimizers.
12. Problems.
13. Source Codes.

About the Authors

Maurice Clerc is a world-renowned specialist in particle swarm optimization. His research and consulting activities concern the resolution of optimization problems.


DownloadTable of Contents - PDF File - 50 Kb

Related Titles

0.02185 s.