loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Robert Collier and Mark Wineberg

Affiliation: University of Guelph, Canada

ISBN: 978-989-8425-31-7

Keyword(s): Genetic Algorithms, Distance Measurement, Complexity Analysis.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Representation Techniques ; Soft Computing

Abstract: When studying evolutionary systems, either from the natural world or artificially constructed using simulated populations, researchers must be able to quantify the genotypic differences that are observed. With the simple genetic algorithm employing both a unary mutation operator and a binary recombination operator to maintain variation in the population, it is exceedingly difficult to quantify the distance between elements of the chromosome space with an approach that is truly representative of the distance that would need to be traversed by the evolutionary mechanism. Although evaluation function dependence and the binary arity of the recombination operator both contribute to this difficulty, it is possible to redefine the function of recombination in such a way as to facilitate the computation of a more representative measurement of the distance the genetic algorithm would need to traverse to create a specific chromosome from a given population. The recursive approach presented here entails the definition of unary recombination operators and ultimately results in a technique for calculating the recombinational distance between chromosomes with a time complexity that is improved logarithmically over a simplistic approach. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.224.150.24

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Collier R. and Wineberg M. (2010). EXPLORING THE COMPLEXITY OF A PROPOSED RECURSIVE MEASURE OF RECOMBINATIONAL DISTANCE.In Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010) ISBN 978-989-8425-31-7, pages 85-94. DOI: 10.5220/0003085800850094

@conference{icec10,
author={Robert Collier and Mark Wineberg},
title={EXPLORING THE COMPLEXITY OF A PROPOSED RECURSIVE MEASURE OF RECOMBINATIONAL DISTANCE},
booktitle={Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)},
year={2010},
pages={85-94},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003085800850094},
isbn={978-989-8425-31-7},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)
TI - EXPLORING THE COMPLEXITY OF A PROPOSED RECURSIVE MEASURE OF RECOMBINATIONAL DISTANCE
SN - 978-989-8425-31-7
AU - Collier R.
AU - Wineberg M.
PY - 2010
SP - 85
EP - 94
DO - 10.5220/0003085800850094

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.