A Practical Approach Towards Multidimensional Knapsack Problem (MKP) Using Genetic Algorithm

Volume 14 Issue 1 May 2021

Download

Author(s): Muhammad Irfan Leghari, Aftab Ahmed Shaikh
Abstract Knapsack is a combinational optimization problem which is based on selection of the best possible collection of values and weights capacity. Selection of values varies and depends on the social and environmental situations. The research work is focused on practical approach of the Multidimensional Knapsack problem (MKP). This paper comprises an introductory part of Genetic Algorithm and understanding towards Knapsack problem. The program is developed in Python programming language using the pyEasyGa libraries. The MKP program Genetic Algorithm class is initialized within defined population size. Fitness function is defined to evaluate best solutions in shape of best values to maximize the beneficial point.
Keywords Multidimensional Knapsack Problem (MKP); Genetic Algorithm; Python, Fitness Function
Year 2021
Volume 14
Issue 1
Type Research paper, manuscript, article
Journal Name Journal of Information & Communication Technology (JICT)
Publisher Name ILMA University
Jel Classification -
DOI -
ISSN no (E, Electronic) 2075-7239
ISSN no (P, Print) 2415-0169
Country Pakistan
City Karachi
Institution Type University
Journal Type Open Access
Manuscript Processing Blind Peer Reviewed
Format PDF
Paper Link http://jict.ilmauniversity.edu.pk/arc/Vol14/14.1/5.pdf
Page 32-35