Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2014, Article ID 857254, 17 pages
http://dx.doi.org/10.1155/2014/857254
Research Article

An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems

1School of Information Engineering, Shijiazhuang University of Economics, Shijiazhuang 050031, China
2School of Computer Science and Technology, Jiangsu Normal University, Xuzhou, Jiangsu 221116, China
3School of Mathematical Science, Kaili University, Kaili, Guizhou 556011, China

Received 4 June 2014; Revised 13 September 2014; Accepted 14 September 2014; Published 22 October 2014

Academic Editor: Saeid Sanei

Copyright © 2014 Yanhong Feng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. X.-S. Yang, S. Koziel, and L. Leifsson, “Computational optimization, modelling and simulation: Recent trends and challenges,” in Proceedings of the 13th Annual International Conference on Computational Science (ICCS '13), vol. 18, pp. 855–860, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  2. R. Storn and K. Price, “Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. X. Li and M. Yin, “An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure,” Advances in Engineering Software, vol. 55, pp. 10–31, 2013. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. L. Guo, G.-G. Wang, H. Wang, and D. Wang, “An effective hybrid firefly algorithm with harmony search for global numerical optimization,” The Scientific World Journal, vol. 2013, Article ID 125625, 9 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. A. H. Gandomi and A. H. Alavi, “Krill herd: a new bio-inspired optimization algorithm,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, no. 12, pp. 4831–4845, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. G.-G. Wang, A. H. Gandomi, and A. H. Alavi, “An effective krill herd algorithm with migration operator in biogeography-based optimization,” Applied Mathematical Modelling, vol. 38, no. 9-10, pp. 2454–2462, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. G.-G. Wang, A. H. Gandomi, and A. H. Alavi, “Stud krill herd algorithm,” Neurocomputing, vol. 128, pp. 363–370, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Wang, L. Guo, H. Wang, H. Duan, L. Liu, and J. Li, “Incorporating mutation scheme into krill herd algorithm for global numerical optimization,” Neural Computing and Applications, vol. 24, no. 3-4, pp. 853–871, 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. G.-G. Wang, L. Guo, A. H. Gandomi, G.-S. Hao, and H. Wang, “Chaotic krill herd algorithm,” Information Sciences, vol. 274, pp. 17–34, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. G. G. Wang, A. H. Gandomi, A. H. Alavi, and G. S. Hao, “Hybrid krill herd algorithm with differential evolution for global numerical optimization,” Neural Computing and Applications, vol. 25, no. 2, pp. 297–308, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Guo, G.-G. Wang, A. H. Gandomi, A. H. Alavi, and H. Duan, “A new improved krill herd algorithm for global numerical optimization,” Neurocomputing, vol. 138, pp. 392–402, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. G.-G. Wang, A. H. Gandomi, and A. H. Alavi, “A chaotic particle-swarm krill herd algorithm for global numerical optimization,” Kybernetes, vol. 42, no. 6, pp. 962–978, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. X. Li, J. Zhang, and M. Yin, “Animal migration optimization: an optimization algorithm inspired by animal migration behavior,” Neural Computing and Applications, vol. 24, no. 7-8, pp. 1867–1877, 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Let a biogeography-based optimizer train your multi-layer perceptron,” Information Sciences, vol. 269, pp. 188–209, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. S. Mirjalili, S. Z. Mohd Hashim, and H. Moradian Sardroudi, “Training feedforward neural networks using hybrid particle swarm optimization and gravitational search algorithm,” Applied Mathematics and Computation, vol. 218, no. 22, pp. 11125–11137, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  19. X.-S. Yang, “A new metaheuristic bat-inspired algorithm,” in Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65–74, Springer, Berlin, Germany, 2010. View at Google Scholar
  20. S. Mirjalili, S. M. Mirjalili, and X.-S. Yang, “Binary bat algorithm,” Neural Computing and Applications, vol. 25, no. 3-4, pp. 663–681, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Kumar and P. K. Singh, “Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms,” Applied Soft Computing Journal, vol. 10, no. 3, pp. 711–718, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Zou, L. Gao, S. Li, and J. Wu, “Solving 0-1 knapsack problem by a novel global harmony search algorithm,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 1556–1564, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. T. K. Truong, K. Li, and Y. Xu, “Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem,” Applied Soft Computing Journal, vol. 13, no. 4, pp. 1774–1780, 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. A. Gherboudj, A. Layeb, and S. Chikhi, “Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm,” International Journal of Bio-Inspired Computation, vol. 4, no. 4, pp. 229–236, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Layeb, “A novel quantum inspired cuckoo search for knapsack problems,” International Journal of Bio-Inspired Computation, vol. 3, no. 5, pp. 297–305, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. Y. Feng, K. Jia, and Y. He, “An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems,” Computational Intelligence and Neuroscience, vol. 2014, Article ID 970456, 9 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. K. K. Bhattacharjee and S. P. Sarmah, “Shuffled frog leaping algorithm and its application to 0/1 knapsack problem,” Applied Soft Computing Journal, vol. 19, pp. 252–263, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. R. S. Parpinelli and H. S. Lopes, “New inspirations in swarm intelligence: a survey,” International Journal of Bio-Inspired Computation, vol. 3, no. 1, pp. 1–16, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. M. M. Eusuff and K. E. Lansey, “Optimization of water distribution network design using the shuffled frog leaping algorithm,” Journal of Water Resources Planning and Management, vol. 129, no. 3, pp. 210–225, 2003. View at Publisher · View at Google Scholar · View at Scopus
  30. X. Li, J. Luo, M.-R. Chen, and N. Wang, “An improved shuffled frog-leaping algorithm with extremal optimisation for continuous optimisation,” Information Sciences, vol. 192, pp. 143–151, 2012. View at Publisher · View at Google Scholar · View at Scopus
  31. C. Fang and L. Wang, “An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem,” Computers and Operations Research, vol. 39, no. 5, pp. 890–901, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. X.-S. Yang and S. Deb, “Cuckoo search via Lévy flights,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC '09), pp. 210–214, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  33. A. H. Gandomi, X.-S. Yang, and A. H. Alavi, “Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems,” Engineering with Computers, vol. 29, no. 1, pp. 17–35, 2013. View at Publisher · View at Google Scholar · View at Scopus
  34. S. Walton, O. Hassan, K. Morgan, and M. R. Brown, “Modified cuckoo search: a new gradient free optimisation algorithm,” Chaos, Solitons and Fractals, vol. 44, no. 9, pp. 710–718, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. K. Chandrasekaran and S. P. Simon, “Multi-objective scheduling problem: hybrid approach using fuzzy assisted cuckoo search algorithm,” Swarm and Evolutionary Computation, vol. 5, pp. 1–16, 2012. View at Publisher · View at Google Scholar · View at Scopus
  36. G. G. Wang, L. H. Guo, H. Duan, H. Wang, L. Liu, and M. Shao, “A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning,” The Scientific World Journal, vol. 2012, Article ID 583973, 11 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  37. A. K. Bhandari, V. K. Singh, A. Kumar, and G. K. Singh, “Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur's entropy,” Expert Systems with Applications, vol. 41, no. 7, pp. 3538–3560, 2014. View at Publisher · View at Google Scholar · View at Scopus
  38. M. Khajeh and E. Jahanbin, “Application of cuckoo optimization algorithm-artificial neural network method of zinc oxide nanoparticles-chitosan for extraction of uranium from water samples,” Chemometrics and Intelligent Laboratory Systems, vol. 135, pp. 70–75, 2014. View at Publisher · View at Google Scholar · View at Scopus
  39. G. Kanagaraj, S. G. Ponnambalam, and N. Jawahar, “A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems,” Computers & Industrial Engineering, vol. 66, no. 4, pp. 1115–1124, 2013. View at Publisher · View at Google Scholar · View at Scopus
  40. X. S. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and Applications, vol. 24, no. 1, pp. 169–174, 2014. View at Publisher · View at Google Scholar · View at Scopus
  41. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, Germany, 1996.
  42. S. Das and P. N. Suganthan, “Differential evolution: a survey of the state-of-the-art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, 2011. View at Publisher · View at Google Scholar · View at Scopus
  43. R. Mallipeddi, P. N. Suganthan, Q. K. Pan, and M. F. Tasgetiren, “Differential evolution algorithm with ensemble of parameters and mutation strategies,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 1679–1696, 2011. View at Publisher · View at Google Scholar · View at Scopus
  44. G. B. Dantzig, “Discrete-variable extremum problems,” Operations Research, vol. 5, pp. 266–277, 1957. View at Publisher · View at Google Scholar · View at MathSciNet
  45. X. S. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, Frome, UK, 2010.
  46. M. Eusuff, K. Lansey, and F. Pasha, “Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization,” Engineering Optimization, vol. 38, no. 2, pp. 129–154, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. E. Elbeltagi, T. Hegazy, and D. Grierson, “Comparison among five evolutionary-based optimization algorithms,” Advanced Engineering Informatics, vol. 19, no. 1, pp. 43–53, 2005. View at Publisher · View at Google Scholar · View at Scopus
  48. Y. C. He, K. Q. Liu, and C. J. Zhang, “Greedy genetic algorithm for solving knapsack problems and its applications,” Computer Engineering and Design, vol. 28, no. 11, pp. 2655–2657, 2007. View at Google Scholar
  49. S. Martello and P. Toth, Knapsack Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York, NY, USA, 1990. View at MathSciNet
  50. D. Pisinger, Algorithms for knapsack problems, 1995.
  51. D. Pisinger, “Where are the hard knapsack problems?” Computers & Operations Research, vol. 32, no. 9, pp. 2271–2284, 2005. View at Publisher · View at Google Scholar · View at Scopus
  52. D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67–82, 1997. View at Publisher · View at Google Scholar · View at Scopus