Bernardo Morales Castañeda

Designing new algorithms in swarm intelligence is a complex undertaking. Two critical factors have been seen to have a direct correlation with positive results. First is initialization, which serves as the initial step for all swarm intelligence techniques. Candidate solutions are generated to form the initial population, which are subsequently modified during the iterative process. A well-initialized population increases the algorithm's chances of avoiding local optima and finding the global optimum in fewer iterations. Although random distributions are commonly used for initialization, there are various ways to initialize the population elements. Maintaining diversity among the population elements throughout the iterative process is also essential. This diversity facilitates a more thorough and efficient exploration of the search space. In swarm intelligence algorithms, there are multiple methods to measure diversity, each with its own advantages and disadvantages. This book presents the theory behind the initialization process and the different mechanisms. Additionally, it includes a comparative study of various diversity indicators. It explores different methodologies to compute its value and explains how it can be incorporated as a mechanism for deciding when to apply operators during the optimization process. Multiple examples are provided in the book using two classical algorithms: Differential Evolution and Particle Swarm Optimization. It includes MATLAB® code and offers several exercises that readers can use for experimentation and design purposes.

This book encompasses three distinct yet interconnected objectives. Firstly, it aims to present and elucidate novel metaheuristic algorithms that feature innovative search mechanisms, setting them apart from conventional metaheuristic methods. Secondly, this book endeavors to systematically assess the performance of well-established algorithms across a spectrum of intricate and real-world problems. Finally, this book serves as a vital resource for the analysis and evaluation of metaheuristic algorithms. It provides a foundational framework for assessing their performance, particularly in terms of the balance between exploration and exploitation, as well as their capacity to obtain optimal solutions. Collectively, these objectives contribute to advancing our understanding of metaheuristic methods and their applicability in addressing diverse and demanding optimization tasks. The materials were compiled from a teaching perspective. For this reason, the book is primarily intended for undergraduate and postgraduate students of Science, Electrical Engineering, or Computational Mathematics. Additionally, engineering practitioners who are not familiar with metaheuristic computation concepts will appreciate that the techniques discussed are beyond simple theoretical tools because they have been adapted to solve significant problems that commonly arise in engineering areas.