The Zero-One Knapsack Problem and Genetic Algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F01%3A6364" target="_blank" >RIV/62690094:18450/01:6364 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
The Zero-One Knapsack Problem and Genetic Algorithms
Original language description
The zero-one knapsack problem is a classical combinatorial problem that has been tackled by various problem solving strategies. This paper was inspired by numerous attempts to solve the problem using genetic algorithms. The problem is very often used asa "good example" of genetic algorithms utilization without any reference to traditional methods that are well known in operation research community. Our aim here is to compare the performance of genetic algorithms and branch-and-bound method on this problem. From our results it is obvious that the simple traditional method outperforms the genetic algorithms in terms of finding optimal solution as well as finding it quickly. Therefore we need a better understandingof which problems are suitable to be tackled by genetic algorithms. We must look for the problems where traditional methods fail and where evolutionary algorithms will have a good chance of being competitive.
Czech name
—
Czech description
—

Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)