Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Login
Register
Reset Password
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Foundations of Computing and Decision Sciences
Volume 47 (2022): Issue 3 (September 2022)
Open Access
On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle
Soukaina Laabadi
Soukaina Laabadi
,
Mohamed Naimi
Mohamed Naimi
,
Hassan El Amri
Hassan El Amri
and
Boujemâa Achchab
Boujemâa Achchab
| Oct 08, 2022
Foundations of Computing and Decision Sciences
Volume 47 (2022): Issue 3 (September 2022)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Oct 08, 2022
Page range:
247 - 269
Received:
Sep 03, 2021
Accepted:
Jul 12, 2022
DOI:
https://doi.org/10.2478/fcds-2022-0014
Keywords
Genetic Algorithm
,
K-Means Clustering Method
,
Optimization
,
Selection Operator
,
0/1 Multidimensional Knapsack Problem
© 2022 Soukaina Laabadi et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.