2007
DOI: 10.1142/s0218213007003370
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Learning Search, a New Tool to Help Comprehending Metaheuristics

Abstract: The majority of the algorithms used to solve hard optimization problems today are population metaheuristics. These methods are often presented under a purely algorithmic angle, while insisting on the metaphors which led to their design. We propose in this article to regard population metaheuristics as methods making evolution a probabilistic sampling of the objective function, either explicitly, implicitly, or directly, via processes of learning, diversification, and intensification. We present a synthesis of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…Several other taxonomies of metaheuristic algorithms can be seen in Kumar and Bawa (2018); Shaheen et al (2018); DrEO et al (2007); Beheshti and Shamsuddin (2013); Gogna and Tayal (2013); Hussien et al (2020); Kumar and Bawa (2020); Abdel-Basset et al (2018). Fig.…”
Section: Classification Of Metaheuristic Algorithmsmentioning
confidence: 99%
“…Several other taxonomies of metaheuristic algorithms can be seen in Kumar and Bawa (2018); Shaheen et al (2018); DrEO et al (2007); Beheshti and Shamsuddin (2013); Gogna and Tayal (2013); Hussien et al (2020); Kumar and Bawa (2020); Abdel-Basset et al (2018). Fig.…”
Section: Classification Of Metaheuristic Algorithmsmentioning
confidence: 99%
“…While the algorithm proceeds on a dimension, other dimensions are left apart. The final algorithm is presented in Algorithm 1: Tests (figures 5, 6 and 7) were performed using the Open Metaheuristic project platform (see Dréo et al (2007) and Dréo et al (2005) for more information). We used a set of dynamic continuous test functions that we introduced in Dréo et al (2007).…”
Section: Cando: Charged Ants For Continuous Dynamic Optimizationmentioning
confidence: 99%
“…The final algorithm is presented in Algorithm 1: Tests (figures 5, 6 and 7) were performed using the Open Metaheuristic project platform (see Dréo et al (2007) and Dréo et al (2005) for more information). We used a set of dynamic continuous test functions that we introduced in Dréo et al (2007). Adding electrostatic charges to the ants has enhanced the found solution on the totality of the dynamic test functions (see tables 1, 2 and 3).…”
Section: Cando: Charged Ants For Continuous Dynamic Optimizationmentioning
confidence: 99%
“…For that reason the framework's development was focused on a series of concepts extracted from the Adaptive Learning Search known as ALS [11] for defining metaheuristics. In the ALS framework, metaheuristics are composed by a series of operators which interact between them through cooperation strategies.…”
Section: Pals Modeling Processmentioning
confidence: 99%