|
" Advances in metaheuristics algorithms : "
by Erik Cuevas, Daniel Zaldívar, Marco Pérez-Cisneros.
Document Type
|
:
|
BL
|
Record Number
|
:
|
865891
|
Main Entry
|
:
|
Cuevas, Erik
|
Title & Author
|
:
|
Advances in metaheuristics algorithms : : methods and applications /\ by Erik Cuevas, Daniel Zaldívar, Marco Pérez-Cisneros.
|
Publication Statement
|
:
|
Cham, Switzerland :: Springer,, 2018.
|
Series Statement
|
:
|
Studies in computational intelligence,; volume 775
|
Page. NO
|
:
|
1 online resource (xiv, 218 pages) :: illustrations (some color)
|
ISBN
|
:
|
3030077365
|
|
:
|
: 3319893092
|
|
:
|
: 3319893106
|
|
:
|
: 9783030077365
|
|
:
|
: 9783319893099
|
|
:
|
: 9783319893105
|
|
:
|
3319893084
|
|
:
|
9783319893082
|
Bibliographies/Indexes
|
:
|
Includes bibliographical references.
|
Contents
|
:
|
Introduction -- The metaheuristic algorithm of the social-spider -- Calibration of Fractional Fuzzy Controllers by using the Social-spider method -- The metaheuristic algorithm of the Locust-search -- Identification of fractional chaotic systems by using the Locust Search Algorithm -- The States of Matter Search (SMS) -- Multimodal States of Matter search -- Metaheuristic algorithms based on Fuzzy Logic.
|
Abstract
|
:
|
This book explores new alternative metaheuristic developments that have proved to be effective in their application to several complex problems. Though most of the new metaheuristic algorithms considered offer promising results, they are nevertheless still in their infancy. To grow and attain their full potential, new metaheuristic methods must be applied in a great variety of problems and contexts, so that they not only perform well in their reported sets of optimization problems, but also in new complex formulations. The only way to accomplish this is to disseminate these methods in various technical areas as optimization tools. In general, once a scientist, engineer or practitioner recognizes a problem as a particular instance of a more generic class, he/she can select one of several metaheuristic algorithms that guarantee an expected optimization performance. Unfortunately, the set of options are concentrated on algorithms whose popularity and high proliferation outstrip those of the new developments. This structure is important, because the authors recognize this methodology as the best way to help researchers, lecturers, engineers and practitioners solve their own optimization problems.
|
Subject
|
:
|
Heuristic programming.
|
Subject
|
:
|
Mathematical optimization.
|
Subject
|
:
|
Artificial intelligence.
|
Subject
|
:
|
Computers-- Intelligence (AI) Semantics.
|
Subject
|
:
|
Heuristic programming.
|
Subject
|
:
|
Mathematical optimization.
|
Dewey Classification
|
:
|
519.6
|
LC Classification
|
:
|
QA402.5
|
Added Entry
|
:
|
Pérez-Cisneros, Marco
|
|
:
|
Zaldívar, Daniel
|
| |