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

[1]  Raymond R. Hill,et al.  Problem reduction heuristic for the 0-1 multidimensional knapsack problem , 2012, Comput. Oper. Res..

[2]  Min Huang,et al.  An Artificial Fish Swarm Algorithm Based and ABC Supported QoS Unicast Routing Scheme in NGI , 2006, ISPA Workshops.

[3]  A. L. Soyster,et al.  Zero-one programming with many variables and few constraints , 1978 .

[4]  Rumen Andonov,et al.  A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem , 2008, Eur. J. Oper. Res..

[5]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[6]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Didier El Baz,et al.  Heuristics for the 0-1 multidimensional knapsack problem , 2009, Eur. J. Oper. Res..

[9]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2011 , 2011, Lecture Notes in Computer Science.

[10]  Ana Maria A. C. Rocha,et al.  Fish swarm intelligent algorithm for bound constrained global optimization , 2009 .

[11]  Ana Maria A. C. Rocha,et al.  An augmented Lagrangian fish swarm based method for global optimization , 2011, J. Comput. Appl. Math..

[12]  Li Zhang,et al.  Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems , 2006, ICNC.

[13]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[14]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[15]  Masatoshi Sakawa,et al.  Genetic algorithms with double strings for 0-1 programming problems , 2003, Eur. J. Oper. Res..

[16]  Geyong Min.  Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings , 2006, ISPA Workshops.

[17]  Saïd Hanafi,et al.  An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..

[18]  Kusum Deep,et al.  A Socio-Cognitive Particle Swarm Optimization for Multi-Dimensional Knapsack Problem , 2008, 2008 First International Conference on Emerging Trends in Engineering and Technology.

[19]  Jian-Wei Ma,et al.  An improved artificial fish-swarm algorithm and its application in feed-forward neural networks , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[20]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[21]  Susan H. Xu,et al.  Greedy algorithm for the general multidimensional knapsack problem , 2007, Ann. Oper. Res..

[22]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[23]  Andreas Drexl,et al.  A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.

[24]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[25]  Yew-Soon Ong,et al.  Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I , 2005, ICNC.

[26]  A. Victor Cabot,et al.  An Enumeration Algorithm for Knapsack Problems , 1970, Oper. Res..

[27]  Ana Maria A. C. Rocha,et al.  Novel Fish Swarm Heuristics for Bound Constrained Global Optimization Problems , 2011, ICCSA.

[28]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[29]  Arnaud Fréville,et al.  The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool , 1996, J. Heuristics.

[30]  Nikos E. Mastorakis,et al.  Image Segmentation with Improved Artificial Fish Swarm Algorithm , 2009 .

[31]  José F. Fontanari,et al.  A statistical analysis of the knapsack problem , 1995 .

[32]  F. Djannaty,et al.  A Hybrid Genetic Algorithm for the Multidimensional Knapsack Problem , 2008 .

[33]  Zheng Zhang,et al.  Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division , 2009, 2009 Fourth International on Conference on Bio-Inspired Computing.

[34]  Kenneth Schilling.  The growth of m-constraint random knapsacks , 1990 .

[35]  S. Raja Balachandar,et al.  A New Heuristic Approach for Large Size Zero-One Multi Knapsack Problem Using Intercept Matrix , 2010 .

[36]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[37]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[38]  Michel Vasquez,et al.  Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..

[39]  R. Battiti,et al.  Local search with memory: benchmarking RTS , 1995 .

[40]  Yong Wang,et al.  Optimal Multiuser Detection with Artificial Fish Swarm Algorithm , 2007, ICIC.