An adaptive niching method based on multi-strategy fusion for multimodal optimization

2021 ◽  
Author(s):  
Hui Lu ◽  
Shengjie Sun ◽  
Shi Cheng ◽  
Yuhui Shi
2021 ◽  
Author(s):  
Francisco Daniel Filip Duarte

Abstract In optimization tasks, it is interesting to achieve a set of efficient solutions instead of one single output, in the case the best solution is not suitable. Many niching methods offer a diversified response, yet some important problems are common: (1) The most interesting solutions of each local optimum are not identified. Thus, the output is the overall population of solutions, which increases the work of the designer in verifying which solution is the most interesting. (2) Existing niching algorithms tend to distribute the solutions on the most promising regions, over-populating some local optima and sub-populating others, what leads to a poor optimization.To solve these challenges, a novel niching method is presented, named local optimum ranking 2. This sorting methodology favors the exploration of a defined number of local optima, and ranks each local population by objective value within each local optimum. Thus, is performed a multi-focus exploration, with an equalized number of solutions on each local optimum, while identifying which solutions are the local apices. Experimental results demonstrate the local optimum ranking 2 provides superior performance than other popular niching methods, for the selected test functions and global optimization algorithms. Also, its versatility is demonstrated in the several ways it can be combined with some of the most well-known methods.In a second experiment, the LOR2 algorithm is applied in the design optimization of a metallic cantilever beam. It is exemplified how the LOR2 algorithm can achieve a set of efficient and diverse design configurations, identifying which are the apices of each local optimum. Thus, the LOR2 facilitates multimodal optimization tasks, while offering both performance and diversity for design challenges.In addition, a third experiment describes how the algorithm can be applied to segment the domain of any function, with any type of input distribution or number of coordinates, into a mesh of similar sized or custom sized elements. Thus, it can segment a response surface named Kriging, significantly simplifying it and reducing computation time.


2021 ◽  
Author(s):  
Francisco Daniel Filip Duarte

Abstract In optimization tasks, it is interesting to achieve a set of efficient solutions instead of one single output, in the case the best solution is not suitable. Many niching methods offer a diversified response, yet some important problems are common: (1) The most interesting solutions of each local optimum are not identified. Thus, the output is the overall population of solutions, which increases the work of the designer in verifying which solution is the most interesting. (2) Existing niching algorithms tend to distribute the solutions on the most promising regions, over-populating some local optima and sub-populating others, what leads to a poor optimization.To solve these challenges, a novel niching method is presented, named local optimum ranking 2. This sorting methodology favors the exploration of a defined number of local optima, and ranks each local population by objective value within each local optimum. Thus, is performed a multi-focus exploration, with an equalized number of solutions on each local optimum, while identifying which solutions are the local apices. Experimental results demonstrate the local optimum ranking 2 provides superior performance than other popular niching methods, for the selected test functions and global optimization algorithms. Also, its versatility is demonstrated in the several ways it can be combined with some of the most well-known methods.In a second experiment, the LOR2 algorithm is applied in the design optimization of a metallic cantilever beam. It is exemplified how the LOR2 algorithm can achieve a set of efficient and diverse design configurations, identifying which are the apices of each local optimum. Thus, the LOR2 facilitates multimodal optimization tasks, while offering both performance and diversity for design challenges.In addition, a third experiment describes how the algorithm can be applied to segment the domain of any function, with any type of input distribution or number of coordinates, into a mesh of similar sized or custom sized elements. Thus, it can segment a response surface named Kriging, significantly simplifying it and reducing computation time.


Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 857
Author(s):  
Jahedul Islam ◽  
Md Shokor A. Rahaman ◽  
Pandian M. Vasant ◽  
Berihun Mamo Negash ◽  
Ahshanul Hoqe ◽  
...  

Well placement optimization is considered a non-convex and highly multimodal optimization problem. In this article, a modified crow search algorithm is proposed to tackle the well placement optimization problem. This article proposes modifications based on local search and niching techniques in the crow search algorithm (CSA). At first, the suggested approach is verified by experimenting with the benchmark functions. For test functions, the results of the proposed approach demonstrated a higher convergence rate and a better solution. Again, the performance of the proposed technique is evaluated with well placement optimization problem and compared with particle swarm optimization (PSO), the Gravitational Search Algorithm (GSA), and the Crow search algorithm (CSA). The outcomes of the study revealed that the niching crow search algorithm is the most efficient and effective compared to the other techniques.


Author(s):  
Ali Ahrari ◽  
Saber Elsayed ◽  
Ruhul Sarker ◽  
Daryl Essam ◽  
Carlos A. Coello Coello

2021 ◽  
Vol 11 (8) ◽  
pp. 3388
Author(s):  
Pan Zou ◽  
Manik Rajora ◽  
Steven Y. Liang

Though many techniques were proposed for the optimization of Permutation Flow-Shop Scheduling Problem (PFSSP), current techniques only provide a single optimal schedule. Therefore, a new algorithm is proposed, by combining the k-means clustering algorithm and Genetic Algorithm (GA), for the multimodal optimization of PFSSP. In the proposed algorithm, the k-means clustering algorithm is first utilized to cluster the individuals of every generation into different clusters, based on some machine-sequence-related features. Next, the operators of GA are applied to the individuals belonging to the same cluster to find multiple global optima. Unlike standard GA, where all individuals belong to the same cluster, in the proposed approach, these are split into multiple clusters and the crossover operator is restricted to the individuals belonging to the same cluster. Doing so, enabled the proposed algorithm to potentially find multiple global optima in each cluster. The performance of the proposed algorithm was evaluated by its application to the multimodal optimization of benchmark PFSSP. The results obtained were also compared to the results obtained when other niching techniques such as clearing method, sharing fitness, and a hybrid of the proposed approach and sharing fitness were used. The results of the case studies showed that the proposed algorithm was able to consistently converge to better optimal solutions than the other three algorithms.


2021 ◽  
Vol 13 (4) ◽  
pp. 594
Author(s):  
Rui Wang ◽  
Yiming Zhang ◽  
Weiming Tian ◽  
Jiong Cai ◽  
Cheng Hu ◽  
...  

Entomological radars are important for scientific research of insect migration and early warning of migratory pests. However, insects are hard to detect because of their tiny size and highly maneuvering trajectory. Generalized Radon–Fourier transform (GRFT) has been proposed for effective weak maneuvering target detection by long-time coherent detection via jointly motion parameter search, but the heavy computational burden makes it impractical in real signal processing. Particle swarm optimization (PSO) has been used to achieve GRFT detection by fast heuristic parameter search, but it suffers from obvious detection probability loss and is only suitable for single target detection. In this paper, we convert the realization of GRFT into a multimodal optimization problem for insect multi-target detection. A novel niching method without radius parameter is proposed to detect unevenly distributed insect targets. Species reset and boundary constraint strategy are used to improve the detection performance. Simulation analyses of detection performance and computational cost are given to prove the effectiveness of the proposed method. Furthermore, real observation data acquired from a Ku-band entomological radar is used to test this method. The results show that it has better performance on detected target amount and track continuity in insect multi-target detection.


2011 ◽  
Vol 1 (2) ◽  
pp. 71-88 ◽  
Author(s):  
Swagatam Das ◽  
Sayan Maity ◽  
Bo-Yang Qu ◽  
P.N. Suganthan

Sign in / Sign up

Export Citation Format

Share Document