Metaheuristics for optimization problems

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An introduction to metaheuristics for optimization problems is presented in this chapter. In Sect. 3.1 a classification of metaheuristics is put forward. The metaheuristics Differential Evolution (DE); Particle Collision Algorithm (PCA); Ant Colony Optimization (ACO) in its version for continuous problems; and Particle Swarm Optimization (PSO) are described in Sects. 3.2, 3.3, 3.4 and 3.5, respectively. These metaheuristics were applied to he benchmark problems diagnosis described in Chap. 2, based on Fault Diagnosis-Inverse Problem Methodology (FD-IPM) as described in Chap. 2.

Cite

CITATION STYLE

APA

Camps Echevarría, L., Llanes Santiago, O., de Campos Velho, H. F., & da Silva Neto, A. J. (2019). Metaheuristics for optimization problems. In Studies in Computational Intelligence (Vol. 763, pp. 43–83). Springer Verlag. https://doi.org/10.1007/978-3-319-89978-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free