A Fitness Distance Correlation Measure for Evolutionary Trees

2009 ◽  
pp. 331-342
Author(s):  
Hyun Jung Park ◽  
Tiffani L. Williams
Keyword(s):  
Evolutionary Trees ◽  
Correlation Measure ◽  
Distance Correlation ◽  
Fitness Distance Correlation

scholarly journals Fitness Distance Correlation in Structural Mutation Genetic Programming

2003 ◽  
pp. 455-464 ◽  
Author(s):  
Leonardo Vanneschi ◽  
Marco Tomassini ◽  
Philippe Collard ◽  
Manuel Clergue
Keyword(s):  
Genetic Programming ◽  
Distance Correlation ◽  
Structural Mutation ◽  
Fitness Distance Correlation

scholarly journals Evolving Solutions to Community-Structured Satisfiability Formulas

2019 ◽  
Vol 33 ◽  
pp. 2346-2353
Author(s):  
Frank Neumann ◽  
Andrew M. Sutton
Keyword(s):  
Community Structure ◽  
Evolutionary Algorithms ◽  
Objective Function ◽  
Search Space ◽  
Propositional Satisfiability ◽  
Satisfying Assignment ◽  
Distance Correlation ◽  
Strong Signal ◽  
Fitness Distance Correlation ◽  
Correlation Properties

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

Fitness Distance Correlation(FDC) As A Hardness Prediction For University Course Timetabling Problem

2008 ◽  
Vol 49 (1) ◽  
Author(s):  
Abu Bakar Md Sultan ◽  
Ramlan Mahmod ◽  
Md Nasir Sulaiman ◽  
Mohd Rizam Abu Bakar ◽  
Mohd Taufik Abdullah
Keyword(s):  
Distance Correlation ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Hardness Prediction ◽  
Fitness Distance Correlation ◽  
Course Timetabling Problem ◽  
University Course

scholarly journals Fitness Distance Correlation Strategy for Solving the RGV Dynamic Scheduling Problem

2020 ◽  
Vol 14 (3) ◽  
pp. 20-40
Author(s):  
Wei Li ◽  
Furong Tian ◽  
Ke Li
Keyword(s):  
Dynamic Scheduling ◽  
Programming Model ◽  
Operating Efficiency ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Distance Correlation ◽  
Fast Running ◽  
Stable Performance ◽  
Fitness Distance Correlation ◽  
Working Efficiency

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.

Sign in / Sign up

Export Citation Format

Share Document