Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

International Journal of Bio-Inspired Computation

Volumn 4, Issue 4, 2012, Pages 229-236

  Gherboudj, Amira ^a   Layeb, Abdesslem ^a   Chikhi, Salim ^a  

^a Universite Mentouri Constantine   (Algeria)

Author keywords

BCS; Binary cuckoo search; Combinatorial optimisation; CS; Cuckoo search; Evolutionary computation; Knapsack problem; KP; MKP; Multidimensional knapsack problem

Indexed keywords

CESIUM; EVOLUTIONARY ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO);

BINARY CUCKOO SEARCHES; BINARY PARTICLE SWARM OPTIMISATION; CONTINUOUS OPTIMISATION; CUCKOO SEARCH ALGORITHMS; CUCKOO SEARCHES; KNAPSACK PROBLEMS; MULTIDIMENSIONAL KNAPSACK PROBLEMS; OPTIMISATION PROBLEMS;

COMBINATORIAL OPTIMIZATION;

EID: 84864231184     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2012.048063     Document Type: Article

References (29)

1. Angelelli, E., Mansini, R. and Speranza, M.G. (2010) 'Kernel search: a general heuristic for the multi-dimensional knapsack problem', Computers & Operations Research, Vol. 37, No. 13, pp. 2017-2026, Elsevier.
2. Chu, P.C. and Beasley, J.E. (1998) 'A genetic algorithm for the multidimensional knapsack problem', Journal of Heuristics, Vol. 4, No. 1, pp. 63-86. (Pubitemid 128512788)
3. Dhivya, M. (2011) 'Energy efficient computation of data fusion in wireless sensor networks using cuckoo based particle approach (CBPA)', Int. J. of Communications, Network and System Sciences, Vol. 4, No. 4, pp. 249-255.
4. Dorigo, M. and Gambardella, L.M. (1997) 'Ant colony system: a cooperative learning approach to the traveling salesman problem', IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53-66. (Pubitemid 127771018)
5. Eberhart, R.C., Shi, Y. and Kennedy, J. (2001) Swarm Intelligence. The Morgan Kaufmann Series in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, USA.
6. Fogel, D.B. (2001) 'An introduction to evolutionary computation, tutorial', Congress on Evolutionary Computation (CEC'2001), Seoul, Korea.
7. Gherboudj, A. and Chikhi, S. (2011) 'BPSO algorithms for knapsack problem', in Özcan, A., Zizka, J. and Nagamalai, D. (Eds.): WiMo/CoNeCo 2011, CCIS, Vol. 162, pp. 217-227, Springer.
8. Gupta, S. and Garg, M.L. (2009) 'An improved genetic algorithm based on adaptive repair operator for solving the knapsack problem', Journal of Computer Science, Vol. 5, No. 8, pp. 544-547.
9. Hu, X., Zhang, J. and Li, Y. (2008) 'Orthogonal methods based ant colony search for solving continuous optimization problems', Journal of Computer Science and Technology, Vol. 23, No. 1, pp. 2-18. (Pubitemid 351192919)
10. Jourdan, L., Basseur, M. and Talbi, E.G. (2009) 'Hybridizing exact methods and metaheuristics: a taxonomy', European Journal of Operational Research, Vol. 199, No. 3, pp. 620-629.
11. Julstrom, B-A. (2005) 'Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem', in Proc. GECCO '05 Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, Publisher, ACM, pp. 607-614, ISBN: 1595930108.
12. Kennedy, J. and Eberhart, R.C. (1997) 'A discrete binary version of the particle swarm algorithm', in Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, Piscatawary, NJ, pp. 4104-4109.
13. Kong, M. and Tian, P. (2006) 'Apply the particle swarm optimization to the multidimensional knapsack problem', in Rutkowski, L. et al. (Eds.): Proc. ICAISC 2006, LNAI, Vol. 4029, pp. 1140-1149, Springer. (Pubitemid 44089903)
14. Layeb, A. (2011) 'A novel quantum inspired cuckoo search for knapsack problems', Int. J. Bio-Inspired Computation, Vol. 3, No. 5, pp. 297-305.
15. Liao, C-J., Tseng, C-T. and Luarn, P. (2007) 'A discrete version of particle swarm optimization for flowshop scheduling problems', Computers & Operations Research, Vol. 34, No. 10, pp. 3099-3111, Elsevier. (Pubitemid 46356739)
16. Nabti, S. and Meshoul, S. (2009) 'Predator prey optimisation for snake based contour detection', International Journal of Intelligent Computing and Cybernetics - IJICC, Vol. 2, No. 2, pp. 228-242, Emerald Publishers.
17. Pavlyukevich, I. (2007) 'Lévy flights, non-local search and simulated annealing', J. Computational Physics, Vol. 226, No. 2, pp. 1830-1844.
18. Payne, R.B., Sorenson, M.D. and Klitz, K. (2005) The Cuckoos, Oxford University Press, England.
19. Pisinger, D. (2005) 'Where are the hard knapsack problems?', Computers and Operations Research, Vol. 32, No. 9, pp. 2271-2284. (Pubitemid 40114315)
20. Pongchairerks, P. (2009) 'Particle swarm optimization algorithm applied to scheduling problems', ScienceAsia, Vol. 35, No. 1, pp. 89-94.
21. Singh, A. and Baghel, A-S. (2007) 'A new grouping genetic algorithm for the quadratic multiple knapsack problem', in Cotta, C. and van Hemert, J. (Eds.): Proc. EvoCOP 2007, LNCS, Vol. 4446, pp. 210-218, Springer.
22. Tein, L.H. and Ramli, R. (2010) 'Recent advancements of nurse scheduling models and a potential path', in Proc. 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA 2010), pp. 395-409.
23. Vasquez, M. and Vimont, Y. (2005) 'Improved results on the 0-1 multidimensional knapsack problem', European Journal of Operational Research, Vol. 165, No. 1, pp. 70-81. (Pubitemid 40135594)
24. Walton, S., Hassan, O., Morgan, K. and Brown, M.R. (2011) 'Modified cuckoo search: a new gradient free optimisation algorithm', Chaos, Solitons and Fractals, Vol. 44, No. 9, pp. 710-718.
25. Yang, X-S. and Deb, S. (2009) 'Cuckoo search via Lévy flights', World Congress on Nature and Biologically Inspired Computing (NaBIC 2009), pp. 210-214.
26. Yang, X-S. and Deb, S. (2010) 'Engineering optimisation by cuckoo search', Int. J. Mathematical Modelling and Numerical Optimisation, Vol. 1, No. 4, pp. 330-343.
27. Zhan, Z-h. and Zhang, J. (2009) 'Discrete particle swarm optimization for multiple destination routing problems', in Giacobini, M. et al. (Eds.): Proc. EvoWorkshops 2009, LNCS, Vol. 5484, pp. 117-122, Springer.
28. Zheng, S. (2010) 'An intensive restraint topology adaptive snake model and its application in tracking dynamic image sequence', Inf. Sci., Vol. 180, No. 16, pp. 2940-2959.
29. Zou, D., Gao, L., Li, S. and Wu, J. (2011) 'Solving 0-1 knapsack problem by a novel global harmony search algorithm', Applied Soft Computing, The Impact of Soft Computing for the Progress of Artificial Intelligence, March, Vol. 11, No. 2, pp. 1556-1564.