An adaptive mutation-dissipation binary particle swarm optimisation for multidimensional knapsack problem

International Journal of Modelling, Identification and Control

Volumn 8, Issue 4, 2009, Pages 259-269

  Wang, Ling ^a   Wang, Xiu Ting ^a   Fei, Min Rui ^a  

^a SHANGHAI UNIVERSITY   (China)

Author keywords

Binary PSO; Dissipation operator; MKP; Multidimensional knapsack problem; Mutation operator

Indexed keywords

COMBINATORIAL OPTIMIZATION; MATHEMATICAL OPERATORS;

ADAPTIVE MUTATION OPERATORS; BINARY PARTICLE SWARM OPTIMISATION; BINARY PSO; CONTINUOUS SPACES; MULTIDIMENSIONAL KNAPSACK PROBLEMS; MUTATION OPERATORS; OPTIMISATION PROBLEMS; PARTICLE SWARM OPTIMISATION;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 77952631206     PISSN: 17466172     EISSN: 17466180     Source Type: Journal    
DOI: 10.1504/IJMIC.2009.030072     Document Type: Article

References (26)

1. Abido, M.A. (2002) 'Optimal power flow using particle swarm optimization', International Journal of Electrical Power and Energy Systems, September, Vol.24, pp.563-571.
2. Bäck, T., Fogel, D. and Michalewicz, Z. (1997) Handbook of Evolutionary Computation, Oxford University Press, Oxford, England.
3. Boryczka, U. (2007) 'Ants and multiple knapsack problem', 6th International Conference on Computer Information Systems and Industrial Management Applications 2007, CISIM '07, pp.149-154.
4. Eberhart, R.C. and Shi, Y. (1998) 'Evolving artificial neural networks', in Proceeding of the International Conference on Neural Networks and Brain, pp.5-13.
5. Freville, A. (2004) 'The multidimensional 0-1 knapsack problem: an overview', European Journal of Operational Research, May, Vol.155, No.1, pp.1-22.
6. Hanafi, S. and Freville, A. (1998) 'An efficient tabu search approach for the 0-1 multidimensional knapsack problem', European Journal of Operational Research, April, Vol.106, Nos. 2-3, pp.659-675.
7. Kannan, S. and Slochanal, S. (2004) 'Application of particle swarm optimization technique and its variants to generation expansion planning problem', Electric Power Systems Research, August, Vol.70, No.3, pp.203-210.
8. Kennedy, J. and Eberhart, R. (1995) 'Particle swarm optimization', in Proceeding of IEEE International Conference on Neural Networks, Vol.4, pp.1942-1948.
9. Kennedy, J. and Eberhart, R.C. (1997) 'A discrete binary version of the particle swarm algorithm', in 1997 IEEE International Conference, Systems, Man and Cybernetics, Computational Cybernetics and Simulation, Vol.5, pp.4104-4108.
10. Kong, M. and Tian, P. (2006) 'Apply the particle swarm optimization to the multidimensional knapsack problem', Artificial Intelligence and Soft Computing-ICAISC 2006, Proceedings, Vol.4029, pp.1140-1149. (Pubitemid 44089903)
11. Kong, M., Tian, P. and Kao, Y.C. (2008) 'A new ant colony optimization algorithm for the multidimensional knapsack problem', Computers & Operations Research, Vol.35, pp.2672-2683.
12. Li, V.C. and Curry, G.L. (2005) 'Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search', Computers & Operations Research, April, Vol.32, No.4, pp.825-848.
13. Magazine, M.J. and Oguz, O. (1984) 'A heuristic algorithm for the multidimensional zero-one knapsack problem', European Journal of Operational Research, Vol.16, pp.19-326.
14. Manne, A.S. and Markowitz, H.M. (1957) 'On the solution of discrete programming problems', Econometrica, January, Vol.25, No.1, pp.84-100.
15. Martello, S., Pisinger, D. and Toth, P. (2000) 'New trends in exact algorithms for the 0-1 knapsack problem', European Journal of Operational Research, June, Vol.123, No.2, pp.325-332.
16. Ohtagaki, H., Iwasaki, A., Nakawa, Y. et al. (2000) 'Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems', Mathematical and Computer Modelling, Vol.31, Nos. 10-12, pp.283-288.
17. Ourique, C.O., Biscaia, E.C. and Pinto, J.C. (2002) 'The use of particle swarm optimization for dynamical analysis in chemical process', Computers and Chemical Engineering, Vol.26, No.12, pp.1783-1793.
18. Pirkul, H. (1987) 'A heuristic solution procedure for the multiconstrained zero-one knapsack problem', Naval Research Logistics, Vol.34, pp.161-172.
19. Pisinger, D. (2005) 'Where are the hard knapsack problems', Computers & Operations Research, September, Vol.32, No.9, pp.2271-2284.
20. Raidl, G.R. (1998) 'An improved genetic algorithm for the multiconstrained 0-1 knapsack problem', Evolutionary Computation Proceedings 1998, IEEE World Congress on Computational Intelligence, the 1998 IEEE International Conference on, pp.207-211.
21. Shen, Q. and Jiang, J.H. (2004) 'Modified particle swarm optimization algorithm for variable selection in MLR and PLS modeling: QSAR studies of antagonism of angiotensin II antagonists', European Journal of Pharmaceutical Sciences, June, Vol.22, Nos. 2-3, pp.145-152.
22. Shi, H.X. (2006) 'Solution to 0/1 knapsack problem based on improved ant colony algorithm', 2006 IEEE International Conference on Information Acquisition, August, pp.1062-1066.
23. Shih, W. (1979) 'A branch and bound method for the multiconstraint knapsack problem', Journal of the Operational Research Society, Vol.30, pp.369-378.
24. Tavares, J., Pereira, F.B. and Costa, E. (2008) 'Multidimensional knapsack problem: a fitness landscape analysis', IEEE Transactions on Systems, Man and Cybernetics, Part B, June, Vol.38, No.3, pp.604-616.
25. Wang, L. and Yu, J.S. (2005) 'Fault feature selection based on modified binary PSO with mutation and its application in chemical process fault diagnosis', Advances in Natural Computation, PT 3, Proceedings, LNCS, Vol.3612, pp.832-840.
26. Ye, J., Liu, X.D. and Han, L. (2003) 'Evolutionary game algorithm for multiple knapsack problem', Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology, October, pp.424-427.