On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle
Authors
Soukaina Laabadi
Hassan II University, Teacher’s Training College (ENS), Casablanca, Morocco
Mohamed Naimi
Hassan First University, National School of Applied Sciences (ENSA), Berrechid, Morocco
Hassan El Amri
Hassan II University, Teacher’s Training College (ENS), Casablanca, Morocco
Boujemâa Achchab
Hassan First University, National School of Applied Sciences (ENSA), Berrechid, Morocco
Language: English
Page range: 247 - 269
Submitted on: Sep 3, 2021
Accepted on: Jul 12, 2022
Published on: Oct 8, 2022
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2022 Soukaina Laabadi, Mohamed Naimi, Hassan El Amri, Boujemâa Achchab, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.