Sghuffled frog leaping algorithm with modified local search using one-point crossover operation applied to the bounded knapsack problem
The knapsack problem is one of the most studied problems in combinatorial optimization because analyzing this problem can help in solving other complex optimization problems. The knapsack problem entails forming a combination of items from a set that gives the maximum total profit without exceeding...
| Autor principal: | |
|---|---|
| Formato: | Thesis |
| Idioma: | English |
| Publicado em: |
2008
|
| Assuntos: |