A unification of the prevalent views on exploitation, exploration, intensification and diversification

  title={A unification of the prevalent views on exploitation, exploration, intensification and diversification},
  author={Francois Fagan and Jan H. van Vuuren},
  journal={Int. J. Metaheuristics},
Terms such as exploitation, exploration, intensification and diversification are routinely employed in the metaheuristic literature to explain empirical runtime performance. Six prevalent views on exploitation and exploration are identified in the literature, each expressing a different aspect of these notions. The consistency and meaningfulness of these views are substantiated by their deducibility from the proposed novel definitions of exploitation and exploration, based on the hypothetical… 
2 Citations

Figures and Tables from this paper

An overview of metaheuristics: accurate and efficient methods for optimisation
A general view of the field is presented, and a review of the main algorithms within the class of metaheuristics is reviewed, by introducing the main concepts behind their formulations and their application to solve real-world problems from several domains.


Exploration and exploitation in evolutionary algorithms: A survey
A fresh treatment is introduced that classifies and discusses existing work within three rational aspects: what and how EA components contribute to exploration and exploitation; when and how Exploration and exploitation are controlled; and how balance between exploration and exploited is achieved.
On Evolutionary Exploration and Exploitation
A survey of different operators, review existing viewpoints on exploration and exploitation, and point out some discrepancies between and problems with current views are pointed out.
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
A survey of the nowadays most important metaheuristics from a conceptual point of view and introduces a framework, that is called the I&D frame, in order to put different intensification and diversification components into relation with each other.
Balance between exploration and exploitation in genetic search
To make the algorithm more efficient, it is important to strike a balance between exploration and exploitation, and some results of research on ESs are showed.
Review of meta-heuristics and generalised evolutionary walk algorithm
  • Xin-She Yang
  • Computer Science
    Int. J. Bio Inspired Comput.
  • 2011
An overview of nature-inspired metaheuristic algorithms, from a brief history to their applications, to provide a unified view of metaheuristics by proposing a generalized evolutionary walk algorithm (GEWA).
Diversity-Guided Evolutionary Algorithms
The diversity-guided evolutionary algorithm (DGEA) uses the well-known distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection).
An Introduction to Fitness Landscape Analysis and Cost Models for Local Search
This chapter introduces and survey the literature on fitness landscape analysis for local search, placing the research in the context of a broader, critical classification scheme delineating methodologies by their potential to account for localSearch metaheuristic performance.
Metaheuristics: A bibliography
This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
Evolutionary Squeaky Wheel Optimization: A New Framework for Analysis
A formal framework for the analysis of Evolutionary SWO is proposed and it is found that the probabilities of states generally, but not always, increase with their fitness, which is quite different from the monotonicity expected in algorithms such as simulated annealing.
Review and Study of Genotypic Diversity Measures for Real-Coded Representations
This paper looks at surveys of GDMs published over the years for real-coded representations, and compares them based on a new benchmark, one that allows a better description of their behavior, to demonstrate that none of the available GDMs is able to reflect the true diversity of all search processes.