Skip to Main content Skip to Navigation
Book sections

Meta-heuristics and Artificial Intelligence

Abstract : Meta-heuristics are generic search methods that are used to solve challenging combinatorial problems. We describe these methods and highlight their common features and differences by grouping them in two main kinds of approaches: Pertur-bative meta-heuristics that build new combinations by modifying existing combinations (such as, for example, genetic algorithms and local search), and Constructive meta-heuristics that generate new combinations in an incremental way by using a stochastic model (such as, for example, estimation of distribution algorithms and ant colony optimization). These approaches may be hybridised, and we describe some classical hybrid schemes. We also introduce the notions of diversification (ex-ploration) and intensification (exploitation), which are shared by all these meta-heuristics: diversification aims at ensuring a good sampling of the search space and, therefore, at reducing the risk of ignoring a promising sub-area which actually contains high-quality solutions, whereas intensification aims at locating the best combinations within a limited region of the search space. Finally, we describe two applications of meta-heuristics to typical artificial intelligence problems: satisfiability of Boolean formulas, and constraint satisfaction problems.
Document type :
Book sections
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download
Contributor : Christine Solnon <>
Submitted on : Wednesday, April 10, 2019 - 9:38:50 AM
Last modification on : Wednesday, July 8, 2020 - 12:43:31 PM


Files produced by the author(s)


  • HAL Id : hal-02094881, version 1


Jin-Kao Hao, Christine Solnon. Meta-heuristics and Artificial Intelligence. Pierre Marquis; Odile Papini; Henri Prade. A Guided Tour of Artificial Intelligence Research - Volume II: AI Algorithms, Springer, pp.27-52, 2020, 978-3-030-06166-1. ⟨hal-02094881⟩



Record views


Files downloads