Eigenvector Crossover in the Efficient jSO Algorithm

Simple item page
dc.contributor.authorBujok, Petr
dc.contributor.authorPolakova, Radka
dc.coverage.issue1cs
dc.coverage.volume25cs
dc.date.accessioned2020-05-05T07:21:09Z
dc.date.available2020-05-05T07:21:09Z
dc.date.issued2019-06-24cs
dc.description.abstractIn this paper, a new variant of an efficient adaptive jSO algorithm is presented. The original jSO uses popular binomial crossover which is applied in a standard coordinate system. Many problems tend to rotate the coordinate system in one or more axes. This is the reason why a crossover variant using Eigen coordinate system replaces the original binomial version of crossover in jSO. The newly proposed jSOe performs significantly better compared with the original jSO when solving 90 problems of the CEC 2017 benchmark set.en
dc.formattextcs
dc.format.extent65-72cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationMendel. 2018 vol. 25, č. 1, s. 65-72. ISSN 1803-3814cs
dc.identifier.doi10.13164/mendel.2019.1.065en
dc.identifier.issn2571-3701
dc.identifier.issn1803-3814
dc.identifier.urihttp://hdl.handle.net/11012/186983
dc.language.isoencs
dc.publisherInstitute of Automation and Computer Science, Brno University of Technologycs
dc.relation.ispartofMendelcs
dc.relation.urihttps://mendel-journal.org/index.php/mendel/article/view/80cs
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International licenseen
dc.rights.accessopenAccessen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0en
dc.subjectdifferential evolutionen
dc.subjecteigenvector crossoveren
dc.subjectjSOen
dc.subjectexperimental comparisonen
dc.subjectCEC 2017en
dc.titleEigenvector Crossover in the Efficient jSO Algorithmen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2019-1-065.pdf
Size:
969.53 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Vol. 25, No. 1