Shuffled frog leaping algorithm and its application to 0/1 knapsack problem

Abstract This paper proposes a modified discrete shuffled frog leaping algorithm (MDSFL) to solve 01 knapsack problems. The proposed algorithm includes two important operations: the local search of the ‘particle swarm optimization’ technique; and the competitiveness mixing of information of the ‘shuffled complex evolution’ technique. Different types of knapsack problem instances are generated to test the convergence property of MDSFLA and the result shows that it is very effective in solving small to medium sized knapsack problems. Further, computational experiments with a set of large-scale instances show that MDSFL can be an efficient alternative for solving tightly constrained 01 knapsack problems.

[1]  Nikitas J. Dimopoulos,et al.  Resource allocation on computational grids using a utility model and the knapsack problem , 2009, Future Gener. Comput. Syst..

[2]  Zhao Jian-ying.  Nonlinear Reductive Dimension Approximate Algorithm for 0-1 Knapsack Problem , 2007 .

[3]  FU Yongjun.  On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem , 2008 .

[4]  Tarek Hegazy,et al.  Comparison of Two Evolutionary Algorithms for Optimization of Bridge Deck Repairs , 2006, Comput. Aided Civ. Infrastructure Eng..

[5]  Shuji Hashimoto,et al.  Landscape analyses and global search of knapsack problems , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[6]  Zhuangkuo Li,et al.  A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem , 2009, 2009 Chinese Control and Decision Conference.

[7]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[8]  George Mavrotas,et al.  Selection among ranked projects under segmentation, policy and logical constraints , 2008, Eur. J. Oper. Res..

[9]  You Wei.  Study of Greedy-policy-based Algorithm for 0/1 Knapsack Problem , 2007 .

[10]  Tinglei Huang,et al.  Genetic Algorithm Based on Greedy Strategy in the 0-1 Knapsack Problem , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[11]  Hanxiao Shi,et al.  Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm , 2006, 2006 IEEE International Conference on Information Acquisition.

[12]  G B Gharehpetian,et al.  Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm , 2011, IEEE Transactions on Power Systems.

[13]  Muzaffar Eusuff,et al.  Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization , 2006 .

[14]  Feng-Tse Lin,et al.  Solving the knapsack problem with imprecise weight coefficients using genetic algorithms , 2008, Eur. J. Oper. Res..

[15]  Yang Ye,et al.  Solving TSP with Shuffled Frog-Leaping Algorithm , 2008 .

[16]  F. Sibel Salman,et al.  Pre-disaster investment decisions for strengthening a highway network , 2010, Comput. Oper. Res..

[17]  Justin Yates,et al.  A constrained binary knapsack approximation for shortest path network interdiction , 2011, Comput. Ind. Eng..

[18]  Chao Liu,et al.  A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem , 2009, 2009 International Association of Computer Science and Information Technology - Spring Conference.

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Alireza Rahimi-Vahed,et al.  Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm , 2008, Soft Comput..

[21]  Yanfeng Wang,et al.  An improved shuffled frog leaping algorithm with cognitive behavior , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[22]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[23]  Yanchun Liang,et al.  A novel quantum swarm evolutionary algorithm and its applications , 2007, Neurocomputing.

[24]  Mohammed Atiquzzaman,et al.  Optimal design of water distribution network using shu2ed complex evolution , 2004 .

[25]  George W. Irwin,et al.  Intelligent Control and Automation , 2006 .

[26]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[27]  D. FAYARD,et al.  Resolution of the 0–1 knapsack problem: Comparison of methods , 1975, Math. Program..

[28]  Chen Fang,et al.  An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem , 2011, Inf. Sci..

[29]  Zhu Ying,et al.  DNA ligation design and biological realization of knapsack problem , 2009 .