A new particle swarm optimisation based on MATLAB for portfolio selection problem Online publication date: Thu, 01-Apr-2010
by Jianwei Gao, Zhonghua Chu
International Journal of Modelling, Identification and Control (IJMIC), Vol. 9, No. 1/2, 2010
Abstract: This paper focuses on the constrained portfolio selection problem and develops an improved particle swarm optimisation (IPSO) algorithm to solve it. As an alternative and extension to the standard Markowitz model, a constrained portfolio selection model with transaction costs and quantity limit is formulated for selecting portfolios. Due to these complex constraints, the process becomes a high-dimensional constrained optimisation problem. Traditional optimisation algorithms fail to work efficiently and heuristic algorithms with effective searching ability can be the best choice for the problem, so we design an IPSO to solve our problem. In order to prevent premature convergence to local minima, we design a new definition for global point. Finally, a numerical example of a portfolio selection problem is given to illustrate our proposed method; the simulation results demonstrate good performance of the IPSO in solving the complex constrained portfolio selection problem.
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