Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm

DOI10.1007/978-3-030-58930-1_4MaRDI QIDQ2093908zbMATH OpenOpenAlexFDO

Authors Ozgur Kabadurmus, M. Fatih Tasgetiren, Hande Oztop, M. Serdar Erdogan

Publication date 27 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-58930-1_4

zbMATH Keywords

binary genetic algorithmPareto-optimal solution set

Mathematics Subject Classification ID

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

Recommendations

• A genetic algorithm to solve the multidimensional knapsack problem
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• scientific article; zbMATH DE number 1910919
• A genetic algorithm for the multidimensional knapsack problem
• Computational Science - ICCS 2004

Cited in

(2)

• A constraint handling technique using compound distance for solving constrained multi-objective optimization problems
• A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem

This page was built for publication: Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm

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