2016
DOI: 10.2174/1874110x01610010020
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Learning Rate Elitism Estimation of Distribution Algorithm Combining Chaos Perturbation for Large Scale Optimization

Abstract: Estimation of distribution algorithm (EDA) is a kind of EAs, which is based on the technique of probabilistic model and sampling. Large scale optimization problems are a challenge for the conventional EAs. This paper presents an adaptive learning rate elitism EDA combining chaos perturbation (ALREEDA) to improve the performance of traditional EDA to solve high dimensional optimization problems. The famous elitism strategy is introduced to maintain a good convergent performance of this algorithm. The learning r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…Qingyang et al [24] worked on an adaptive learning rate elitism Estimation of Distribution Algorithm (EDA), a kind of Evolutionary Algorithm, combining chaos perturbation (ALREEDA) to improve the performance of traditional EDA to solve high dimensional optimization problems. Chen-Yang et al [25] focused on a hybrid algorithm called Hybrid Algorithm-Ant Colony Algorithm Genetic Algorithm (HA-ACAGA) to find optimal solutions for users on dynamic web service composition where user's personal preference is different and web services are massive and dynamic; they used a function to control individuals and a function to update pheromones.…”
Section: Adaptation and Self-adaptationmentioning
confidence: 99%
“…Qingyang et al [24] worked on an adaptive learning rate elitism Estimation of Distribution Algorithm (EDA), a kind of Evolutionary Algorithm, combining chaos perturbation (ALREEDA) to improve the performance of traditional EDA to solve high dimensional optimization problems. Chen-Yang et al [25] focused on a hybrid algorithm called Hybrid Algorithm-Ant Colony Algorithm Genetic Algorithm (HA-ACAGA) to find optimal solutions for users on dynamic web service composition where user's personal preference is different and web services are massive and dynamic; they used a function to control individuals and a function to update pheromones.…”
Section: Adaptation and Self-adaptationmentioning
confidence: 99%
“…The method retains the advantages of the genetic algorithm, and can purposefully and selectively use the relevant knowledge and information features in the problem to be solved to suppress the degradation phenomenon caused by some factors in the calculation process [19]. More and more scholars have begun to pay attention to the research, combining the algorithm with the immune algorithm [20], evolutionary algorithm [21], particle swarm optimization algorithm [22], and others [23], to improve the optimization performance of the algorithms. Hong et al [24] studied the convergence speed of the general artificial immune algorithm using random process theory instead of the eigenvalue estimation of traditional state transition matrix.…”
Section: Introductionmentioning
confidence: 99%