Have a personal or library account? Click to login
On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle Cover

On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle

Foundations of Computing and Decision Sciences
Volume 47 (2022): Issue 3 (September 2022)
By: Soukaina Laabadi,  Mohamed Naimi,  Hassan El Amri and  Boujemâa Achchab  
Open Access
|Oct 2022

Authors

Soukaina Laabadi

soukainalaabadi@gmail.com

Hassan II University, Teacher’s Training College (ENS), Casablanca, Morocco

Mohamed Naimi

mohamed.naimi@uhp.ac.ma

Hassan First University, National School of Applied Sciences (ENSA), Berrechid, Morocco

Hassan El Amri

hassanelamri@gmail.com

Hassan II University, Teacher’s Training College (ENS), Casablanca, Morocco

Boujemâa Achchab

achchab@estb.ac.ma

Hassan First University, National School of Applied Sciences (ENSA), Berrechid, Morocco
DOI: https://doi.org/10.2478/fcds-2022-0014 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Journal RSS Feed
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:
Genetic Algorithm,
K-Means Clustering Method,
Optimization,
Selection Operator,
0/1 Multidimensional Knapsack Problem
Related subjects:
Computer sciences,
Artificial intelligence,
Software development

© 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.

Previous articleVolume 47 (2022): Issue 3 (September 2022)Next article