A socio-cognitive particle swarm optimization for multi-dimensional knapsack problem

Proceedings - 1st International Conference on Emerging Trends in Engineering and Technology, ICETET 2008

Volumn , Issue , 2008, Pages 355-360

  Deep, Kusum ^a   Bansal, Jagdish Chand ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

Author keywords

Multidimensional knapsack problem; Particle swarm optimization; Velocity update equation

Indexed keywords

ENGINEERING RESEARCH; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; INDUSTRIAL ENGINEERING; INTEGER PROGRAMMING; MANAGEMENT SCIENCE; NUCLEAR PROPULSION; OPTIMIZATION; TECHNOLOGY;

BINARY PARTICLE SWARM OPTIMIZATION; COMPUTATIONAL EXPERIMENTS; EMERGING TRENDS; ENGINEERING APPLICATIONS; FINE TUNING; IMPROVED ALGORITHM; INTERNATIONAL CONFERENCES; KNAPSACK PROBLEMS; MULTIDIMENSIONAL KNAPSACK PROBLEM; NP-HARD PROBLEMS; PARTICLE SWARM OPTIMIZATION; PARTICLE SWARM OPTIMIZATION ALGORITHMS; PARTICLE SWARM OPTIMIZATIONS; VELOCITY UPDATE EQUATION;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 51949099802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICETET.2008.163     Document Type: Conference Paper

References (37)

1. P.C. Gilmore and R.E. Gomory, "The Theory and Computation of Knapsack fucntions", Operations Research 14, (1966) 1045-1075.
2. H.M. Weingartner and D.N. Ness, "Methods for the solution of the Multidimensional 0/1 Knapsack Problem", Operations Research 15, (1967).83-103.
3. Stefan Balev, Nicola Yanev, Arnaud Fréville, Rumen Andonov, "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem" European Journal of Operational Research (2007), doi:10.1016/j.ejor.2006.02.058.
4. W.Shih, "A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem", Journal of Operations Research Society,30,(1979) 369-378.
5. B. Gavish and H. Pirkul, "Efficient Algorithms for Solving Multiconstraint Zero-One knapsack Problems to Optimality", Mathematical Programming, 31, (1985) 78-105.
6. A. Fréville, G. Plateau, "The 0-1 bidimensional knapsack problem: Towards an efficient high-level primitive tool, Journal of Heuristics" 2 (1996) 147-167.
7. A.V. Cabot, "An Enumeratuion Algorithm for Knapsack Problems", Operations Research 18, (1970) 306-311.
8. K.E. Schilling, "The Growth of m-Constraint Random Knapsacks", Eurppean Journal of Operational Research 46, (1990) 109-112.
9. J.F. Fontanari, "A Statistical Analysis of the Knapsack Problem", Journal of Physics A- mathematical and General 28, (1995) 4751-4759.
10. A.L. Soyster, B. Lev, W. Slivka, "Zero-one programming with many variables and few constraints", European Journal of Operational Research 2 (1978) 195-201.
11. F. Dammeyer and S. Voss, "Dynamic Tabu List management Using Reverse Elimination Method, Annals", Annals of Operations Research 41, (1993) 31-46.
12. R. Aboudi and K. Jornsten, "Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic", ORSA Journal on Computing 6, (1994) 82-93.
13. R. Battiti and G. Tecchiolli, "Local Search with Memory: Benchmarking RTS", OR Spektrum 17, (1995) 67-86.
14. F.Glover and G.A. Kochenberger, "Critical Event Tabu Search for Multidimensional knapsack Problem", In I. H. Osman and J.P> Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers. (1996) 407-427.
15. Michel Vasquez and Jin-Kao Hao, "A Hybrid Approach for the 0-1 multidimensional Knapsack problem", In: Proc. Of IJCAI-01, Seatle, Washington, August 2001.
16. Vincent C. Li, "Solving Multidimensional Knapsack Problems with Generalized Upper Bound Constraints by a Perturbation-Guided Tabu Search Method", International Conference on Computers and Industrial Engineering, Taipei, Taiwan, June 2006.
17. Vincent C. Li and You-Shan Chen, "Applying Tabu Search and Scatter Search to Multidimensional Knapsack Problems with Generalized Upper Bound Constraints", The Seventh Metaheuristics International Conference (MIC), Montreal, June 25-29, 2007.
18. S. Khuri, T. Back and J. Heitkotter, "The Zero/One multiple Knapsack Problem and Genetic Algorithm", Proceedings of the 1994 ACM Symposium on Applied Computing (SAC'94), ACM Press (1994) 188-193.
19. G. Rudolph and J. Sprave, "A Cellular Genetic Algorithm with Self- adjusting Acceptance Thereshold", Proceeding of the First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications. IEE, London, (1995) 365-372.
20. C.Cotta, J. Ma Troya, "A Hybrid genetic Algorithm for the 0-1 multiple knapsack problem", In: Proceedings of the International Conference on Artificial Networks and Genetic Algorithm. Springer-Verlag, Berlin (1997) 250-254.
21. P.C. Chu and J.E. Beasley, "A Genetic Algorithm for the Multidimensional Knapsack Problem", Journal of Herustics, 4, (1998) 63-86.
22. Kosuke Kato and Masatoshi Sakawa, "Genetic Algorithms With Decomposition Procedures for Multidimensional 0-1 Knapsack Problems With Block Angular Structures", IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics, Vol. 33, No. 3, June 2003:410-419.
23. Hong Li, Yong-Chang Jiao, Li Zhang and Ze- Wei Gu, "Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems", ICNC 2006, Part I, LNCS 4221, pp. 696-705, 2006.
24. Kong M, "A new ant colony optimization algorithm for the multidimensional Knapsack problem", Computers and Operations Research (2007), doi: 10.1016/j.cor.2006.12.029
25. M. Vasquez and J.K Hao, "A Hybrid Approach for the 0-1 Multidimensional Knapsack Problem. IJCAI-01, Washington, 2001.
26. Junzhong Ji, Zhen Huang, Chunnian Liu, "An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems", IEEE/WIC/ACM International Conference on Intelligent Agent Technology 2007.
27. Sima Uyar, Gülsen Eryigit, "Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach", GECCO 2005: 1257-1264.
28. A. Drexl, "A simulated annealing approach to the multiconstraint zero-one knapsack problem", Computing, v.40 n.1, p.1-8, January 1988 [doi:10.1007/BF02242185]
29. Maoguo Gong, Licheng Jiao, Wenping Ma, Shuiping Gou, "Solving multidimensional knapsack problems by an immune-inspired algorithm", Evolutionary Computation, 2007. CEC 2007. IEEE Congress on , 3385-3391.
30. Min Kong and Peng Tian, "Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem", Springer Berlin / Heidelberg, ICAISC 2006, Volume 4029/2006 pp. 1140-1149 [doi:10.1007/11785231]
31. Fernanda Hembecker , Heitor S. Lopes and Walter Godoy Jr, "Particle Swarm Optimization for the Multidimensional Knapsack Problem", Springer Berlin / Heidelberg, Adaptive and Natural Computing Algorithms 2007, Volume 4431/2007, pp. 358-365 [doi: 10.1007/978-3-540-71618-1_40]
32. J. Kennedy, R. Eberhart, Particle swarm optimization, Proceedings IEEE International Conference Neural Networks, Vol. 4, 1942-1948 (1995).
33. th International Symposium Micro Machine Human Science, 39-45 (1995).
34. A. Banks, J. Vincent, C. Anyakoha, A review of particle swarm optimization. Part I: background and development, Natural Computing: an international journal Volume 6, Issue 4, 467 - 484 (December 2007).
35. A. Banks, J. Vincent, C. Anyakoha, A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications, Natural Computing DOI 10.1007/s11047-007-9050-z, online, July 2007.
36. J. Kennedy, and R. C. Eberhart, A discrete binary version of the particle swarm optimization. Proceedings of the world Multiconference on Systemics, Cybernetics, Informatics, pages 4104-4109, (1997).
37. Clerc M: "Particle Swarm Optimization", ISTE Ltd. USA, 2007.