scholarly journals An Improved Moth-Flame Optimization Algorithm for Engineering Problems

Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1234
Author(s):  
Yu Li ◽  
Xinya Zhu ◽  
Jingsen Liu
Keyword(s):  
Optimization Algorithm ◽  
Local Development ◽  
Global Search ◽  
Population Diversity ◽  
Lévy Flight ◽  
Test Functions ◽  
Levy Flight ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
Moth Flame Optimization Algorithm

In this paper, an improved moth-flame optimization algorithm (IMFO) is presented to solve engineering problems. Two novel effective strategies composed of Lévy flight and dimension-by-dimension evaluation are synchronously introduced into the moth-flame optimization algorithm (MFO) to maintain a great global exploration ability and effective balance between the global and local search. The search strategy of Lévy flight is used as a regulator of the moth-position update mechanism of global search to maintain a good research population diversity and expand the algorithm’s global search capability, and the dimension-by-dimension evaluation mechanism is added, which can effectively improve the quality of the solution and balance the global search and local development capability. To substantiate the efficacy of the enhanced algorithm, the proposed algorithm is then tested on a set of 23 benchmark test functions. It is also used to solve four classical engineering design problems, with great progress. In terms of test functions, the experimental results and analysis show that the proposed method is effective and better than other well-known nature-inspired algorithms in terms of convergence speed and accuracy. Additionally, the results of the solution of the engineering problems demonstrate the merits of this algorithm in solving challenging problems with constrained and unknown search spaces.

scholarly journals An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems

2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Heuristic Method ◽  
Population Diversity ◽  
Test Functions ◽  
Design Problems ◽  
Local Optima ◽  
Switching Mechanism ◽  
Engineering Design Problems

<abstract> <p>Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (<italic>RMOP</italic>) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.</p> </abstract>

A Levy Flight Sine Cosine Algorithm for Global Optimization Problems

2021 ◽  
Vol 12 (1) ◽  
pp. 49-66
Author(s):  
Yu Li ◽  
Yiran Zhao ◽  
Jingsen Liu
Keyword(s):  
Real World ◽  
Optimization Problems ◽  
Population Diversity ◽  
Lévy Flight ◽  
Simulation Experiments ◽  
Mathematical Functions ◽  
Levy Flight ◽  
Engineering Problems ◽  
Sine Cosine Algorithm ◽  
Swarm Intelligence Algorithm

The sine cosine algorithm (SCA) is a recently proposed global swarm intelligence algorithm based on mathematical functions. This paper proposes a Levy flight sine cosine algorithm (LSCA) to solve optimization problems. In the update equation, the levy flight is introduced to improve optimization ability of SCA. By generating a random walk to update the position, this strategy can effectively search for particles to maintain better population diversity. LSCA has been tested 15 benchmark functions and real-world engineering design optimization problems. The result of simulation experiments with LSCA, SCA, PSO, FPA, and other improvement SCA show that the LSCA has stronger robustness and better convergence accuracy. The engineering problems are also shown that the effectiveness of the levy flight sine cosine algorithm to ensure the efficient results in real-world optimization problem.

scholarly journals An Improved Butterfly Optimization Algorithm for Engineering Design Problems Using the Cross-Entropy Method

Symmetry ◽  
2019 ◽  
Vol 11 (8) ◽  
pp. 1049 ◽  
Author(s):  
Guocheng Li ◽  
Fei Shuang ◽  
Pan Zhao ◽  
Chengyi Le
Keyword(s):  
Engineering Design ◽  
Optimization Algorithm ◽  
Global Search ◽  
Cross Entropy ◽  
Local Optimum ◽  
Test Functions ◽  
Design Problems ◽  
Cross Entropy Method ◽  
Engineering Design Problems ◽  
The Cross

Engineering design optimization in real life is a challenging global optimization problem, and many meta-heuristic algorithms have been proposed to obtain the global best solutions. An excellent meta-heuristic algorithm has two symmetric search capabilities: local search and global search. In this paper, an improved Butterfly Optimization Algorithm (BOA) is developed by embedding the cross-entropy (CE) method into the original BOA. Based on a co-evolution technique, this new method achieves a proper balance between exploration and exploitation to enhance its global search capability, and effectively avoid it falling into a local optimum. The performance of the proposed approach was evaluated on 19 well-known benchmark test functions and three classical engineering design problems. The results of the test functions show that the proposed algorithm can provide very competitive results in terms of improved exploration, local optima avoidance, exploitation, and convergence rate. The results of the engineering problems prove that the new approach is applicable to challenging problems with constrained and unknown search spaces.

Modified Selfish Herd Optimizer for Function Optimization

2020 ◽  
Vol 19 (01) ◽  
pp. 2050003
Author(s):  
Ruxin Zhao ◽  
Yongli Wang ◽  
Chang Liu ◽  
Peng Hu ◽  
Yanchao Li ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Global Search ◽  
Function Optimization ◽  
Test Cases ◽  
Lévy Flight ◽  
Levy Flight ◽  
Distribution Strategy ◽  
Selfish Herd

Selfish herd optimizer (SHO) is a new optimization algorithm. However, its optimization performance is not satisfactory. The main reason for this phenomenon is the weak global search ability of SHO. In this paper, in order to increase the global search ability of SHO, we add Levy-flight distribution strategy. To verify the performance of the proposed algorithm, we use 10 benchmark functions as test cases. Experiment results show that our algorithm is more competitive.

Salp swarm algorithm with crossover scheme and Lévy flight for global optimization

2021 ◽  
pp. 1-12
Author(s):  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Global Optimization ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
High Dimensional ◽  
Lévy Flight ◽  
Test Functions ◽  
Levy Flight ◽  
Salp Swarm Algorithm ◽  
Swarm Algorithm ◽  
Accuracy And Stability

Salp swarm algorithm (SSA) is a meta-heuristic algorithm proposed in recent years, which shows certain advantages in solving some optimization tasks. However, with the increasing difficulty of solving the problem (e.g. multi-modal, high-dimensional), the convergence accuracy and stability of SSA algorithm decrease. In order to overcome the drawbacks, salp swarm algorithm with crossover scheme and Lévy flight (SSACL) is proposed. The crossover scheme and Lévy flight strategy are used to improve the movement patterns of salp leader and followers, respectively. Experiments have been conducted on various test functions, including unimodal, multimodal, and composite functions. The experimental results indicate that the proposed SSACL algorithm outperforms other advanced algorithms in terms of precision, stability, and efficiency. Furthermore, the Wilcoxon’s rank sum test illustrates the advantages of proposed method in a statistical and meaningful way.

scholarly journals Lévy-Flight Moth-Flame Algorithm for Function Optimization and Engineering Design Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Zhiming Li ◽  
Yongquan Zhou ◽  
Sen Zhang ◽  
Junmin Song
Keyword(s):  
Engineering Design ◽  
Function Optimization ◽  
Superior Performance ◽  
Local Optimum ◽  
Lévy Flight ◽  
Design Problems ◽  
Levy Flight ◽  
Spiral Path ◽  
Straight Line ◽  
Engineering Design Problems

The moth-flame optimization (MFO) algorithm is a novel nature-inspired heuristic paradigm. The main inspiration of this algorithm is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a spiral path around artificial lights. Aiming at the phenomenon that MFO algorithm has slow convergence and low precision, an improved version of MFO algorithm based on Lévy-flight strategy, which is named as LMFO, is proposed. Lévy-flight can increase the diversity of the population against premature convergence and make the algorithm jump out of local optimum more effectively. This approach is helpful to obtain a better trade-off between exploration and exploitation ability of MFO, thus, which can make LMFO faster and more robust than MFO. And a comparison with ABC, BA, GGSA, DA, PSOGSA, and MFO on 19 unconstrained benchmark functions and 2 constrained engineering design problems is tested. These results demonstrate the superior performance of LMFO.

Sign in / Sign up

Export Citation Format

Share Document