Model Selecting PSO-FA Hybrid for Complex Function Optimization

2021 ◽  
Vol 12 (3) ◽  
pp. 215-232
Author(s):  
Heng Xiao ◽  
Toshiharu Hatanaka
Keyword(s):  
Model Selection ◽  
Swarm Intelligence ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Complex Function ◽  
Group Behavior ◽  
Black Box ◽  
Function Optimization ◽  
Selection Strategy ◽  
Natural Group

Swarm intelligence is inspired by natural group behavior. It is one of the promising metaheuristics for black-box function optimization. Then plenty of swarm intelligence algorithms such as particle swarm optimization (PSO) and firefly algorithm (FA) have been developed. Since these swarm intelligence models have some common properties and inherent characteristics, model hybridization is expected to adjust a swarm intelligence model for the target problem instead of parameter tuning that needs some trial and error approach. This paper proposes a PSO-FA hybrid algorithm with a model selection strategy. An event-driven trigger based on the personal best update makes each individual do the model selection that focuses on the personal study process. By testing the proposed hybrid algorithm on some benchmark problems and comparing it with a simple PSO, the standard PSO 2011, FA, HFPSO to show how the proposed hybrid swarm averagely performs well in black-box optimization problems.

An Effective and Efficient Hybrid Algorithm Based on HS–IWO for Global Optimization

2017 ◽  
Vol 32 (04) ◽  
pp. 1859006 ◽  
Author(s):  
Aijia Ouyang ◽  
Shuo Peng ◽  
Xuyu Peng ◽  
Qian Wang
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Harmony Search ◽  
Complex Function ◽  
Function Optimization ◽  
Invasive Weed ◽  
Local Optima ◽  
Intelligent Optimization Algorithms ◽  
Complex Functions ◽  
Limit Solutions

Considering that the invasive weed optimization (IWO) algorithm and the harmony search (HS) algorithm are inclined to fall into local optima with low convergence precision when they are used to deal with complex function optimization problems, this paper proposes a hybrid algorithm, HS–IWO algorithm, which is combined HS algorithm and IWO algorithm. We introduce strategies such as fixing the number of seeds, reinitializing limit solutions, multi-individual global HS, parameter optimization, etc. In order to make the two algorithms take advantage of their merits, they are mixed organically in this paper. Through tests on some complex functions of benchmark, the experimental results display that the HS–IWO algorithm has the efficiency and robustness of the algorithms. It is an optimization algorithm that is highly effective and stable, especially to be applied to the optimization of complicated functions compared with other intelligent optimization algorithms.

An Efficient Hybrid Algorithm Based on HS and SFLA

2016 ◽  
Vol 30 (05) ◽  
pp. 1659012 ◽  
Author(s):  
Aijia Ouyang ◽  
Xuyu Peng ◽  
Yanbin Liu ◽  
Lilue Fan ◽  
Kenli Li
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Harmony Search ◽  
Complex Function ◽  
Continuous Optimization ◽  
Function Optimization ◽  
Local Optima ◽  
Hybrid Mechanism ◽  
Complex Functions ◽  
Continuous Optimization Problems

When used for optimizing complex functions, harmony search (HS) and shuffled frog leaping algorithm (SFLA) algorithm tend to easily get trapped into local optima and result in low convergence precision. To overcome such shortcomings, a hybrid mechanism of selective search by combining HS algorithm and SFLA algorithm is as well proposed. An HS-SFLA algorithm is designed by taking the advantages of HS and SFLA algorithms. The hybrid algorithm of HS-SFLA is adopted for dealing with complex function optimization problems, the experimental results show that HS-SFLA outperforms other state-of-the-art intelligence algorithms significantly in terms of global search ability, convergence speed and robustness on 80% of the benchmark functions tested. The HS-SFLA algorithm could directly be applied to all kinds of continuous optimization problems in the real world.

Engineering Design Optimization Using an Advanced Hybrid Algorithm

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Design Optimization ◽  
Engineering Design ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Novel Mutation ◽  
Solution Space ◽  
Selection Strategy ◽  
Engineering Design Optimization ◽  
Global And Local ◽  
Search Capability

An advanced hybrid algorithm (haDEPSO) proposed in this paper for engineering design optimization problems. It integrated with suggested advanced differential evolution (aDE) and particle swarm optimization (aPSO). In aDE introduced a novel mutation, crossover and selection strategy, to avoiding premature convergence. And aPSO consists of novel gradually varying parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also, in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. Proposed hybrid haDEPSO as well as its integrating component aDE and aPSO has been applied to five engineering design optimization problems. Numerical, statistical and graphical experiments (best, worst, mean and standard deviation plus convergence analysis) confirm the superiority of the proposed algorithms over many state-of-the-art algorithms.

A Heuristic Algorithm Based on Leadership Strategy: Leader of Dolphin Herd Algorithm (LDHA)

2015 ◽  
Vol 19 (4) ◽  
pp. 491-499 ◽  
Author(s):  
Jianqiang Zhao ◽  
◽  
Kao Ge ◽  
Kangyao Xu
Keyword(s):  
Heuristic Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Complex Function ◽  
Predatory Behavior ◽  
Function Optimization ◽  
High Dimensional ◽  
Swarm Optimization ◽  
Leadership Strategy ◽  
Complex Functions

A heuristic algorithm named the leader of dolphin herd algorithm (LDHA) is proposed in this paper to solve an optimization problem whose dimensionality is not high, with dolphins that imitate predatory behavior. LDHA is based on a leadership strategy. Using the leadership strategy as reference, we have designed the proposed algorithm by simulating the preying actions of dolphin herds. Several intelligent behaviors, such as “producing leaders,” “group gathering,” “information sharing,” and “rounding up prey,” are abstracted by LDHA. The proposed algorithm is tested on 15 typical complex function optimization problems. The testing results reveal that compared with the particle swarm optimization and the genetic algorithms, LDHA has relatively high optimization accuracy and capability for complex functions. Further, it is almost unaffected by the inimicality, multimodality, or dimensions of functions in the function optimization section, which implies better convergence. In addition, ultra-high-dimensional function optimization capabilities of this algorithm were tested using the IEEE CEC 2013 global optimization benchmark. Unfortunately, the proposed optimization algorithm has a limitation in that it is not suitable for ultra-high-dimensional functions.

Research of Parallel Artificial Bee Colony Algorithm Based on MPI

2013 ◽  
Vol 380-384 ◽  
pp. 1430-1433 ◽  
Author(s):  
Ying Sen Hong ◽  
Zhen Zhou Ji ◽  
Chun Lei Liu
Keyword(s):  
Parallel Algorithm ◽  
Message Passing ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Complex Function ◽  
Function Optimization ◽  
Search Performance ◽  
Bee Colony ◽  
Long Time

Artificial bee colony algorithm is a smart optimization algorithm based on the bees acquisition model. A long time for the search of the artificial bee colony algorithm, in this paper we propose a parallel algorithm of artificial bee colony algorithm (MPI-ABC), with an application of a parallel programming environment MPI, using the programming mode of message passing rewriting the serial algorithm in parallel. Finally, this paper compare both serial and parallel algorithm with testing on complex function optimization problems. The experimental results show that the algorithm is effective to improve the search performance, especially for high-dimensional complex optimization problem.

Engineering Design Optimization Using an Advanced Hybrid Algorithm

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Design Optimization ◽  
Engineering Design ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Novel Mutation ◽  
Solution Space ◽  
Selection Strategy ◽  
Engineering Design Optimization ◽  
Global And Local ◽  
Search Capability

An advanced hybrid algorithm (haDEPSO) proposed in this paper for engineering design optimization problems. It integrated with suggested advanced differential evolution (aDE) and particle swarm optimization (aPSO). In aDE introduced a novel mutation, crossover and selection strategy, to avoiding premature convergence. And aPSO consists of novel gradually varying parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also, in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. Proposed hybrid haDEPSO as well as its integrating component aDE and aPSO has been applied to five engineering design optimization problems. Numerical, statistical and graphical experiments (best, worst, mean and standard deviation plus convergence analysis) confirm the superiority of the proposed algorithms over many state-of-the-art algorithms.

Forking Genetic Algorithms: GAs with Search Space Division Schemes

1997 ◽  
Vol 5 (1) ◽  
pp. 61-80 ◽  
Author(s):  
Shigeyoshi Tsutsui ◽  
Yoshiji Fujimoto ◽  
Ashish Ghosh
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Complex Function ◽  
Feature Space ◽  
Search Space ◽  
Function Optimization ◽  
The Other ◽  
Parent Population ◽  
New Type ◽  
Multimodal Problems

In this article, we propose a new type of genetic algorithm (GA), the forking GA (fGA), which divides the whole search space into subspaces, depending on the convergence status of the population and the solutions obtained so far. The fGA is intended to deal with multimodal problems that are difficult to solve using conventional GAs. We use a multi-population scheme that includes one parent population that explores one subspace and one or more child populations exploiting the other subspace. We consider two types of fGAs, depending on the method used to divide the search space. One is the genoqtypic fGA (g-fGA), which defines the search subspace for each subpopulation, depending on the salient schema within the genotypic search space. The other is the phenotypic fGA (p-fGA), which defines a search subspace by a neighborhood hypercube around the current best individual in the phenotypic feature space. Empirical results on complex function optimization problems show that both the g-fGA and the p-GA perform well compared to conventional GAs. Two additional utilities of the p-fGA are also studied briefly.

Sign in / Sign up

Export Citation Format

Share Document