scholarly journals Chaotic Evolutionary Programming for an Engineering Optimization Problem

2021 ◽  
Vol 11 (6) ◽  
pp. 2717
Author(s):  
Nirbhow Jap Singh ◽  
Shakti Singh ◽  
Vikram Chopra ◽  
Mohd Asim Aftab ◽  
S. M. Suhail Hussain ◽  
...  
Keyword(s):  
Evolutionary Programming ◽  
Gauss Map ◽  
Solution Procedure ◽  
Pattern Search ◽  
Economic Load Dispatch ◽  
Test Functions ◽  
Tent Map ◽  
Exploration Process ◽  
Benchmark Test Functions ◽  
Better Than

The aim of the current paper is to present a mimetic algorithm called the chaotic evolutionary programming Powell’s pattern search (CEPPS) algorithm for the solution of the multi-fuel economic load dispatch problem. In the CEPPS algorithm, the exploration process is maintained by chaotic evolutionary programming, whereas exploitation is taken care off by a pattern search. The proposed CEPPS has two variants based on the Gauss map and the tent map. Seven generalized benchmark test functions and six cases of the multi-fuel economic load dispatch problem are considered for the performance analysis. It is observed from the analysis that the CEPPS solution procedure based on the tent map exhibits superiority to obtain an excellent solution and better convergence characteristics than traditional chaotic evolutionary programming. Further, the performance investigation for the considered economic load dispatch shows that the Gauss map CEPPS solution procedure performs better than the tent map based CEPPS to obtain the solution of the multi-fuel economic dispatch problem.

scholarly journals A Cuckoo Search Algorithm Using Improved Beta Distributing and Its Application in the Process of EDM

Crystals ◽  
2021 ◽  
Vol 11 (8) ◽  
pp. 916
Author(s):  
Dili Shen ◽  
Wuyi Ming ◽  
Xinggui Ren ◽  
Zhuobin Xie ◽  
Yong Zhang ◽  
...  
Keyword(s):  
Random Walk ◽  
Beta Distribution ◽  
Cuckoo Search ◽  
Scale Factor ◽  
Test Functions ◽  
Benchmark Test ◽  
Iteration Number ◽  
Benchmark Test Functions ◽  
Single Objective ◽  
Better Than

Lévy flights random walk is one of key parts in the cuckoo search (CS) algorithm to update individuals. The standard CS algorithm adopts the constant scale factor for this random walk. This paper proposed an improved beta distribution cuckoo search (IBCS) for this factor in the CS algorithm. In terms of local characteristics, the proposed algorithm makes the scale factor of the step size in Lévy flights showing beta distribution in the evolutionary process. In terms of the overall situation, the scale factor shows the exponential decay trend in the process. The proposed algorithm makes full use of the advantages of the two improvement strategies. The test results show that the proposed strategy is better than the standard CS algorithm or others improved by a single improvement strategy, such as improved CS (ICS) and beta distribution CS (BCS). For the six benchmark test functions of 30 dimensions, the average rankings of the CS, ICS, BCS, and IBCS algorithms are 3.67, 2.67, 1.5, and 1.17, respectively. For the six benchmark test functions of 50 dimensions, moreover, the average rankings of the CS, ICS, BCS, and IBCS algorithms are 2.83, 2.5, 1.67, and 1.0, respectively. Confirmed by our case study, the performance of the ABCS algorithm was better than that of standard CS, ICS or BCS algorithms in the process of EDM. For example, under the single-objective optimization convergence of MRR, the iteration number (13 iterations) of the CS algorithm for the input process parameters, such as discharge current, pulse-on time, pulse-off time, and servo voltage, was twice that (6 iterations) of the IBCS algorithm. Similar, the iteration number (17 iterations) of BCS algorithm for these parameters was twice that (8 iterations) of the IBCS algorithm under the single-objective optimization convergence of Ra. Therefore, it strengthens the CS algorithm’s accuracy and convergence speed.

scholarly journals A Hybrid Whale Optimization Algorithm for Global Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1477
Author(s):  
Chun-Yao Lee ◽  
Guang-Lin Zhuo
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Initial Population ◽  
Test Functions ◽  
Benchmark Test ◽  
Thermal Exchange ◽  
Whale Optimization ◽  
Benchmark Test Functions

This paper proposes a hybrid whale optimization algorithm (WOA) that is derived from the genetic and thermal exchange optimization-based whale optimization algorithm (GWOA-TEO) to enhance global optimization capability. First, the high-quality initial population is generated to improve the performance of GWOA-TEO. Then, thermal exchange optimization (TEO) is applied to improve exploitation performance. Next, a memory is considered that can store historical best-so-far solutions, achieving higher performance without adding additional computational costs. Finally, a crossover operator based on the memory and a position update mechanism of the leading solution based on the memory are proposed to improve the exploration performance. The GWOA-TEO algorithm is then compared with five state-of-the-art optimization algorithms on CEC 2017 benchmark test functions and 8 UCI repository datasets. The statistical results of the CEC 2017 benchmark test functions show that the GWOA-TEO algorithm has good accuracy for global optimization. The classification results of 8 UCI repository datasets also show that the GWOA-TEO algorithm has competitive results with regard to comparison algorithms in recognition rate. Thus, the proposed algorithm is proven to execute excellent performance in solving optimization problems.

scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid
Keyword(s):  
Review Paper ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Superior Performance ◽  
Test Functions ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization ◽  
Metaheuristic Techniques ◽  
Benchmark Test Functions

<p></p><p></p><p>Dragonfly algorithm developed in 2016. It is one of the algorithms used by the researchers to optimize an extensive series of uses and applications in various areas. At times, it offers superior performance compared to the most well-known optimization techniques. However, this algorithm faces several difficulties when it is utilized to enhance complex optimization problems. This work addressed the robustness of the method to solve real-world optimization issues, and its deficiency to improve complex optimization problems. This review paper shows a comprehensive investigation of the dragonfly algorithm in the engineering area. First, an overview of the algorithm is discussed. Besides, we also examine the modifications of the algorithm. The merged forms of this algorithm with different techniques and the modifications that have been done to make the algorithm perform better are addressed. Additionally, a survey on applications in the engineering area that used the dragonfly algorithm is offered. A comparison is made between the algorithm and other metaheuristic techniques to show its ability to enhance various problems. The outcomes of the algorithm from the works that utilized the dragonfly algorithm previously and the outcomes of the benchmark test functions proved that in comparison with some techniques, the dragonfly algorithm owns an excellent performance, especially for small to intermediate applications. Moreover, the congestion facts of the technique and some future works are presented. The authors conducted this research to help other researchers who want to study the algorithm and utilize it to optimize engineering problems.</p><br><p></p><p></p>

scholarly journals Cyber Firefly Algorithm Based on Adaptive Memory Programming for Global Optimization

2020 ◽  
Vol 10 (24) ◽  
pp. 8961
Author(s):  
Peng-Yeng Yin ◽  
Po-Yen Chen ◽  
Ying-Chieh Wei ◽  
Rong-Fuh Day
Keyword(s):  
Global Optimization ◽  
Firefly Algorithm ◽  
State Of The Art ◽  
Pattern Search ◽  
Experimental Result ◽  
Adaptive Memory ◽  
Glowworm Swarm Optimization ◽  
Metaheuristic Methods ◽  
Swarming Behavior ◽  
Better Than

Recently, two evolutionary algorithms (EAs), the glowworm swarm optimization (GSO) and the firefly algorithm (FA), have been proposed. The two algorithms were inspired by the bioluminescence process that enables the light-mediated swarming behavior for mating or foraging. From our literature survey, we are convinced with much evidence that the EAs can be more effective if appropriate responsive strategies contained in the adaptive memory programming (AMP) domain are considered in the execution. This paper contemplates this line and proposes the Cyber Firefly Algorithm (CFA), which integrates key elements of the GSO and the FA and further proliferates the advantages by featuring the AMP-responsive strategies including multiple guiding solutions, pattern search, multi-start search, swarm rebuilding, and the objective landscape analysis. The robustness of the CFA has been compared against the GSO, FA, and several state-of-the-art metaheuristic methods. The experimental result based on intensive statistical analyses showed that the CFA performs better than the other algorithms for global optimization of benchmark functions.

A Novel Global Optimization Method – Genetic Pattern Search

2010 ◽  
Vol 44-47 ◽  
pp. 3240-3244 ◽  
Author(s):  
Yu Dong Zhang ◽  
Le Nan Wu ◽  
Yuan Kai Huo ◽  
Shui Hua Wang
Keyword(s):  
Global Optimization ◽  
Computation Time ◽  
Optimization Method ◽  
Pattern Search ◽  
Test Functions ◽  
Global Optimization Method ◽  
Minimal Points ◽  
Genetic Pattern ◽  
Two Phases ◽  
Coarse Search

A novel global optimization method is proposed to find global minimal points more effectively and quickly. The new algorithm is based on both genetic algorithms (GA) and pattern search (PS) algorithms, thus, we have named it genetic pattern search. The procedure involves two-phases: First, GA executes a coarse search, PS then executes a fine search. Experiments on four different test functions (consisting of Hump, Powell, Rosenbrock, and Woods) demonstrate that this proposed new algorithm is superior to improved GA and improved PS with respect to success rate and computation time. Therefore, genetic pattern search is an effective and viable global optimization method.

Optimal Operation of Multireservoir Systems by Enhanced Water Cycle Algorithm

2019 ◽  
Vol 7 (1) ◽  
pp. 27-43
Author(s):  
Yanjun Kong ◽  
Yadong Mei ◽  
Weinan Li ◽  
Ben Yue ◽  
Xianxun Wang
Keyword(s):  
Water Cycle ◽  
Water System ◽  
System Size ◽  
Optimal Operation ◽  
Test Functions ◽  
Water Cycle Algorithm ◽  
Adaptive Parameter ◽  
Fitness Value ◽  
Better Than

In this article, an enhanced water cycle algorithm (EWCA) is proposed and applied to optimize the operation of multireservoir systems. Three improvements have been made to the water cycle algorithm (WCA). They refer to high-quality initial solutions obtained by the chaos-based method, balancing of exploration of streams using a dynamic adaptive parameter, and dynamic variation of sub-water system size using the fitness value of rivers. For the purpose of verifying the improvements, three typical benchmark functions were selected as test functions. It has shown that EWCA performs better than WCA and water cycle algorithm with evaporation rate (ER-WCA). And then these three algorithms were also applied to optimize the operation of a multireservoir system with complex constrains as the case study. By comparing the results, it is found that the EWCA has higher ability to find a feasible solution in a narrow searching space. The effectiveness of the improvements is confirmed.

An Improved Novel Global Harmony Search Algorithm

2014 ◽  
Vol 644-650 ◽  
pp. 2169-2172
Author(s):  
Zhi Kong ◽  
Guo Dong Zhang ◽  
Li Fu Wang
Keyword(s):  
Convergence Rate ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Harmony Search ◽  
Global Optimum ◽  
Harmony Search Algorithm ◽  
Test Functions ◽  
Benchmark Test ◽  
Novel Method ◽  
Benchmark Test Functions

This paper develops an improved novel global harmony search (INGHS) algorithm for solving optimization problems. INGHS employs a novel method for generating new solution vectors that enhances accuracy and convergence rate of novel global harmony search (NGHS) algorithm. Simulations for five benchmark test functions show that INGHS possesses better ability to find the global optimum than that of harmony search (HS) algorithm. Compared with NGHS and HS, INGHS is better in terms of robustness and efficiency.

scholarly journals Adaptive Opposition Slime Mould Algorithm

2021 ◽  
Author(s):  
Manoj Kumar Naik ◽  
Rutuparna Panda ◽  
Ajith Abraham
Keyword(s):  
Random Search ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Function Optimization ◽  
Rank Test ◽  
Test Functions ◽  
Slime Mould ◽  
Opposition Based Learning ◽  
Suggested Technique ◽  
Better Than

Abstract Recently, the slime mould algorithm (SMA) has become popular in function optimization, because it effectively uses exploration and exploitation to reach an optimal solution or near-optimal solution. However, the SMA uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, we investigate an adaptive approach to decide whether opposition based learning (OBL) will be used or not. Sometimes the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The qualitative and quantitative analysis of AOSMA is reported using 29 test functions consisting of 23 classical test functions and 6 recently used composition functions from the IEEE CEC 2014 test suite. The results are compared with state-of-the-art optimization methods. Results presented in this paper show that AOSMA’s performance is better than other optimization algorithms. The AOSMA is evaluated using Wilcoxon’s rank-sum test. It also ranked one in Friedman’s mean rank test. The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems.

Sign in / Sign up

Export Citation Format

Share Document