Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to the particular context of the quest for the Pareto-optimal set. The only exceptions are some mating restrictions that take in account the distance between the potential mates - but contradictory conclusions have been reported. This paper introduces a particular mating restriction for Evolutionary Multi-objective Algorithms, based on the Pareto dominance relation: the partner of a non-dominated individual will be preferably chosen among the individuals of the population that it dominates. Coupled with the BLX crossover operator, two different ways of generating offspring are proposed. This recombination scheme is validated within the well-known NSGA-II framework on three bi-objective benchmark problems and one real-world bi-objective constrained optimization problem. An acceleration of the progress of the population toward the Pareto set is observed on all problems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dominance Based Crossover Operator for Evolutionary Multi-objective 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 Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-690470

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.