Solving multidimensional 0---1 knapsack problem with an artificial fish swarm algorithm

Authors:
Md. Abul Kalam Azad;Ana Maria A. C. Rocha;Edite M. G. P. Fernandes
Affiliations:
Algoritmi R&D Centre, University of Minho, Braga, Portugal;Department of Production and Systems, University of Minho, Braga, Portugal,Algoritmi R&D Centre, University of Minho, Braga, Portugal;Algoritmi R&D Centre, University of Minho, Braga, Portugal
Venue:
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Year:
2012

Citing 12
Cited 1

A simulated annealing approach to the multiconstraint zero-one knapsack problem

Computing
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
The zero/one multiple knapsack problem and genetic algorithms

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
A new ant colony optimization algorithm for the multidimensional Knapsack problem

Computers and Operations Research
A Socio-Cognitive Particle Swarm Optimization for Multi-Dimensional Knapsack Problem

ICETET '08 Proceedings of the 2008 First International Conference on Emerging Trends in Engineering and Technology
Problem reduction heuristic for the 0-1 multidimensional knapsack problem

Computers and Operations Research
An augmented Lagrangian fish swarm based method for global optimization

Journal of Computational and Applied Mathematics
Novel fish swarm heuristics for bound constrained global optimization problems

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
An artificial fish swarm algorithm based and ABC supported qos unicast routing scheme in NGI

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Genetic algorithm based on the orthogonal design for multidimensional knapsack problems

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I

A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 applied in an engineering context. In this paper, we present a binary version of the artificial fish swarm algorithm for solving multidimensional 0---1 knapsack problem. Infeasible solutions are made feasible by a decoding algorithm. We test the presented method with a set of benchmark problems and compare the obtained results with other methods available in literature. The tested method appears to give good results when solving these problems.