Crossover can provably be useful in evolutionary computation (Q418021)

From MaRDI portal
Revision as of 16:56, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Crossover can provably be useful in evolutionary computation
scientific article

    Statements

    Crossover can provably be useful in evolutionary computation (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    The authors try to prove that the use of the crossover operator in evolutionary computation is beneficial. They use the all-pairs shortest (APSP) problem to prove that the use of crossover made a natural evolutionary algorithm significantly faster. Under these circumstances, it seems that this is the first non-artificial approach to answer the question: ``How important is the crossover in evolutionary computation?''
    0 references
    evolutionary computation
    0 references
    crossover
    0 references
    mutation
    0 references
    all-pairs shortest path (APSP) problem
    0 references
    0 references
    0 references

    Identifiers