Efficient Optimization Using Metaheuristics

Efficient Optimization Using Metaheuristics

Sergio Nesmachnow (Universidad de la República, Uruguay)
Copyright: © 2018 |Pages: 11
DOI: 10.4018/978-1-5225-2255-3.ch669


This chapter provides an insight into the main concepts, theoretical advances, and experimental results in the field of metaheuristics, when applied for efficiently solving real-world optimization problems. A general view of the most well-known metaheuristic methods is presented. After that, relevant applications of metaheuristics in nowadays real-world problems from several domains are described, highlighting on their capabilities to solve complex problems with high efficiency. Finally, the main current and future research lines in the field are also summarized and commented.
Chapter Preview


Metaheuristics are high-level soft computing strategies that define algorithmic frameworks and techniques to find approximate solutions for optimization problems (Blum & Roli, 2003; Talbi, 2009). Many efficient and accurate metaheuristics have been proposed, which can be applied to solve a variety of optimization problems underlying many applications in science/technology, industry, and commerce.

Metaheuristics Concepts: Definition and Classification

Metaheuristics were originally proposed as high-level problem-independent strategies to coordinate several heuristic search methods, which can be instantiated to solve hard problems. This definition has broadened to include a wide range of search and learning processes (including shaking, construction/deconstruction, adaptation, swarming and collective behavior, hybridization, etc.) applied to improve the search.

The heuristic components in a metaheuristic are conceived to be applied in an intelligent way, providing accurate and balanced methods for diversification and intensification. These two concepts are very important to guarantee the efficacy of the search: diversification refers to achieving a good exploration pattern for the search space, providing a reasonable coverage and avoiding stagnation in local optima; intensification means exploiting or improving already found accurate solutions to increase their quality.

Regarding the number of solutions handled, metaheuristics are classified in two classes: trajectory-based and population-based. Trajectory-based metaheuristics work with a single solution, which is replaced by another (often the best) solution found in its neighborhood. The search is characterized by a trajectory in the space of solutions. Trajectory metaheuristics allow quickly exploiting solutions, thus they are referred as intensification-oriented methods. On the other hand, population-based metaheuristics work with a set of candidate solutions, which are modified and/or combined following some common guidelines. Some solutions in the population are replaced by newly generated solutions (often the best). These methods are characterized as diversification-oriented, because having multiple solutions allows significantly increasing the exploration capabilities.

Other classification criteria for metaheuristics are related to specific features of the search strategy, for example: memory vs. memory-less, or dynamic vs. static objective function.

Key Terms in this Chapter

Trajectory Metaheuristics: Methods that work with a single solution, which is iteratively replaced by another one in its neighborhood.

Metaheuristics: High-level strategies that define algorithms to find approximate solutions for optimization problems.

Diversification: Exploration of the search space providing a reasonable coverage and avoiding stagnation in local optima.

Parallel Metaheuristics: Models that use several computing elements for enhancing and speeding up the search.

Population Metaheuristics: Methods that work with a set of solutions, which are iteratively modified and/or combined to produce new solutions.

Intensification: Exploitation of already found accurate solutions to increase their quality.

Complete Chapter List

Search this Book: