Solving multidimensional 0-1 knapsack problem with an artificial fish swarm algorithm
The multidimensional 0–1 knapsack problem is a combinatorial optimization problem, which is NP-hard and arises in many fields of optimization. Exact as well as heuristic methods exist for solving this type of problem. Recently, a population-based artificial fish swarm algorithm was proposed and appl...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/20051 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/20051 |