scholarly journals Global Evolution Commended by Localized Search for Unconstrained Single Objective Optimization

Processes ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 362 ◽  
Author(s):  
Rashida Khanum ◽  
Muhammad Jan ◽  
Nasser Tairan ◽  
Wali Mashwani ◽  
Muhammad Sulaiman ◽  
...  

Differential Evolution (DE) is one of the prevailing search techniques in the present era to solve global optimization problems. However, it shows weakness in performing a localized search, since it is based on mutation strategies that take large steps while searching a local area. Thus, DE is not a good option for solving local optimization problems. On the other hand, there are traditional local search (LS) methods, such as Steepest Decent and Davidon–Fletcher–Powell (DFP) that are good at local searching, but poor in searching global regions. Hence, motivated by the short comings of existing search techniques, we propose a hybrid algorithm of a DE version, reflected adaptive differential evolution with two external archives (RJADE/TA) with DFP to benefit from both search techniques and to alleviate their search disadvantages. In the novel hybrid design, the initial population is explored by global optimizer, RJADE/TA, and then a few comparatively best solutions are shifted to the archive and refined there by DFP. Thus, both kinds of searches, global and local, are incorporated alternatively. Furthermore, a population minimization approach is also proposed. At each call of DFP, the population is decreased. The algorithm starts with a maximum population and ends up with a minimum. The proposed technique was tested on a test suite of 28 complex functions selected from literature to evaluate its merit. The results achieved demonstrate that DE complemented with LS can further enhance the performance of RJADE/TA.

Algorithms ◽  
2019 ◽  
Vol 12 (7) ◽  
pp. 141 ◽  
Author(s):  
Cemre Cubukcuoglu ◽  
Berk Ekici ◽  
Mehmet Fatih Tasgetiren ◽  
Sevil Sariyildiz

Most of the architectural design problems are basically real-parameter optimization problems. So, any type of evolutionary and swarm algorithms can be used in this field. However, there is a little attention on using optimization methods within the computer aided design (CAD) programs. In this paper, we present Optimus, which is a new optimization tool for grasshopper algorithmic modeling in Rhinoceros CAD software. Optimus implements self-adaptive differential evolution algorithm with ensemble of mutation strategies (jEDE). We made an experiment using standard test problems in the literature and some of the test problems proposed in IEEE CEC 2005. We reported minimum, maximum, average, standard deviations and number of function evaluations of five replications for each function. Experimental results on the benchmark suite showed that Optimus (jEDE) outperforms other optimization tools, namely Galapagos (genetic algorithm), SilverEye (particle swarm optimization), and Opossum (RbfOpt) by finding better results for 19 out of 20 problems. For only one function, Galapagos presented slightly better result than Optimus. Ultimately, we presented an architectural design problem and compared the tools for testing Optimus in the design domain. We reported minimum, maximum, average and number of function evaluations of one replication for each tool. Galapagos and Silvereye presented infeasible results, whereas Optimus and Opossum found feasible solutions. However, Optimus discovered a much better fitness result than Opossum. As a conclusion, we discuss advantages and limitations of Optimus in comparison to other tools. The target audience of this paper is frequent users of parametric design modelling e.g., architects, engineers, designers. The main contribution of this paper is summarized as follows. Optimus showed that near-optimal solutions of architectural design problems can be improved by testing different types of algorithms with respect to no-free lunch theorem. Moreover, Optimus facilitates implementing different type of algorithms due to its modular system.


2018 ◽  
Vol 8 (10) ◽  
pp. 1945 ◽  
Author(s):  
Tarik Eltaeib ◽  
Ausif Mahmood

Differential evolution (DE) has been extensively used in optimization studies since its development in 1995 because of its reputation as an effective global optimizer. DE is a population-based metaheuristic technique that develops numerical vectors to solve optimization problems. DE strategies have a significant impact on DE performance and play a vital role in achieving stochastic global optimization. However, DE is highly dependent on the control parameters involved. In practice, the fine-tuning of these parameters is not always easy. Here, we discuss the improvements and developments that have been made to DE algorithms. In particular, we present a state-of-the-art survey of the literature on DE and its recent advances, such as the development of adaptive, self-adaptive and hybrid techniques.


2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Yuehe Zhu ◽  
Hua Wang ◽  
Jin Zhang

Since most spacecraft multiple-impulse trajectory optimization problems are complex multimodal problems with boundary constraint, finding the global optimal solution based on the traditional differential evolution (DE) algorithms becomes so difficult due to the deception of many local optima and the probable existence of a bias towards suboptimal solution. In order to overcome this issue and enhance the global searching ability, an improved DE algorithm with combined mutation strategies and boundary-handling schemes is proposed. In the first stage, multiple mutation strategies are utilized, and each strategy creates a mutant vector. In the second stage, multiple boundary-handling schemes are used to simultaneously address the same infeasible trial vector. Two typical spacecraft multiple-impulse trajectory optimization problems are studied and optimized using the proposed DE method. The experimental results demonstrate that the proposed DE method efficiently overcomes the problem created by the convergence to a local optimum and obtains the global optimum with a higher reliability and convergence rate compared with some other popular evolutionary methods.


SPE Journal ◽  
2019 ◽  
Vol 25 (01) ◽  
pp. 105-118 ◽  
Author(s):  
Guodong Chen ◽  
Kai Zhang ◽  
Liming Zhang ◽  
Xiaoming Xue ◽  
Dezhuang Ji ◽  
...  

Summary Surrogate models, which have become a popular approach to oil-reservoir production-optimization problems, use a computationally inexpensive approximation function to replace the computationally expensive objective function computed by a numerical simulator. In this paper, a new optimization algorithm called global and local surrogate-model-assisted differential evolution (GLSADE) is introduced for waterflooding production-optimization problems. The proposed method consists of two parts: (1) a global surrogate-model-assisted differential-evolution (DE) part, in which DE is used to generate multiple offspring, and (2) a local surrogate-model-assisted DE part, in which DE is used to search for the optimum of the surrogate. The cooperation between global optimization and local search helps the production-optimization process become more efficient and more effective. Compared with the conventional one-shot surrogate-based approach, the developed method iteratively selects data points to enhance the accuracy of the promising area of the surrogate model, which can substantially improve the optimization process. To the best of our knowledge, the proposed method uses a state-of-the-art surrogate framework for production-optimization problems. The approach is tested on two 100-dimensional benchmark functions, a three-channel model, and the egg model. The results show that the proposed method can achieve higher net present value (NPV) and better convergence speed in comparison with the traditional evolutionary algorithm and other surrogate-assisted optimization methods for production-optimization problems.


2011 ◽  
Vol 19 (2) ◽  
pp. 249-285 ◽  
Author(s):  
Yong Wang ◽  
Zixing Cai

This paper proposes a (μ + λ)-differential evolution and an improved adaptive trade-off model for solving constrained optimization problems. The proposed (μ + λ)-differential evolution adopts three mutation strategies (i.e., rand/1 strategy, current-to-best/1 strategy, and rand/2 strategy) and binomial crossover to generate the offspring population. Moreover, the current-to-best/1 strategy has been improved in this paper to further enhance the global exploration ability by exploiting the feasibility proportion of the last population. Additionally, the improved adaptive trade-off model includes three main situations: the infeasible situation, the semi-feasible situation, and the feasible situation. In each situation, a constraint-handling mechanism is designed based on the characteristics of the current population. By combining the (μ + λ)-differential evolution with the improved adaptive trade-off model, a generic method named (μ + λ)-constrained differential evolution ((μ + λ)-CDE) is developed. The (μ + λ)-CDE is utilized to solve 24 well-known benchmark test functions provided for the special session on constrained real-parameter optimization of the 2006 IEEE Congress on Evolutionary Computation (CEC2006). Experimental results suggest that the (μ + λ)-CDE is very promising for constrained optimization, since it can reach the best known solutions for 23 test functions and is able to successfully solve 21 test functions in all runs. Moreover, in this paper, a self-adaptive version of (μ + λ)-CDE is proposed which is the most competitive algorithm so far among the CEC2006 entries.


2020 ◽  
Vol 50 (7) ◽  
pp. 3343-3357 ◽  
Author(s):  
Hong Zhao ◽  
Zhi-Hui Zhan ◽  
Ying Lin ◽  
Xiaofeng Chen ◽  
Xiao-Nan Luo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document