Estimation of distribution algorithm with scatter search for dynamic optimisation problems
Summary: Aiming at the trouble to track the optima in dynamic environments with estimation of distribution algorithms (EDAs). An estimation of distribution algorithm with scatter search (EDASS) is proposed in this paper. Its basic idea is to employ a scatter search to increase the diversity in a guided fashion and an adaptive leader clustering method to locate multiple local optima. Both the information of current population and the part history information were referred for building probability model. The experimental results show that the EDASS is effective for dynamic optimisation problems.
- Estimation of distribution algorithm combined with chaotic sequence for dynamic optimisation problems
- Extending a class of continuous estimation of distribution algorithms to dynamic problems
- Memory enhanced estimation of distribution algorithm in dynamic environments
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Advances in estimation of distribution algorithms
- A DE-based scatter search for global optimization problems
- Estimation of distribution algorithm combined with chaotic sequence for dynamic optimisation problems
- Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms
- Memory enhanced estimation of distribution algorithm in dynamic environments
- Multi-population based univariate marginal distribution algorithm for dynamic optimization problems
This page was built for publication: Estimation of distribution algorithm with scatter search for dynamic optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224014)
