Affordable Access

Publisher Website

Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems

Authors
Journal
European Journal of Operational Research
0377-2217
Publisher
Elsevier
Publication Date
Volume
181
Issue
3
Identifiers
DOI: 10.1016/j.ejor.2006.08.006
Keywords
  • Evolutionary Computations
  • Multiobjective Combinatorial Optimization
  • 0/1 Multiobjective Knapsack Problems
  • Local Dominance
  • Local Recombination
  • Alignment Of The Principle Search Direction
  • Polar Coordinates
  • Optimum Locality
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract This work studies and compares the effects on performance of local dominance and local recombination applied with different locality in multiobjective evolutionary algorithms on combinatorial 0/1 multiobjective knapsack problems. For this purpose, we introduce a method that creates a neighborhood around each individual and assigns a local dominance rank after alignment of the principle search direction of the neighborhood by using polar coordinates in objective space. For recombination a different neighborhood determined around a random principle search direction is created. The neighborhood sizes for dominance and recombination are separately controlled by two different parameters. Experimental results show that the optimum locality of dominance is different from the optimum locality of recombination. Additionally, it is shown that the performance of the algorithm that applies local dominance and local recombination with different locality is significantly better than the performance of algorithms applying local dominance alone, local recombination alone, or dominance and recombination globally as conventional approaches do.

There are no comments yet on this publication. Be the first to share your thoughts.