A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem

DOI10.1016/J.EJOR.2021.10.033MaRDI QIDQ2116840zbMATHOpenAlexFDO

Authors H. Mert Sahinkoc, Ümit Bilge

Publication date 18 March 2022

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

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

zbMATH Keywords

combinatorial optimizationmultiple objective programmingevolutionary computationsco-evolutionmany-objective

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A new evolutionary algorithm for the multiobjective \(0/1\) knapasck problem
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
• Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem

Cites work

• scientific article; zbMATH DE number 3679573 (Why is no real title available?)
• scientific article; zbMATH DE number 2159379 (Why is no real title available?)
• scientific article; zbMATH DE number 2222824 (Why is no real title available?)
• A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design
• A parallel multiple reference point approach for multi-objective optimization
• An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization
• Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems
• Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems
• Multi-objective optimization using evolutionary algorithms
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Preference-inspired co-evolutionary algorithms using weight vectors
• Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems

Cited in

(1)

• Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems

Describes a project that uses

Uses Software

• NBI
• MOEA/D
• HypE

This page was built for publication: A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem

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