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

DOI10.1016/j.ejor.2006.08.006zbMath1123.90069OpenAlexW2019894957MaRDI QIDQ877676

Hiroyuki Sato, Hernán E. Aguirre, Kiyoshi Tanaka

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.006

zbMATH Keywords

polar coordinatesevolutionary computationsmultiobjective combinatorial optimization0/1 multiobjective knapsack problemsalignment of the principle search directionlocal dominancelocal recombinationoptimum locality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (4)

Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem

Uses Software

• SPEA2

Cites Work

• Evolutionary Multi-Criterion Optimization
• Genetic local search for multi-objective combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems