Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems
The 0–1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in spac...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/26661 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/26661 |