Fitness Uniform Optimization

Details Fitness Uniform Optimization Fitness Uniform Optimization

2006-10-20

arxiv.org/abs/cs/0610126v1

IEEE Transactions on Evolutionary Computation, 10:5 (2006) 568-589

Computer Science

Neural and Evolutionary Computing

25 double-column pages, 12 figures

Scientific paper

10.1109/TEVC.2005.863127

In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. The right selection pressure is critical in ensuring sufficient optimization progress on the one hand and in preserving genetic diversity to be able to escape from local optima on the other hand. Motivated by a universal similarity relation on the individuals, we propose a new selection scheme, which is uniform in the fitness values. It generates selection pressure toward sparsely populated fitness regions, not necessarily toward higher fitness, as is the case for all other selection schemes. We show analytically on a simple example that the new selection scheme can be much more effective than standard selection schemes. We also propose a new deletion scheme which achieves a similar result via deletion and show how such a scheme preserves genetic diversity more effectively than standard approaches. We compare the performance of the new schemes to tournament selection and random deletion on an artificial deceptive problem and a range of NP-hard problems: traveling salesman, set covering and satisfiability.

Affiliated with

Also associated with

No associations

Rating

Fitness Uniform Optimization 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 Fitness Uniform Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fitness Uniform Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361770