A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem

Engineering Applications of Artificial Intelligence

Volumn 55, Issue , 2016, Pages 1-13

  Haddar, Boukthir ^a   Khemakhem, Mahdi ^b   Hanafi, Saïd ^c   Wilbaut, Christophe ^c  

^a Higher Institute of Industrial Management of Sfax   (Tunisia)

^b PRINCE SATTAM BIN ABDULAZIZ UNIVERSITY   (Saudi Arabia)

^c UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

Combinatorial optimization; Hybrid heuristic; Multidimensional Knapsack Problem; Particle swarm optimization

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO);

BENCH-MARK PROBLEMS; CONSTRAINED PROBLEM; HYBRID HEURISTICS; LOCAL SEARCH METHOD; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PROBLEM-SPECIFIC KNOWLEDGE; QUANTUM PARTICLE SWARM OPTIMIZATION; STATE OF THE ART;

HEURISTIC METHODS;

EID: 84973457907     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2016.05.006     Document Type: Article

References (67)

1. A. Abraham, H. Guo, and H. Liu Swarm intelligence: Foundations, Perspectives and Applications 2006 Springer
2. S. Al-Shihabi, and S. ílafsson A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem Comput. Oper. Res. 37 2 2010 247 255
3. S. Balev, N. Yanev, A. Fréville, and R. Andonov A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem Eur. J. Oper. Res. 186 1 2008 63 76
4. J.E. Beasley OR-library: distributing test problems by electronic mail J. Oper. Res. Soc. 41 11 1990 1069 1072
5. Z. Beheshti, S.M. Shamsuddin, and S.S. Yuhaniz Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems J. Glob. Optim. 57 2 2013 549 573
6. M.E. Berberler, A. Guler, and U.G. NurIyev A genetic algorithm to solve the multidimensional knapsack problem Math. Comput. Appl. 18 3 2013 486 494
7. D. Bertsimas, and R. Demir An approximate dynamic programming approach to multidimensional knapsack problems Manag. Sci. 48 2002 550 565
8. M.R. Bonyadi, and X. Li A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators Oper. Res. 12 2 2012 229 252
9. S. Boussier, M. Vasquez, Y. Vimont, S. Hanafi, and P. Michelon A multi-level search strategy for the 0-1 multidimensional knapsack problem Discrete Appl. Math. 158 2010 97 109
10. W.-N. Chen, J. Zhang, H.S.H. Chung, W.-L. Zhong, W.-G. Wu, and Y.-H. Shi A novel set-based particle swarm optimization method for discrete optimization problems IEEE Trans. Evoluti. Comput.-TEC 14 2 2010 278 300
11. M. Chih Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem Appl. Soft Comput. 26 2015 378 389
12. P. Chu, and J. Beasley A genetic algorithm for the multidimensional knapsack problem J. Heuristics 4 1998 63 86
13. M. Clerc Particle Swarm Optimization 2006 ISTE Publishing Company London, UK
14. F. Dammeyer, and S. Voß Dynamic tabu list management using the reverse elimination method Ann. Oper. Res. 41 2 1993 29 46
15. A.P. Engelbrecht Fundamentals of Computational Swarm Intelligence 2005 Wiley Hoboken, NJ
16. D. Fayard, and G. Plateau An algorithm for the solution of the 0-1 knapsack problem Computing 28 1982 269 287
17. H. Fingler, E.N. Cáceres, H. Mongelli, and S.W. Song A cuda based solution to the multidimensional knapsack problem using the ant colony optimization Procedia Comput. Sci. 29 2014 84 94
18. A. Fréville The multidimensional 0-1 knapsack problem: an overview Eur. J. Oper. Res. 155 1 2004 1 21
19. A. Fréville, and P. Gérard An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem Discrete Appl. Math. 49 1994 189 212
20. B. Gavish, and H. Pirkul Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality Math. Program. 31 1985 78 105
21. Gavish, B., Pirkul, H., 1982. Allocation of databases and processors in a distributed data processing. In: In: J. Akola (ed.), Management of Distributed Data Processing, North-Holland, Amsterdam, pp. 215-231.
22. P.C. Gilmore, and R.E. Gomory The theory and computation of knapsack functions Oper. Res. 14 6 1966 1045 1074
23. Glover, F., Kochenberger, G.A., 1996. Critical Event Tabu Search for Multidimensional Knapsack Problems. In: Meta-Heuristics, Springer, pp. 407-427.
24. Green, C., 1967. Two Algorithms for Solving the Independent Multidimensional Knapsack Problems, Management Sciences Research Report, Management Sciences Research Group, Carnegie Institute of Technology, GraduateSchool of Industrial Administration.
25. S. Hanafi, and A. Fréville An efficient tabu search approach for the 0-1 multidimensional knapsack problem Eur. J. Oper. Res. 106 2-3 1998 659 675
26. S. Hanafi, and F. Glover Exploiting nested inequalities and surrogate constraints Eur. J. Oper. Res 179 1 2007 50 63
27. T. Hey Quantum computing: an introduction Comput. Control Eng. J. 10 3 1999 105 112
28. L. Ke, Z. Feng, Z. Ren, and X. Wei An ant colony optimization approach for the multidimensional knapsack problem J. Heuristics 16 1 2010 65 83
29. Kennedy, J., 1999. Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, Vol. 3, pp. -1938 Vol. 3.
30. Kennedy, J., 2000. Stereotyping: improving particle swarm performance with cluster analysis. In: Proceedings of the 2000 Congress on Evolutionary Computation, Vol. 2, pp. 1507-1512.
31. Kennedy, J., 2003. Bare bones particle swarms. In: Proceedings of the 2003 Swarm Intelligence Symposium, IEEE, pp. 80-87.
32. Kennedy, J., Eberhart, R., 1995. Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, Vol. 4, pp. 1942-1948.
33. Kennedy, J., Eberhart, R., 1997. A discrete binary version of the particle swarm algorithm. In: Proceedings of the 1997 IEEE International Conference on Computational Cybernetics and Simulation, Vol. 5, pp. 4104-4108.
34. Khanesar, M.A., Teshnehlab, M., Shoorehdeli, M.A., 2007. A novel binary particle swarm optimization. In: Control & Automation, 2007. MED'07. Mediterranean Conference on, IEEE, pp. 1-6.
35. M. Khemakhem, B. Haddar, K. Chebil, and S. Hanafi A filter-and-fan metaheuristic for the 0-1 multidimensional knapsack problem Int. J. Appl. Metaheuristic Comput. (IJAMC) 3 4 2012 43 63
36. M. Kong, P. Tian, and Y. Kao A new ant colony optimization algorithm for the multidimensional knapsack problem Comput. Oper. Res. 35 8 2008 2672 2683
37. Kong, M., Tian, P., 2006. Apply the particle swarm optimization to the multidimensional knapsack problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L., zurada, J. (Eds.), Artificial Intelligence and Soft Computing-ICAISC 2006, Vol. 4029 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 1140-1149.
38. Krohling, R.A., dos Santos Coelho, L., 2006. PSO-E: Particle swarm with exponential distribution. In: Evolutionary Computation, 2006. CEC 2006. IEEE Congress on, IEEE, pp. 1428-1433.
39. R. Ktari, and H. Chabchoub Essential particle swarm optimization queen with tabu search for mkp resolution Computing 95 9 2013 897 921
40. J. Langeveld, and A.P. Engelbrecht Set-based particle swarm optimization applied to the multidimensional knapsack problem Swarm Intell. 6 4 2012 297 342
41. S.C. Leung, D. Zhang, C. Zhou, and T. Wu A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem Comput. Oper. Res. 39 1 2012 64 73
42. R. Mansini, and M.G. Speranza Coral: an exact algorithm for the multidimensional knapsack problem INFORMS J. Comput. 24 3 2012 399 415
43. Martins, J.P., Longo, H., Delbem, A.C., 2014. On the effectiveness of genetic algorithms for the multidimensional knapsack problem. In: Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion, ACM, pp. 73-74.
44. Mohais, A., Mendes, R., Ward, C., Posthoff, C., 2005. Neighborhood restructuring in particle swarm optimization. In: Proceedings of the 2005 Advances in Artificial Intelligence, Vol. 3809, Lecture Notes in Computer Science, Springer, pp. 776-785.
45. H. Nezamabadi-pour, M. Rostami Shahrbabaki, and M. Maghfoori-Farsangi Binary particle swarm optimization: challenges and new solutions CSI J. Comput. Sci. Eng. Persian 6 1 2008 21 32
46. Oliva, C., Michelon, P., Artigues, C., 2001. Constraint and linear programming: Using reduced costs for solving the zero/one multiple knapsack problem. In: In: International Conference on Constraint Programming, CP 01, Proceedings of the Workshop on Cooperative Solvers in Constraint Programming, CoSolv 01, pp. 87-98.
47. M.A. Osorio, F. Glover, and P. Hammer Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions Ann. Oper. Res. 117 1-4 2002 71 93
48. Pampara, G., Franken, N., Engelbrecht, A.P., 2005. Combining particle swarm optimisation with angle modulation to solve binary problems. In: Evolutionary Computation, 2005. The 2005 IEEE Congress on, Vol. 1, IEEE, pp. 89-96.
49. Parra-Hernandez, R., Dimopoulos, N., 2003. On the performance of the ant colony system for solving the multidimensional knapsack problem. In: Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on, Vol. 1, pp. 338-341.
50. D. Parrott, and X. Li Locating and tracking multiple dynamic optima by a particle swarm model using speciation IEEE Trans. Evolut. Comput. 10 4 2006 440 458
51. C.C. Petersen Computational experience with variants of the balas algorithm applied to the selection of r&d projects Manag. Sci. 13 9 1967 736 750
52. H. Pirkul A heuristic solution procedure for the multiconstraint zero-one knapsack problem Nav. Res. Logist. 34 1-2 1987 161 172
53. J. Puchinger, G.R. Raidl, and U. Pferschy The multidimensional knapsack problem: structure and algorithms INFORMS J. Comput. 22 2 2010 250 265
54. Rezoug, A., Boughaci, D., Rezoug, A., 2015 Stochastic local search combined with simulated annealing for the 0-1 multidimensional knapsack problem. In: Symposium on Complex Systems and Intelligent Computing (CompSIC).
55. W. Shih A branch and bound method for the multiconstraint zero one knapsack problem J. Oper. Res. Soc. 30 4 1979 369 378
56. Sun, J., Feng, B., Xu, W., 2004. Particle swarm optimization with particles having quantum behavior. In: Proceedings of the 2004 Congress on Evolutionary Computation, Vol. 1, pp. 325-331.
57. Sun, J., Xu, W., Feng, B., 2004. A global search strategy of quantum-behaved particle swarm optimization. In: Proceedings of the 2004 IEEE Conference on Cybernetics and Intelligent Systems, Vol. 1, pp. 111-116.
58. F.D. Tisna A., S. Abusini, and A. Andar Hybrid greedy-particle swarmoptimization-genetic algorithm and its convergence to solve multidimensionalknapsack problem 0-1 J. Theor. Appl. Inform. Technol. 58 3 2013 522 528
59. M.J. Varnamkhasti Overview of the algorithms for solving the multidimensional knapsack problems Adv. Stud. Biol. 4 1 2012 37 47
60. M. Vasquez, and J.-K. Hao Une approche hybride pour le sac à dos multidimensionnel en variables 0-1 Oper. Res. 35 4 2001 415 438
61. M. Vasquez, and Y. Vimont Improved results on the 0-1 multidimensional knapsack problem Eur. J. Oper. Res. 165 1 2005 70 81
62. Y. Vimont, S. Boussier, and M. Vasquez Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem J. Comb. Optim. 15 2 2008 165 178
63. Wan, N.F., Nolle, L., 2009. Solving a multi-dimensional knapsack problem using a hybrid particle swarm optimization algorithm. In: Proceedings of the 23rd European Conference on Modelling and Mimulation, ECMS 2009.
64. H.M. Weingartner Capital budgeting of interrelated projects: survey and synthesis Manag. Sci. 12 7 1966 485 516
65. H.M. Weingartner, and D.N. Ness Methods for the solution of the multi-dimensional 0/1 knapsack problem Oper. Res. 15 1967 83 103
66. C. Wilbaut, S. Hanafi, A. Fréville, and S. Balev Tabu search: global intensification using dynamic programming Control Cybern. 35 3 2006 579 598
67. Yang, S., Wang, M., Jiao, L., 2004. A quantum particle swarm optimization. In: Proceedings of the 2004 Congress IEEE Conference on Evolutionary Computation, Vol. 1, pp. 320-324.