134 research outputs found
Spiral extrusion die design using modified differential evolution algorithm
In this work, a spiral extrusion die for industrial production of plastic foil has been designed using a modified differential evolution algorithm. The proposed method managed to provide a die design that was compliant with all demands of the foil manufacturer and lowered the production cost. Third-Party software is used to compute the die characteristics from the geometry designed by modified differential evolution. © 2019, Brno University of Technology. All rights reserved
Self-organizing migrating algorithm with clustering-aided migration and adaptive perturbation vector control
The paper proposes the Self-organizing Migrating Algorithm with CLustering-aided migration and adaptive Perturbation vector control (SOMA-CLP). The SOMA-CLP is the next iteration of the SOMA-CL algorithm, further enhanced by the linear adaptation of the prt control parameter used to generate a perturbation vector. The latest CEC 2021 benchmark set on a single objective bound-constrained optimization was used for the performance measurement of the improved variant. The proposed algorithm SOMA-CLP results were compared and tested for statistical significance against four other SOMA variants. © 2021 ACM.IGA/CebiaTech/2021/00
Orthogonal Learning Firefly Algorithm
The primary aim of this original work is to provide a more in-depth insight into the relations between control parameters adjustments, learning techniques, inner swarm dynamics and possible hybridization strategies for popular swarm metaheuristic Firefly Algorithm (FA). In this paper, a proven method, orthogonal learning, is fused with FA, specifically with its hybrid modification Firefly Particle Swarm Optimization (FFPSO). The parameters of the proposed Orthogonal Learning Firefly Algorithm are also initially thoroughly explored and tuned. The performance of the developed algorithm is examined and compared with canonical FA and above-mentioned FFPSO. Comparisons have been conducted on well-known CEC 2017 benchmark functions, and the results have been evaluated for statistical significance using the Friedman rank test. © 2020 The Author(s).Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [LO1303 (MSMT-7778/2014)]; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/CebiaTech/2020/001]; COST (European Cooperation in Science & Technology) under Action, Improving Applicability of NatureInspired Optimisation by Joining Theory and Practice (ImAppNIO) [CA15140]IGA/CebiaTech/2020/001; European Cooperation in Science and Technology, COST: CA15140; Ministerstvo Školství, Mládeže a Tělovýchovy, MŠMT: LO1303, MSMT-7778/2014; European Regional Development Fund, ERDF: CZ.1.05/2.1.00/03.008
SOMA-CLP for competition on bound constrained single objective numerical optimization benchmark: A competition entry on bound constrained single objective numerical optimization at the genetic and evolutionary computation conference (GECCO) 2021
The paper represents a competition entry for the competition on bound constrained single objective numerical optimization at The Genetic and Evolutionary Computation Conference (GECCO) 2021 by a novel algorithm titled Self-organizing Migrating Algorithm with CLustering-aided migration and adaptive perturbation vector control (SOMA-CLP). © 2021 Owner/Author.IGA/CebiaTech/2021/00
Clustering Analysis of the Population in Db_SHADE Algorithm
This paper provides an analysis of the population clustering in a novel Success-History based Adaptive Differential Evolution algorithm with Distance based adaptation (Db_SHADE) in order to analyze the exploration and exploitation abilities of the algorithm. The comparison with the original SHADE algorithm is performed on the CEC2015 benchmark set in two dimensional settings (10D and 30D). The clustering analysis helps to answer the question about prolonged exploration phase of the Db_SHADE algorithm. Possible future research directions are drawn in the discussion and conclusion
Analysing knowledge transfer in SHADE via complex network
In this research paper a hybridization of two computational intelligence fields, which are evolutionary computation techniques and complex networks (CNs), is presented. During the optimization run of the success-history based adaptive differential evolution (SHADE) a CN is built and its feature, node degree centrality, is extracted for each node. Nodes represent here the individual solutions from the SHADE population. Edges in the network mirror the knowledge transfer between individuals in SHADE's population, and therefore, the node degree centrality can be used to measure knowledge transfer capabilities of each individual. The correlation between individual's quality and its knowledge transfer capability is recorded and analyzed on the CEC2015 benchmark set in three different dimensionality settings-10D, 30D and 50D. Results of the analysis are discussed, and possible directions for future research are suggested.Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [LO1303 (MSMT-7778/2014)]; Internal Grant Agency of Tomas Bata University [IGA/CebiaTech/2018/003]; COST (European Cooperation in Science & Technology), Improving Applicability of NatureInspired Optimisation by Joining Theory and Practice (ImAppNIO) [CA15140]; COST (European Cooperation in Science & Technology), HighPerformance Modelling and Simulation for Big Data Applications (cHiPSet) [IC1406]; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089
Particle Swarm Optimization with Distance Based Repulsivity
In this study, we propose a repulsive mechanism for the Particle Swarm Optimization algorithm that improves its performance on multi-modal problems. The repulsive mechanism is further extended with a distance-based modification. The results are presented and tested for statistical significance. We discuss the observations and propose further directions for the research
Explaining SOMA: The relation of stochastic perturbation to population diversity and parameter space coverage
The Self-Organizing Migrating Algorithm (SOMA) is enjoying a renewed interest of the research community, following recent achievements in various application areas and renowned performance competitions. In this paper, we focus on the importance and effect of the perturbation operator in SOMA as the perturbation is one of the fundamental inner principles of SOMA. In this in-depth study, we present data, visualizations, and analysis of the effect of the perturbation on the population, its diversity and average movement patterns. We provide evidence that there is a direct relation between the perturbation intensity (set by control parameter prt) and the rate of diversity loss. The perturbation setting further affects the exploratory ability of the algorithm, as is demonstrated here by analysing the parameter space coverage of the population. We aim to provide insight and explanation of the impact of perturbation in SOMA for future researchers and practitioners. © 2021 ACM.IGA/CebiaTech/2021/00
Relation of neighborhood size and diversity loss rate in particle swarm optimization with ring topology
Measuring the population diversity in metaheuristics has become a common practice for adaptive approaches, aiming mainly to address the issue of premature convergence. Understanding the processes leading to a diversity loss in a metaheuristic algorithm is crucial for designing successful adaptive approaches. In this study, we focus on the relation of the neighborhood size and the rate of diversity loss in the Particle Swarm Optimization algorithm with local topology (also known as LPSO). We argue that the neighborhood size is an important input to consider when designing any adaptive approach based on the change of population diversity. We used the extensive benchmark suite of the IEEE CEC 2014 competition for experiments. © 2021, Brno University of Technology. All rights reserved.Univerzita Tomáše Bati ve Zlíně: IGA/CebiaTech/2021/00
Differential Evolution and Deterministic Chaotic Series: A Detailed Study
This research represents a detailed insight into the modern and popular hybridization of deterministic chaotic dynamics and evolutionary computation. It is aimed at the influence of chaotic sequences on the performance of four selected Differential Evolution (DE) variants. The variants of interest were: original DE/Rand/1/ and DE/Best/1/ mutation schemes, simple parameter adaptive jDE, and the recent state of the art version SHADE. Experiments are focused on the extensive investigation of the different randomization schemes for the selection of individuals in DE algorithm driven by the nine different two-dimensional discrete deterministic chaotic systems, as the chaotic pseudorandom number generators. The performances of DE variants and their chaotic/non-chaotic versions are recorded in the one-dimensional settings of 10D and 15 test functions from the CEC 2015 benchmark, further statistically analyzed
- …