On the Performance and Complexity of Crossover in Differential Evolution Algorithm

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F20%3AA21026EE" target="_blank" >RIV/61988987:17310/20:A21026EE - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-61401-0_34" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-61401-0_34</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-61401-0_34" target="_blank" >10.1007/978-3-030-61401-0_34</a>

Result language

angličtina

Original language name

On the Performance and Complexity of Crossover in Differential Evolution Algorithm

Original language description

In this study, the efficiency and complexity of four different crossover variants in Differential evolution (DE) algorithm are experimentally studied. Three well-known crossover variants with a newly designed crossover are applied in nine state-of-the-art and one standard DE algorithm. The results obtained from CEC 2011 real-world problems showed a significant difference between different DE variants and crossover types in performance and time complexity. Higher time complexity is for Eigen crossover, higher efficiency s for newly designed crossover.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Lecture Notes in Artificial Intelligence 12416

ISBN

978-3-030-61400-3

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

363-375

Publisher name

Springer

Place of publication

Cham, Switzerland

Event location

Zakopane, Polsko

Event date

Oct 12, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—