A Genetic Algorithm to Solve the Multidimensional Knapsack Problem

Murat Ersen Berberler; Asli Guler; Urfat G. Nurıyev

doi:10.3390/mca18030486

You are currently on the new version of our website. Access the old version .

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).

Article

1 December 2013

A Genetic Algorithm to Solve the Multidimensional Knapsack Problem

and

Department of Computer Science, Dokuz Eylul University, Izmir, Turkey

Department of Mathematics, Yasar University, Izmir, Turkey

Department of Mathematics, Ege University, Izmir, Turkey

Author to whom correspondence should be addressed.

Math. Comput. Appl.2013, 18(3), 486-494;https://doi.org/10.3390/mca18030486

Version Notes

Order Reprints

Abstract

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.

Keywords:

Multidimensional Knapsack Problem; Genetic Algorithm; Heuristic Approach; Evolutionary Algorithms

Article Metrics

Citations

Article Access Statistics

Journal Statistics

Multiple requests from the same IP address are counted as one view.

Müntz-Legendre Polynomial Solutions of Linear Delay Fredholm Integro-Differential Equations and Residual Correction

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem