• The Journal of the Korea Contents Association
• /
• v.20 no.11
• /
• pp.636-643
• /
• 2020

The differential evolution algorithm is one of the meta-heuristic techniques developed to solve the real optimization problem, which is a continuous problem space. In this study, in order to use the differential evolution algorithm to solve the traveling salesman problem, which is a discontinuous problem space, a random key representation method is applied to the differential evolution algorithm. The differential evolution algorithm searches for a real space and uses the order of the indexes of the solutions sorted in ascending order as the order of city visits to find the fitness. As a result of experimentation by applying it to the benchmark traveling salesman problems which are provided in TSPLIB, it was confirmed that the proposed differential evolution algorithm based on the random key representation method has the potential to solve the traveling salesman problems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.407-415
• /
• 2011

In this study, we propose the design of optimized fuzzy controller for the rotary inverted pendulum system by using differential evolution algorithm. The structure of the differential evolution algorithm has a simple structure and its convergence to optimal values is superb in comparison to other optimization algorithms. Also the differential evolution algorithm is easier to use because it have simpler mathematical operators and have much less computational time when compared with other optimization algorithms. The rotary inverted pendulum system is nonlinear and has a unstable motion. The objective is to control the position of the rotating arm and to make the pendulum to maintain the unstable equilibrium point at vertical position. The output performance of the proposed fuzzy controller is considered from the viewpoint of performance criteria such as overshoot, steady-state error, and settling time through simulation and practical experiment. From the result of both simulation and practical experiment, we evaluate and analyze the performance of the proposed optimal fuzzy controller from the comparison between PGAs and differential evolution algorithms. Also we show the superiority of the output performance as well as the characteristic of differential evolution algorithm.

• Industrial Engineering and Management Systems
• /
• v.10 no.3
• /
• pp.203-208
• /
• 2011

Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.11
• /
• pp.1809-1814
• /
• 2003

Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.

• Journal of information and communication convergence engineering
• /
• v.19 no.3
• /
• pp.155-160
• /
• 2021

Differential evolution is an efficient algorithm for solving continuous optimization problems. However, its performance deteriorates rapidly, and the runtime increases exponentially when differential evolution is applied for solving large-scale optimization problems. Hence, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC. First, the large-scale problem is decomposed into several low-dimensional subproblems using the random grouping strategy. Subsequently, each subproblem can be addressed in a parallel manner by exploiting the parallel computation capability of the resilient distributed datasets model in Spark. Finally, the optimal solution of the entire problem is obtained using the cooperation mechanism. The experimental results on 13 high-benchmark functions show that the new algorithm performs well in terms of speedup and scalability. The effectiveness and applicability of the proposed algorithm are verified.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2018

An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.735-749
• /
• 2015

The major difficulty of using Bayesian probabilistic inference for system identification is to obtain the posterior probability density of parameters conditioned by the measured response. The posterior density of structural parameters indicates how plausible each model is when considering the uncertainty of prediction errors. The Markov chain Monte Carlo (MCMC) method is a widespread medium for posterior inference but its convergence is often slow. The differential evolution adaptive Metropolis-Hasting (DREAM) algorithm boasts a population-based mechanism, which nms multiple different Markov chains simultaneously, and a global optimum exploration ability. This paper proposes an improved differential evolution adaptive Metropolis-Hasting algorithm (IDREAM) strategy to estimate the posterior density of structural parameters. The main benefit of IDREAM is its efficient MCMC simulation through its use of the adaptive Metropolis (AM) method with a mutation strategy for ensuring quick convergence and robust solutions. Its effectiveness was demonstrated in simulations on identifying the structural parameters with limited output data and noise polluted measurements.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1729-1742
• /
• 2017

In designing System Protection Schemes (SPSs) in power systems, protecting transmission network against extreme undesired conditions becomes a significant challenge in mitigating the transmission line overloading. This paper presents an intelligent Special Protection and Control Scheme (SPCS) using of Differential Evolution with Adaptive Mutation (DEAM) approach to obtain the optimum generation rescheduling to solve the transmission line overloading problem in system contingency conditions. DEAM algorithm employs the attraction-repulsion idea that is applied in the electromagnetism-like algorithm to support the mutation process of the conventional Differential Evolution (DE) algorithm. Different N-1 contingency conditions under base and increase load demand are considered in this paper. Simulation results have been compared with those acquired from Genetic Algorithm (GA) application. Minimum severity index has been considered as the objective function. The final results show that the presented DEAM method offers better performance than GA in terms of faster convergence and less generation fuel cost. IEEE 30-bus test system has been used to prove the effectiveness and robustness of the proposed algorithm.

• Journal of Internet Computing and Services
• /
• v.22 no.1
• /
• pp.1-11
• /
• 2021

Estimation of distribution algorithm (EDA) is a popular stochastic metaheuristic algorithm. EDA has been widely utilized in various optimization problems. However, it has been shown that the diversity of the population gradually decreases during the iterations, which makes EDA easily lead to premature convergence. This article introduces a hybrid estimation of distribution algorithm (EDA) with differential evolution (DE) based on self-adaptive strategy, namely HEDADE-SA. Firstly, an alternative probability model is used in sampling to improve population diversity. Secondly, the proposed algorithm is combined with DE, and a self-adaptive strategy is adopted to improve the convergence speed of the algorithm. Finally, twenty-five benchmark problems are conducted to verify the performance of HEDADE-SA. Experimental results indicate that HEDADE-SA is a feasible and effective algorithm.

• Journal of Internet Computing and Services
• /
• v.22 no.2
• /
• pp.19-27
• /
• 2021

Fireworks Algorithm (FWA) is a new heuristic swarm intelligent algorithm inspired by the natural phenomenon of the fireworks explosion. Though it is an effective algorithm for solving optimization problems, FWA has a slow convergence rate and less information sharing between individuals. In this paper, we improve the FWA. Firstly, explosion operator and explosion amplitude are analyzed in detail. The coefficient of explosion amplitude and explosion operator change dynamically with iteration to balance the exploitation and exploration. The convergence performance of FWA is improved. Secondly, differential evolution and commensal learning (CDE) significantly increase the information sharing between individuals, and the diversity of fireworks is enhanced. Comprehensive experiment and comparison with CDE, FWA, and VACUFWA for the 13 benchmark functions show that the improved algorithm was highly competitive.