Estimation of distribution algorithm with scatter search for dynamic optimisation problems (Q2224014)

From MaRDI portal
Revision as of 22:14, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Estimation of distribution algorithm with scatter search for dynamic optimisation problems
scientific article

    Statements

    Estimation of distribution algorithm with scatter search for dynamic optimisation problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2021
    0 references
    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.
    0 references
    0 references
    estimation of distribution algorithms
    0 references
    EDAs
    0 references
    dynamic optimisation
    0 references
    clustering
    0 references
    scatter search
    0 references
    probability modelling
    0 references