Solving Multidimensional Knapsack Problem with Bayesian Multiploid Genetic Algorithm
Journal of Soft Computing and Artificial Intelligence · 2022
DOI: 10.55195/jscai.1216193 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Soft Computing and Artificial Intelligence, 2022. Verfasst von Emrullah GAZİOĞLU. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
Solving optimization problems is still a big challenge in the area of optimization algorithms. Many proposed algorithms in the literature don’t consider the relations between the variables of the nature of the problem. However, a recently published algorithm, called “Bayesian Multiploid Genetic Algorithm” exploits the relations between the variables and then solves the given problem. It also uses more than one genotype unlike the simple Genetic Algorithm (GA) and it acts like an implicit memory in order to remember the old but good solutions. In this work, the well-known Multidimensional Knapsack Problem (MKP) is solved by the Bayesian Multiploid Genetic Algorithm. And the results show that exploiting relations between the variables gets a huge advantage in solving the given problem.
Zitieren
APA
GAZİOĞLU, E. (2022). Solving Multidimensional Knapsack Problem with Bayesian Multiploid Genetic Algorithm. Journal of Soft Computing and Artificial Intelligence. https://doi.org/10.55195/jscai.1216193
Vancouver
GAZİOĞLU E. Solving Multidimensional Knapsack Problem with Bayesian Multiploid Genetic Algorithm. Journal of Soft Computing and Artificial Intelligence. 2022. doi:10.55195/jscai.1216193
BibTeX
@article{GAZOLU2022,
author = {GAZİOĞLU, Emrullah},
title = {Solving Multidimensional Knapsack Problem with Bayesian Multiploid Genetic Algorithm},
journal = {Journal of Soft Computing and Artificial Intelligence},
year = {2022},
doi = {10.55195/jscai.1216193}
}
EUVIMED