Multi-swarm Optimization with Chaotic Mapping for Dynamic Optimization Problems

Author(s):  
Luyi Shen ◽  
Lihong Xu ◽  
Ruihua Wei ◽  
Leilei Cao
Processes ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1806
Author(s):  
Yuedong Zhang ◽  
Yuanbin Mo

The optimal solution of the chemical dynamic optimization problem is the basis of automatic control operation in the chemical process, which can reduce energy consumption, increase production efficiency, and maximize economic benefit. In this paper, a modified sailfish optimizer (MSFO) combined with an equal division method is proposed for solving chemical dynamic optimization problems. Based on the basic sailfish optimizer, firstly, the tent chaotic mapping strategy is introduced to disturb the initialization of sailfish and sardine populations to avoid the loss of population diversity. Secondly, an adaptive linear reduction strategy of attack parameters is proposed to enhance the exploration and exploitation ability of sailfish. Thirdly, the updating formula of sardine position is modified, and the global optimal solution is used to attract all sardine positions, which can avoid the premature phenomenon of the algorithm. Eventually, the MSFO is applied to solve six classical optimization cases of chemical engineering to evaluate its feasibility. The experimental results are analyzed and compared with other optimization methods to prove the superiority of the MSFO in solving chemical dynamic optimization problems.


2014 ◽  
Vol 571-572 ◽  
pp. 245-251
Author(s):  
Li Chen ◽  
Wei Jiang Wang ◽  
Lei Yao

Multiswarm approaches are used in many literatures to deal with dynamic optimization problems (DOPs). Each swarm tries to find promising areas where usually peaks lie and many good results have been obtained. However, steep peaks are difficult to be found with multiswarm approaches , which hinders the performance of the algorithm to be improved furtherly. Aiming at the bottleneck, the paper introduces the idea of sequential niche technique to traditional multiswarm approach and thus proposes a novel algorithm called reverse space search multiswarm particle swarm optimization (RSPSO) for DOPs. RSPSO uses the information of the peaks found by coarse search of traditional multiswarm approach to modify the original fitness function. A newly generated subswarm - reverse search subswarm evolves with the modified fitness function, at the same time, other subswarms using traditional mltiswarm approach still evolve. Two kinds of subswarm evolve in cooperation. Reverse search subswarm tends to find much steeper peak and so more promising area where peaks lie is explored. Elaborated experiments on MPB show the introduction of reverse search enhances the ability of finding peaks , the performance of RSPSO significantly outperforms traditional multiswarm approaches and it has better robustness to adapt to dynamic environment with wider-range change severity.


2014 ◽  
Vol 571-572 ◽  
pp. 232-236
Author(s):  
Li Chen ◽  
Ju Ming Liu ◽  
Jun Mei Ouyang

This paper proposes a multi-thread-memory particle swarm optimization (MTM-PSO) for dynamic optimization problems (DOPs). It introduces multi-thread memory to multi-swarm approaches to deal with DOPs. External memory and multi-swarm approaches are adopted. The best particles near the peaks in each environment are saved in the memory according to storage strategy of update and implement. Multi-thread memory makes full use of local and global optima found in each environment. It makes the good information in the previous evolution transfer to the current population adequately. Using the multi-thread memory and its storage strategy, the particles in the memory are always the best information of local and global optima found until in the current envionment. The information will benefit the future evolution. Experiments on the moving peak benchmark (MPB) for different numbers of peaks testiy MTM-PSO has better performance than dynamic optimization algorithms only with multi-swarm approach.


Sign in / Sign up

Export Citation Format

Share Document