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

DOI10.1016/J.EJOR.2006.08.006zbMATH Open1123.90069OpenAlexW2019894957MaRDI QIDQ877676FDOQ877676

Authors 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

evolutionary computationspolar coordinatesmultiobjective 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)

Recommendations

• Computational Science - ICCS 2004
• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
• scientific article; zbMATH DE number 1784661
• A new evolutionary algorithm for the multiobjective \(0/1\) knapasck problem
• A hybrid multiobjective evolutionary algorithm: Striking a balance with local search

Cites work

• scientific article; zbMATH DE number 1975097 (Why is no real title available?)
• scientific article; zbMATH DE number 2013556 (Why is no real title available?)
• scientific article; zbMATH DE number 2046100 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Evolutionary Multi-Criterion Optimization
• Genetic local search for multi-objective combinatorial optimization
• Multi-objective optimization using evolutionary algorithms

Cited in

(8)

• scientific article; zbMATH DE number 2013570 (Why is no real title available?)
• A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem
• 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
• Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study
• The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
• Evolutionary Multi-Criterion Optimization

Describes a project that uses

Uses Software

• SPEA2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877676)