A genetic algorithm for the multidimensional knapsack problem

A genetic algorithm for the multidimensional knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20002396
Country: Netherlands
Volume: 4
Issue: 1
Start Page Number: 63
End Page Number: 86
Publication Date: Mar 1998
Journal: Journal of Heuristics
Authors: ,
Keywords: heuristics
Abstract:

In this paper we present a heuristic based upon genetic algorithms for the multidimensional knapsack problem. A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach. Computational results show that the genetic algorithm heuristic is capable of obtaining high-quality solutions for problems of various characteristics, whilst requiring only a modest amount of computational effort. Computational results also show that the genetic algorithm heuristic gives superior quality solutions to a number of other heuristics.

Reviews

Required fields are marked *. Your email address will not be published.