A hybrid algorithm for constrained portfolio selection problems

  • Authors:

  • Khin Lwin;Rong Qu

  • Affiliations:

  • Automated Scheduling, Optimization and Planning Group, School of Computer Science, University of Nottingham, Nottingham, UK NG8 1BB;Automated Scheduling, Optimization and Planning Group, School of Computer Science, University of Nottingham, Nottingham, UK NG8 1BB

  • Venue:
  • Applied Intelligence
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since Markowitz's seminal work on the mean-variance model in modern portfolio theory, many studies have been conducted on computational techniques and recently meta-heuristics for portfolio selection problems. In this work, we propose and investigate a new hybrid algorithm integrating the population based incremental learning and differential evolution algorithms for the portfolio selection problem. We consider the extended mean-variance model with practical trading constraints including the cardinality, floor and ceiling constraints. The proposed hybrid algorithm adopts a partially guided mutation and an elitist strategy to promote the quality of solution. The performance of the proposed hybrid algorithm has been evaluated on the extended benchmark datasets in the OR Library. The computational results demonstrate that the proposed hybrid algorithm is not only effective but also efficient in solving the mean-variance model with real world constraints.