An adaptive mutation-dissipation binary particle swarm optimisation for multidimensional knapsack problem Online publication date: Wed, 09-Dec-2009
by Ling Wang, Xiu-ting Wang, Min-rui Fei
International Journal of Modelling, Identification and Control (IJMIC), Vol. 8, No. 4, 2009
Abstract: Particle swarm optimisation (PSO) algorithm is a novel swarm intelligence optimisation algorithm and has been widely researched and applied in many fields. However, the traditional PSO and most of its variants are designed for optimisation problems in continuous space which cannot be used to solve discrete binary optimisation problems. To make up for it, the discrete binary particle swarm algorithm has been proposed for binary-code optimisation problems, but its optimisation ability is not ideal. In this paper, we propose a novel adaptive mutation-dissipation binary particle swarm optimisation (MDBPSO) for tackling multidimensional knapsack problem (MKP). In MDBPSO, the adaptive mutation operator and dissipation operator are introduced to enhance the local search ability and keep the diversity of swarm. The experimental results on benchmark MKP demonstrate that the proposed MDBPSO has better optimisation ability and is easy to implement.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook