An improved shuffled frog leaping algorithm and its application in 0-1 Knapsack Problem
Wenxiang Liu, Yueguang Li
Available Online July 2015.
- https://doi.org/10.2991/icismme-15.2015.80How to use a DOI?
- Artificial fish swarm algorithm; Membrane computing; Optimization; 0-1 Knapsack Problem; Simulation
- 0-1 knapsack problem is a typical NP complete problem. Shuffled frog leaping algorithm is applied successfully in many combinational optimization problems. Therefore, the paper introduces an improved shuffled frog leaping algorithm for solving 0-1 knapsack problem. It greatly reduces the searching time of shuffled frog leaping algorithm. It also effectively ameliorates the disadvantage of easily falling in local best of shuffled frog leaping algorithm. When the number of article is big, it also can obtain better effects. The simulation results show that the algorithm is more efficient.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Wenxiang Liu AU - Yueguang Li PY - 2015/07 DA - 2015/07 TI - An improved shuffled frog leaping algorithm and its application in 0-1 Knapsack Problem BT - First International Conference on Information Sciences, Machinery, Materials and Energy PB - Atlantis Press SP - 403 EP - 407 SN - 1951-6851 UR - https://doi.org/10.2991/icismme-15.2015.80 DO - https://doi.org/10.2991/icismme-15.2015.80 ID - Liu2015/07 ER -