Eigenvector Crossover in the Efficient jSO Algorithm

Loading...
Thumbnail Image
Date
2019-06-24
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
Altmetrics
Abstract
In 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.
Description
Citation
Mendel. 2018 vol. 25, č. 1, s. 65-72. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/80
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license
http://creativecommons.org/licenses/by-nc-sa/4.0
Collections
Citace PRO