Main Metaheuristics Used for the Optimization of the Control of the Complex Systems

Pierre Borne () and Amira Gharbi ()
Additional contact information
Pierre Borne: Centre de recherche en informatique, signal et automatique deLille. Ecole Centrale de Lille
Amira Gharbi: Centre de recherche en informatique, signal et automatique deLille. Ecole Centrale de Lille

Chapter Chapter 2 in Computational Intelligence and Optimization Methods for Control Engineering, 2019, pp 31-49 from Springer

Abstract: Abstract Many optimization problems are usually NP-hard problems which prevent the implementation of exact solution methodologies. This is the reason why engineers prefer to use metaheuristics which are able to produce good solutions in a reasonable computation time. The metaheuristic approaches can be separated into two classes: the local search techniques and the global ones. Among the local search techniques, the taboo search and the simulated annealing are the most known. A possible acceleration of the convergence can be obtained by using tunneling algorithms. Concerning the global methods, the Genetic or Evolution Algorithms (GA), Ant Colony Optimization (ACO), and the Particle Swarm Optimization (PSO) are the most known.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-25446-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9783030254469

DOI: 10.1007/978-3-030-25446-9_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().