A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem
DOI10.1016/J.EJOR.2021.10.033zbMATH Open1495.90184OpenAlexW3210020537MaRDI QIDQ2116840FDOQ2116840
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
combinatorial optimizationmultiple objective programmingevolutionary computationsco-evolutionmany-objective
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Multi-objective optimization using evolutionary algorithms
- Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems
- An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization
- A parallel multiple reference point approach for multi-objective optimization
- A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design
- Preference-inspired co-evolutionary algorithms using weight vectors
- Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems
- Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms π π
- Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study π π
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem π π
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem π π
- 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 π π
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)