Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/39470 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/39470 |