• Title/Summary/Keyword: Differential evolution (DE) algorithm

Search Result 55, Processing Time 0.031 seconds

Global Optimization Using Differential Evolution Algorithm (차분진화 알고리듬을 이용한 전역최적화)

  • Jung, Jae-Joon;Lee, Tae-Hee
    • 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.

Differential Evolution Algorithm for Job Shop Scheduling Problem

  • Wisittipanich, Warisa;Kachitvichyanukul, Voratas
    • 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.

Differential Evolution with Multi-strategies based Soft Island Model

  • Tan, Xujie;Shin, Seong-Yoon
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.4
    • /
    • pp.261-266
    • /
    • 2019
  • Differential evolution (DE) is an uncomplicated and serviceable developmental algorithm. Nevertheless, its execution depends on strategies and regulating structures. The combination of several strategies between subpopulations helps to stabilize the probing on DE. In this paper, we propose a unique k-mean soft island model DE(KSDE) algorithm which maintains population diversity through soft island model (SIM). A combination of various approaches, called KSDE, intended for migrating the subpopulation information through SIM is developed in this study. First, the population is divided into k subpopulations using the k-means clustering algorithm. Second, the mutation pattern is singled randomly from a strategy pool. Third, the subpopulation information is migrated using SIM. The performance of KSDE was analyzed using 13 benchmark indices and compared with those of high-technology DE variants. The results demonstrate the efficiency and suitability of the KSDE system, and confirm that KSDE is a cost-effective algorithm compared with four other DE algorithms.

Differential Evolution Algorithms Solving a Multi-Objective, Source and Stage Location-Allocation Problem

  • Thongdee, Thongpoon;Pitakaso, Rapeepan
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.1
    • /
    • pp.11-21
    • /
    • 2015
  • The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

Sliding Mode Control for Servo Motors Based on the Differential Evolution Algorithm

  • Yin, Zhonggang;Gong, Lei;Du, Chao;Liu, Jing;Zhong, Yanru
    • Journal of Power Electronics
    • /
    • v.18 no.1
    • /
    • pp.92-102
    • /
    • 2018
  • A sliding mode control (SMC) for servo motors based on the differential evolution (DE) algorithm, called DE-SMC, is proposed in this study. The parameters of SMC should be designed exactly to improve the robustness, realize the precision positioning, and reduce the steady-state speed error of the servo drive. The main parameters of SMC are optimized using the DE algorithm according to the speed feedback information of the servo motor. The most significant influence factor of the DE algorithm is optimization iteration. A suitable iteration can be achieved by the tested optimization process profile of the main parameters of SMC. Once the parameters of SMC are optimized under a convergent iteration, the system realizes the given performance indices within the shortest time. The experiment indicates that the robustness of the system is improved, and the dynamic and steady performance achieves the given performance indices under a convergent iteration when motor parameters mismatch and load disturbance is added. Moreover, the suitable iteration effectively mitigates the low-speed crawling phenomenon in the system. The correctness and effectiveness of DE-SMC are verified through the experiment.

Composite Differential Evolution Aided Channel Allocation in OFDMA Systems with Proportional Rate Constraints

  • Sharma, Nitin;Anpalagan, Alagan
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.523-533
    • /
    • 2014
  • Orthogonal frequency division multiple access (OFDMA) is a promising technique, which can provide high downlink capacity for the future wireless systems. The total capacity of OFDMA can be maximized by adaptively assigning subchannels to the user with the best gain for that subchannel, with power subsequently distributed by water-filling. In this paper, we propose the use of composite differential evolution (CoDE) algorithm to allocate the subchannels. The CoDE algorithm is population-based where a set of potential solutions evolves to approach a near-optimal solution for the problem under study. CoDE uses three trial vector generation strategies and three control parameter settings. It randomly combines them to generate trial vectors. In CoDE, three trial vectors are generated for each target vector unlike other differential evolution (DE) techniques where only a single trial vector is generated. Then the best one enters the next generation if it is better than its target vector. It is shown that the proposed method obtains higher sum capacities as compared to that obtained by previous works, with comparable computational complexity.

A Hybrid Estimation of Distribution Algorithm with Differential Evolution based on Self-adaptive Strategy

  • Fan, Debin;Lee, Jaewan
    • 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.

Thermal Unit Commitment Using Binary Differential Evolution

  • Jeong, Yun-Won;Lee, Woo-Nam;Kim, Hyun-Houng;Park, Jong-Bae;Shin, Joong-Rin
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.3
    • /
    • pp.323-329
    • /
    • 2009
  • This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems since it is restricted to continuous-valued spaces. This paper proposes binary differential evolution (BDE), which enables the DE to operate in binary spaces and applies the proposed BDE to UC problems. Furthermore, this paper includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in UC problems. Since excessive spinning reserves can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BDE, it is applied to largescale power systems of up to 100-units with a 24-hour demand horizon.

Application of Differential Evolution to Dynamic Economic Dispatch Problem with Transmission Losses under Various Bidding Strategies in Electricity Markets

  • Rampriya, B.;Mahadevan, K.;Kannan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.5
    • /
    • pp.681-688
    • /
    • 2012
  • This paper presents the application of Differential Evolution (DE) algorithm to obtain a solution for Bid Based Dynamic Economic Dispatch (BBDED) problem including the transmission losses and to maximize the social profit in a deregulated power system. The IEEE-30 bus test system with six generators, two customers and two trading periods are considered under various bidding strategies in a day-ahead electricity market. By matching the bids received from supplying and distributing entities, the Independent System Operator (ISO) maximize the social profit, (with the choices available). The simulation results of DE are compared with the results of Particle swarm optimization (PSO). The results demonstrate the potential of DE algorithm and show its effectiveness to solve BBDED.

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.