Fitness distance correlation and mixed search strategy for differential evolution

2020 ◽  
Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang
Author(s):  
Frank Neumann ◽  
Andrew M. Sutton

We study the ability of a simple mutation-only evolutionary algorithm to solve propositional satisfiability formulas with inherent community structure. We show that the community structure translates to good fitness-distance correlation properties, which implies that the objective function provides a strong signal in the search space for evolutionary algorithms to locate a satisfying assignment efficiently. We prove that when the formula clusters into communities of size s ∈ ω(logn) ∩O(nε/(2ε+2)) for some constant 0


2008 ◽  
Vol 49 (1) ◽  
Author(s):  
Abu Bakar Md Sultan ◽  
Ramlan Mahmod ◽  
Md Nasir Sulaiman ◽  
Mohd Rizam Abu Bakar ◽  
Mohd Taufik Abdullah

Author(s):  
Wei Li ◽  
Furong Tian ◽  
Ke Li

Rail guide vehicle (RGV) problems have the characteristics of fast running, stable performance, and high automation. RGV dynamic scheduling has a great impact on the working efficiency of an entire automated warehouse. However, the relative intelligent optimization research of different workshop components for RGV dynamic scheduling problems are insufficient scheduling in the previous works. They appear idle when waiting, resulting in reduced operating efficiency during operation. This article proposes a new distance landscape strategy for the RGV dynamic scheduling problems. In order to solve the RGV dynamic scheduling problem more effectively, experiments are conducted based on the type of computer numerical controller (CNC) with two different procedures programming model in solving the RGV dynamic scheduling problems. The experiment results reveal that this new distance landscape strategy can provide promising results and solves the considered RGV dynamic scheduling problem effectively.


2011 ◽  
Vol 243-249 ◽  
pp. 4642-4646
Author(s):  
Hai Ying Deng ◽  
Zhi Gang Zhang ◽  
Yi Gang Yu

Differential evolution algorithm (differential evolution, DE) is a multi-objective evolutionary algorithm based on groups, which instructs optimization search by swarm intelligence produced by co-operation and competition among individuals within groups. While it can track the dynamics of the current search by the DE specific memory, in order to adjust their search strategy. The strong global convergence and robustness of the characteristics can solve the complex optimization problem which it hardly solves with the mathematical programming methods. This paper presents it to the research of short-term scheduling of hydro plant. Accord to the application of the hydro unit, the results shows that reasonable and effective.


Sign in / Sign up

Export Citation Format

Share Document