In a variety of disciplines, genetic and evolutionary algorithms (GEAs) have frequently solved optimization issues with enviable success.
This book's objective is to present efficient optimization techniques for using evolutionary mechanisms to swiftly, precisely, and consistently solve a wide range of problems. Five important concerns have been looked into in this regard:
- Bridging the gap between theory and practice of GEAs, thereby providing practical design guidelines.
- Demonstrating the practical use of the suggested road map.
- Offering a useful tool to significantly enhance the exploratory power in time-constrained and memory-limited applications.
- Providing a class of promising procedures that are capable of scalably solving hard problems in the continuous domain.
- Opening an important track for multiobjective GEA research that relies on the decomposition principle.
This book serves to play a decisive role in bringing forth a paradigm shift in future evolutionary computation.