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...

Full description

Bibliographic Details
Main Author: Azad, Md. Abul Kalam (author)
Other Authors: Rocha, Ana Maria A. C. (author), Fernandes, Edite Manuela da G. P. (author)
Format: conferencePaper
Language:eng
Published: 2012
Subjects:
0–1 knapsack problem
Multiple constraints
Artificial fish swarm
Decoding algorithm
Science & Technology
Online Access:http://hdl.handle.net/1822/20051
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/20051

Internet

http://hdl.handle.net/1822/20051

Similar Items