Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations
Particle swarm optimization is a heuristic and stochastic technique inspired by the flock of birds when looking for food. It is currently being used to solve continuous and discrete optimization problems. This paper proposes a hybrid, genetic inspired algorithm that uses random mutation/crossover operations and adds penalty functions to solve a particular case: the multidimensional knapsack problem. The algorithm implementation uses particle swarm for binary variables with a genetic operator. The particles update is performed in the following way: first using the iterative process (standard algorithm) described in the PSO algorithm and then using the best particle position (local) and the best global position to perform a random crossover/mutation with the original particle. The mutation and crossover operations specifically apply to personal and global best individuals. The obtained results are promising compared to those obtained by using the probability binary particle swarm optimization algorithm.
KeywordsBinary particle swarm optimization Combinatory optimization Multidimensional knapsack problem Genetic operations
The research was partially supported by Spanish Research Agency Projects TRA2013-48314-C3-2-R and SEGVAUTO TRIES (S2013/MIT-27139).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization. In: 2007 IEEE Swarm Intelligence Symposium, SIS 2007, Honolulu, Hawaii, USA, 1–5 April 2007, pp 120–127Google Scholar
- Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS ’95. pp 39–43. doi: 10.1109/MHS.1995.494215
- Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, IEEE computer society, Washington, DC, USA, vol 5. pp 4104–4108Google Scholar
- Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. pp 1942–1948Google Scholar
- Korenaga T, Hatanaka T, Uosaki K (2007) Performance improvement of particle swarm optimization for high-dimensional function optimization. In: 2007 IEEE congress on evolutionary computation. pp 3288–3293Google Scholar
- Labed S, Gherboudj A, Chikhi S (2011) Article: a modified hybrid particle swarm optimization algorithm for multidimensional knapsack problem. Int J Comput Appl 34(2):11–16 (full text available)Google Scholar
- Li D, Sun X (eds) (2006) Surrogate duality theory. Springer, BostonGoogle Scholar
- Parsopoulos K, Vrahatis M (2002) Particle swarm optimization method for constrained optimization problems. In: Proceedings of the Euro-international symposium on computational intelligence 2002. IOS Press, pp 214–220Google Scholar
- Potter M, Jong KD (1994) A cooperative coevolutionary approach to function optimization. In: Proceedings of the international conference on evolutionary computation. The third conference on parallel problem solving from nature: parallel problem solving from nature. Springer, London, UK, PPSN III, pp 249–257Google Scholar
- Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference on evolutionary computation. IEEE Computer Society, Washington, DC, USA, pp 69–73Google Scholar
- Shih W (1979) A branch and bound method for the multiconstraint zero-one knapsack problem. J Oper Res Soc 30(4):369–378. doi: 10.1057/jors.1979.78
- Wan NF, Nolle L (2009) Solving a multi-dimensional knapsack problem using a hybrid particle swarm optimization algorithm. In: ECMS. pp 93–98Google Scholar
- Zhang L, Malik S (2002) The quest for efficient Boolean satisfiability solvers. In: Proceedings of the 14th international conference on computer aided verification. Springer, London, UK, CAV ’02, pp 17–36Google Scholar