Aging, double helix and small world property in genetic algorithms

Details Aging, double helix and small world property in genetic algorithms Aging, double helix and small world property in genetic algorithms

2002-05-23

arxiv.org/abs/cs/0205061v1

Computer Science

Neural and Evolutionary Computing

Submitted to the workshop on evolutionary algorithms, Krakow (Cracow), Poland, Sept. 30, 2002, 6 pages, no figures, LaTeX 2.09

Scientific paper

Over a quarter of century after the invention of genetic algorithms and miriads of their modifications, as well as successful implementations, we are still lacking many essential details of thorough analysis of it's inner working. One of such fundamental questions is: how many generations do we need to solve the optimization problem? This paper tries to answer this question, albeit in a fuzzy way, making use of the double helix concept. As a byproduct we gain better understanding of the ways, in which the genetic algorithm may be fine tuned.

Affiliated with

Also associated with

No associations

Rating

Aging, double helix and small world property in genetic algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Aging, double helix and small world property in genetic algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aging, double helix and small world property in genetic algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454741