Next Article in Journal
A New Heuristic Algorithm to Solve the Maximum Independent Set Problem
Previous Article in Journal
Müntz-Legendre Polynomial Solutions of Linear Delay Fredholm Integro-Differential Equations and Residual Correction
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 18
Issue 3
10.3390/mca18030486
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
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 the previous journal publisher.
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Genetic Algorithm to Solve the Multidimensional Knapsack Problem

by
Murat Ersen Berberler
1,
Asli Guler
2,* and
Urfat G. Nurıyev
3
1
Department of Computer Science, Dokuz Eylul University, Izmir, Turkey
2
Department of Mathematics, Yasar University, Izmir, Turkey
3
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
Published: 1 December 2013
Versions Notes

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 Multidimensional Knapsack Problem; Genetic Algorithm; Heuristic Approach; Evolutionary Algorithms

Share and Cite

MDPI and ACS Style

Berberler, M.E.; Guler, A.; Nurıyev, U.G. A Genetic Algorithm to Solve the Multidimensional Knapsack Problem. Math. Comput. Appl. 2013, 18, 486-494. https://doi.org/10.3390/mca18030486

AMA Style

Berberler ME, Guler A, Nurıyev UG. A Genetic Algorithm to Solve the Multidimensional Knapsack Problem. Mathematical and Computational Applications. 2013; 18(3):486-494. https://doi.org/10.3390/mca18030486

Chicago/Turabian Style

Berberler, Murat Ersen, Asli Guler, and Urfat G. Nurıyev. 2013. "A Genetic Algorithm to Solve the Multidimensional Knapsack Problem" Mathematical and Computational Applications 18, no. 3: 486-494. https://doi.org/10.3390/mca18030486

Article Metrics

Back to TopTop