A Genetic Algorithm to Solve the Multidimensional Knapsack Problem

Mathematical and Computational Applications

Berberler, Murat Ersen¹ 

关键词: Multidimensional Knapsack Problem;    Genetic Algorithm;    Heuristic Approach;    Evolutionary Algorithms;   

DOI  :  10.3390/mca18030486

学科分类：计算数学

来源: mdpi

【 摘 要 】

In this paper, The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm, initial population is not randomly generated in the proposed algorithm, thus the solution space is scanned more efficiently. Moreover, the algorithm is written in C programming language and is tested on randomly generated instances. It is seen that the algorithm yields optimal solutions for all instances.

【 授权许可】

CC BY