About this Journal Submit a Manuscript Table of Contents
Discrete Dynamics in Nature and Society
Volume 2014 (2014), Article ID 573731, 12 pages
http://dx.doi.org/10.1155/2014/573731
Research Article

A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems

School of Traffic & Transportation, Lanzhou Jiaotong University, Lanzhou, Gansu 730070, China

Received 26 January 2014; Revised 19 March 2014; Accepted 25 March 2014; Published 24 April 2014

Academic Editor: Zbigniew Leśniak

Copyright © 2014 Wan-li Xiang 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. V. Chvata, “Hard knapsack problems,” Operations Research, vol. 28, no. 6, pp. 1402–1411, 1980. View at Publisher · View at Google Scholar
  2. C. S. Chung, M. S. Hung, and W. Rom, “A hard knapsack problem,” Naval Research Logistics, vol. 35, pp. 85–98, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. G. È. Cornuèjols and M. Dawande, “A class of hard small 0-1 programs,” INFORMS Journal on Computing, vol. 11, no. 2, pp. 205–210, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. A. V. Carbot, “An enumeration algorithm for knapsack problems,” Operations Research, vol. 18, no. 2, pp. 306–311, 1970. View at Publisher · View at Google Scholar
  5. P. C. Gilmore and R. E. Gomory, “The theory and computation of knapsack functions,” Operations Research, vol. 14, no. 6, pp. 1045–1074, 1966. View at Publisher · View at Google Scholar
  6. S. Martello, D. Pisinger, and P. Toth, “Dynamic programming and strong bounds for the 0-1 knapsack problem,” Management Science, vol. 45, no. 3, pp. 414–424, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. J. K. Peter, “A branch and bound algorithm for the knapsack problem,” Management Science, vol. 13, no. 6, pp. 723–735, 1967.
  8. D. Pisinger, “Where are the hard knapsack problems?” Computers and Operations Research, vol. 32, no. 9, pp. 2271–2284, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. S. Dash, “Exponential lower bounds on the lengths of some classes of branch-and-cut proofs,” Mathematics of Operations Research, vol. 30, no. 3, pp. 678–700, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. G. J. Koehler, “Minimal equivalent binary knapsack inequalities,” INFORMS Journal on Computing, vol. 23, no. 3, pp. 425–429, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. Y. C. He, K. Q. Liu, C. J. Zhang, and W. Zhang, “Greedy genetic algorithm for solving kanpsack problems and its applications,” Computer Engineering and Design, vol. 28, no. 11, pp. 2655–2658, 2007.
  12. J. C. Bansal and K. Deep, “A modified binary particle swarm optimization for knapsack problems,” Applied Mathematics and Computation, vol. 218, no. 22, pp. 11042–11061, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. T. K. Truong, K. Li, and Y. Xu, “Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem,” Applied Soft Computing, vol. 13, no. 4, pp. 1774–1780, 2013. View at Publisher · View at Google Scholar
  14. A. Layeb, “A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems,” Journal of Computational and Applied Mathematics, vol. 253, pp. 14–25, 2013. View at Publisher · View at Google Scholar
  15. L. Wang, R. Yang, Y. Xu, et al., “An improved adaptive binary harmony search algorithm,” Information Sciences, vol. 232, pp. 58–87, 2013. View at Publisher · View at Google Scholar
  16. J. Roland, J. R. Figueira, and Y. D. Smet, “The inverse 0,1-knapsack problem: theory, algorithms and computational experiments,” Discrete Optimization, vol. 10, no. 2, pp. 181–192, 2013. View at Publisher · View at Google Scholar
  17. A. Fréville, “The multidimensional 0-1 knapsack problem: an overview,” European Journal of Operational Research, vol. 155, no. 1, pp. 1–21, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. A. Billionnet and É. Soutif, “An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem,” European Journal of Operational Research, vol. 157, no. 3, pp. 565–575, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. A. Billionnet and É. Soutif, “Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem,” INFORMS Journal on Computing, vol. 16, no. 2, pp. 188–197, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. L. Jourdan, M. Basseur, and E. G. Talbi, “Hybridizing exact methods and metaheuristics: a taxonomy,” European Journal of Operational Research, vol. 199, no. 3, pp. 620–629, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. V. Boyer, M. Elkihel, and D. El Baz, “Heuristics for the 0-1 multidimensional knapsack problem,” European Journal of Operational Research, vol. 199, no. 3, pp. 658–664, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. S. Siva Sathya and S. Kuppuswami, “Gene silencing—a genetic operator for constrained optimization,” Applied Soft Computing Journal, vol. 11, no. 8, pp. 5801–5808, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. M. Vasquez and Y. Vimont, “Improved results on the 0-1 multidimensional knapsack problem,” European Journal of Operational Research, vol. 165, no. 1, pp. 70–81, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. 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
  25. V. C. B. Camargo, L. Mattiolli, and F. M. B. Toledo, “A knapsack problem as a tool to solve the production planning problem in small foundries,” Computers and Operations Research, vol. 39, no. 1, pp. 86–92, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. 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
  27. S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, and B. K. Panigrahi, “Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization,” IEEE Transactions on Systems, Man, and Cybernetics B: Cybernetics, vol. 41, no. 1, pp. 89–106, 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. P. Yadav, R. Kumar, S. K. Panda, and C. S. Chang, “An intelligent tuned harmony search algorithm for optimisation,” Information Sciences, vol. 196, pp. 47–72, 2012. View at Publisher · View at Google Scholar · View at Scopus
  29. B. Wu, C. Qian, W. Ni, et al., “Hybrid harmony search and artificial bee colony algorithm for global optimization problems,” Computers & Mathematics with Applications, vol. 64, no. 8, pp. 2621–2634, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  30. M. El-Abd, “An improved global-best harmony search algorithm,” Applied Mathematics and Computation, vol. 222, pp. 94–106, 2013. View at Publisher · View at Google Scholar
  31. D. Zou, L. Gao, S. Li, J. Wu, and X. Wang, “A novel global harmony search algorithm for task assignment problem,” Journal of Systems and Software, vol. 83, no. 10, pp. 1678–1688, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. D. Zou, L. Gao, J. Wu, and S. Li, “Novel global harmony search algorithm for unconstrained problems,” Neurocomputing, vol. 73, no. 16-18, pp. 3308–3318, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. D. Zou, L. Gao, J. Wu, S. Li, and Y. Li, “A novel global harmony search algorithm for reliability problems,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 307–316, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. L. Wang, Q. K. Pan, and M. F. Tasgetiren, “A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem,” Computers and Industrial Engineering, vol. 61, no. 1, pp. 76–83, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. M. G. H. Omran and M. Mahdavi, “Global-best harmony search,” Applied Mathematics and Computation, vol. 198, no. 2, pp. 643–656, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  36. M. Mahdavi, M. Fesanghary, and E. Damangir, “An improved harmony search algorithm for solving optimization problems,” Applied Mathematics and Computation, vol. 188, no. 2, pp. 1567–1579, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  37. B. Alatas, “Chaotic harmony search algorithms,” Applied Mathematics and Computation, vol. 216, no. 9, pp. 2687–2699, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus