A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem - Advances in Pure Mathematics

APM > Vol.6 No.10, September 2016

Advances in Pure Mathematics

Volume 6, Issue 10 (September 2016)

ISSN Print: 2160-0368 ISSN Online: 2160-0384

Google-based Impact Factor: 0.50 Citations h5-index & Ranking

A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem ()

HTML XML

Download as PDF (Size: 362KB) PP. 659-675

DOI: 10.4236/apm.2016.610055 1,412 Downloads 2,570 Views Citations

Author(s)

Quan Yuan, Zhixin Yang

Affiliation(s)

Department of Mathematical Science, Ball State University, Muncie, IN, USA.

ABSTRACT

A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.

KEYWORDS

Weight-Coding, Evolutionary Algorithm, Multidimensional Knapsack Problem (MKP)

Share and Cite:

Yuan, Q. and Yang, Z. (2016) A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem. Advances in Pure Mathematics, 6, 659-675. doi: 10.4236/apm.2016.610055.

Cited by

[1]	The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches
	2018

[2]	An Approximate Algorithm for Lexicographic Search in Multiple Orders for the Solution of the Multidimensional Boolean Knapsack Problem
	Cybernetics and Systems Analysis, 2018

[3]	Наближений алгоритм лексикографічного пошуку у багатьох порядках розв'язку багатовимірної булевої задачі про ранець
	2018

[4]	Improve the Performance of a Complex FMS with a Hybrid Machine Learning Algorithm
	2017