Initial studies on the hybridization of particle swarm optimization-tabu search (PSO-TS) approach applied to the classical 0/1knapsack problem
The classical 0/1 Knapsack Problem is a well-known optimization problem occurring in many real-world problems and is considered to be nonpolynomial-hand (NP-hard) by mathematicians. Different knapsack algorithms have already been studied and used to solve for the optimal solution in the knapsack pro...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2006
|