Particle swarm optimisation for multi-project location problems with interval profits Online publication date: Wed, 09-Dec-2009
by Dun-wei Gong, Yong Zhang
International Journal of Modelling, Identification and Control (IJMIC), Vol. 8, No. 4, 2009
Abstract: Multi-project location problems, a kind of combinational optimisation problem, widely exist in real-world applications. However, the existing methods can only deal with the case of exact objective profits. Aiming at solving the case of interval objective profits, we present a novel method based on an improved particle swarm optimisation in this paper. We firstly convert a multi-project location problem with interval objective profits into one with exact parameters by designing an appropriate penalty function. Based on the equivalent probability matrix, we then develop an improved particle swarm optimisation with reverse mutation, suitable for discrete variables, to optimise the converted problem, where the role of the reverse mutations is to escape these particles from local optima of the problem. We finally validate the feasibility and efficiency of the proposed method by optimising a location problem with 15-project and 13-site.
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