Glowworm Swarm Optimization (GSO) Algorithm for Optimization Problems: A State-of-the-Art Review

2013 ◽  
Vol 421 ◽  
pp. 507-511 ◽  
Author(s):  
Nurezayana Zainal ◽  
Azlan Mohd Zain ◽  
Nor Haizan Mohamed Radzi ◽  
Amirmudin Udin

Glowworm Swarm Optimization (GSO) algorithm is a derivative-free, meta-heuristic algorithm and mimicking the glow behavior of glowworms which can efficiently capture all the maximum multimodal function. Nevertheless, there are several weaknesses to locate the global optimum solution for instance low calculation accuracy, simply falling into the local optimum, convergence rate of success and slow speed to converge. This paper reviews the exposition of a new method of swarm intelligence in solving optimization problems using GSO. Recently the GSO algorithm was used simultaneously to find solutions of multimodal function optimization problem in various fields in today industry such as science, engineering, network and robotic. From the paper review, we could conclude that the basic GSO algorithm, GSO with modification or improvement and GSO with hybridization are considered by previous researchers in order to solve the optimization problem. However, based on the literature review, many researchers applied basic GSO algorithm in their research rather than others.

Author(s):  
Yulong Tian ◽  
Tao Gao ◽  
Weifang Zhai ◽  
Yaying Hu ◽  
Xinfeng Li

In this paper, a genetic algorithm with sexual reproduction and niche selection technology is proposed. Simple genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for complex multimodal functions. To solve it, the frame and realization of niche genetic algorithm based on sexual reproduction are presented. Age and sexual structures are given to the individuals referring the sexual reproduction and “niche” phenomena, importing the niche selection technology. During age and sexual operators, different evolutionary parameters are given to the individuals with different age and sexual structures. As a result, this genetic algorithm can combat premature convergence and keep the diversity of population. The testing for Rastrigin function and Shubert function proves that the niche genetic algorithm based on sexual reproduction is effective.


2011 ◽  
Vol 308-310 ◽  
pp. 2431-2435 ◽  
Author(s):  
Na Li ◽  
Yuan Xiang Li ◽  
Zhi Guo Huang ◽  
Yong Wang

In multimodal optimization, the original differential evolution algorithm is easy to duplicate and miss points of the optimal value. To solve this problem, a modified differential evolution algorithm, called niche differential evolution (NDE), is proposed. In the algorithm, the basic differential evolution algorithm is improved based on the niche technology. The rationality to construct the proposed algorithm is discussed. Shubert function, a representative multimodal optimization problem is used to verify the algorithm. The results show that the proposed algorithm can find all global optimum points quickly without strict request for parameters, so it is a good approach to find all global optimum points for multimodal functions.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
YingChao Zhang ◽  
Xiong Xiong ◽  
QiDong Zhang

This paper presented an improved self-adaptive particle swarm optimization (IDPSO) algorithm with detection function to solve multimodal function optimization problems. To overcome the premature convergence of PSO in a short time, the evolution direction of each particle is redirected dynamically by tuning the three parameters of IDPSO in the evolution process. Numerical results on several benchmark functions indicate that the IDPSO strategy outperformed other variants of PSO.


Author(s):  
Yulong Tian ◽  
Tao Gao ◽  
Weifang Zhai ◽  
Yaying Hu ◽  
Xinfeng Li

In this paper, a genetic algorithm with sexual reproduction and niche selection technology is proposed. Simple genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for complex multimodal functions. To solve it, the frame and realization of niche genetic algorithm based on sexual reproduction are presented. Age and sexual structures are given to the individuals referring the sexual reproduction and “niche” phenomena, importing the niche selection technology. During age and sexual operators, different evolutionary parameters are given to the individuals with different age and sexual structures. As a result, this genetic algorithm can combat premature convergence and keep the diversity of population. The testing for Rastrigin function and Shubert function proves that the niche genetic algorithm based on sexual reproduction is effective.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Wang ◽  
Kun Cheng ◽  
Yan Huang ◽  
Bo Li ◽  
Xinggui Ye ◽  
...  

This paper presents a variant of multiscale quantum harmonic oscillator algorithm for multimodal optimization named MQHOA-MMO. MQHOA-MMO has only two main iterative processes: quantum harmonic oscillator process and multiscale process. In the two iterations, MQHOA-MMO only does one thing: sampling according to the wave function at different scales. A set of benchmark test functions including some challenging functions are used to test the performance of MQHOA-MMO. Experimental results demonstrate good performance of MQHOA-MMO in solving multimodal function optimization problems. For the 12 test functions, all of the global peaks can be found without being trapped in a local optimum, and MQHOA-MMO converges within 10 iterations.


2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.


Author(s):  
Bo-Suk Yang

This chapter describes a hybrid artificial life optimization algorithm (ALRT) based on emergent colonization to compute the solutions of global function optimization problem. In the ALRT, the emergent colony is a fundamental mechanism to search the optimum solution and can be accomplished through the metabolism, movement and reproduction among artificial organisms which appear at the optimum locations in the artificial world. In this case, the optimum locations mean the optimum solutions in the optimization problem. Hence, the ALRT focuses on the searching for the optimum solution in the location of emergent colonies and can achieve more accurate global optimum. The optimization results using different types of test functions are presented to demonstrate the described approach successfully achieves optimum performance. The algorithm is also applied to the test function optimization and optimum design of short journal bearing as a practical application. The optimized results are compared with those of genetic algorithm and successive quadratic programming to identify the optimizing ability.


Sign in / Sign up

Export Citation Format

Share Document