About this book
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes.
“Handbook of Memetic Algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now. A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem, memetic recipes for tackling the difficulties are given with some successful examples. Although this book contains chapters written by multiple authors, a great attention has been given by the editors to make it a compact and smooth work which covers all the main areas of computational intelligence optimization. It is not only a necessary read for researchers working in the research area, but also a useful handbook for practitioners and engineers who need to address real-world optimization problems. In addition, the book structure makes it an interesting work also for graduate students and researchers is related fields of mathematics and computer science.
Editors and affiliations
- DOI https://doi.org/10.1007/978-3-642-23247-3
- Copyright Information Springer-Verlag Berlin Heidelberg 2012
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Engineering
- Print ISBN 978-3-642-23246-6
- Online ISBN 978-3-642-23247-3
- Series Print ISSN 1860-949X
- Series Online ISSN 1860-9503
- About this book