The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study

DOI10.1016/J.COR.2009.02.027zbMath1176.90524OpenAlexW2044951692MaRDI QIDQ833551

Brahim Aghezzaf, Mohamed Naimi

Publication date: 14 August 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.027

zbMATH Keywords

crossover operatorsmultiobjective \(0/1\) knapsack problem (MOKP)multiobjective combinatorial optimization (MOCO)multiobjective evolutionary algorithms (MOEAs)

Mathematics Subject Classification ID

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

Related Items (3)

A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem

Uses Software

• MOTGA
• ve08
• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• Evolutionary algorithms. The role of mutation and recombination
• An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization
• Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems
• Multi‐objective combinatorial optimization problems: A survey
• Multicriteria Optimization

This page was built for publication: The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study