2016
DOI: 10.1016/j.jocs.2016.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Complex metaheuristics

Abstract: a b s t r a c tComplexity is a prevalent feature of numerous natural and artificial systems and as such has attracted much scientific interest in the last decades. The pursuit of computational tools capable of analyzing, modeling or designing systems exhibiting this complex nature -in which the properties of the system are not evident at the bottom level but emerge from its global structure -is a major issue. Metaheuristics can play here an important role due to its intrinsic adaptability and powerful optimiza… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…The goal of next sections is to establish a taxonomy of solution sets for (7) that corresponds to the local taxonomy of the IPP's ill-conditioning. Such a taxonomy will be convenient for studying the features of complex solving strategies (e.g., memetic strategies [7]) that combine a global stochastic search with various algorithms that improve the search results locally. The latter can be both stochastic or deterministic and can either speed up finding isolated local minimizers or approximate the shapes of areas on which the objective attains a locally minimal constant value.…”
Section: Global Optimization Problems In Continuous Domainsmentioning
confidence: 99%
“…The goal of next sections is to establish a taxonomy of solution sets for (7) that corresponds to the local taxonomy of the IPP's ill-conditioning. Such a taxonomy will be convenient for studying the features of complex solving strategies (e.g., memetic strategies [7]) that combine a global stochastic search with various algorithms that improve the search results locally. The latter can be both stochastic or deterministic and can either speed up finding isolated local minimizers or approximate the shapes of areas on which the objective attains a locally minimal constant value.…”
Section: Global Optimization Problems In Continuous Domainsmentioning
confidence: 99%