Introductory Chapter: Nature-Inspired Methods for Stochastic, Robust, and Dynamic Optimization

Abstract

Optimization is one of the most studied fields in the wide field of artificial intelligence. Hundreds of studies published year after year focus on solving many diverse problems of this kind by resorting to a vast spectrum of solvers. Within this class of problems, several problem flavors can be identified depending on the characteristics of their constituent fitness functions and support of their optimization variables, such as linear, continuous or combinatorial. Efficiently tackling such optimization problems requires huge computational resources, especially when the formulated problem at hand represents complex real-world situations with hundreds of variables and constraints. For these reasons and due to the inherently practical utility of optimization algorithms, very heterogeneous problem-solving approaches have been developed by the community over the last decades for their application to these problems. From a general perspective, optimization methods can be classified as exact, heuristics, and metaheuristics. In this chapter, the focus is placed on the latter two families, in particular in those algorithmic variants where biological processes observed in nature have lied at the motivating core of the operators underlying their search mechanisms. In other words, we will center our attention on Nature-Inspired methods for efficient optimization and problem solving.