Heuristics for cardinality constrained portfolio optimisation

In this paper we consider the problem of finding the efficient frontier associated with the standard mean-variance portfolio optimisation model. We extend the standard model to include cardinality constraints that limit a portfolio to have a specified number of assets, and to impose limits on the proportion of the portfolio held in a given asset (if any of the asset is held). We illustrate the differences that arise in the shape of this efficient frontier when such constraints are present. We present three heuristic algorithms based upon genetic algorithms, tabu search and simulated annealing for finding the cardinality constrained efficient frontier. Computational results are presented for five data sets involving up to 225 assets.

[1]  Gerhard O. Mensch,et al.  TIMS Studies in the management sciences : Burton V. Dean and Joel L. Goldhar (eds.), Management of Research and Innovation, North-Holland Publishing Company, Amsterdam, Vol. 15, 1980, 300 pp. , 1983 .

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[4]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[5]  Pierre Hansen,et al.  Constrained Nonlinear 0-1 Programming , 1989 .

[6]  John E. Beasley.  Obtaining test problems via Internet , 1996, J. Glob. Optim..

[7]  Marco Tomassini,et al.  Distributed Genetic Algorithms with an Application to Portfolio Selection Problems , 1995, ICANNGA.

[8]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Andrea G. B. Tettamanzi,et al.  A genetic approach to portfolio selection , 1993 .

[11]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[12]  R. F.,et al.  Mathematical Statistics , 1944, Nature.

[13]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  John M. Mulvey,et al.  Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling , 1996 .

[16]  Byung Ha Lim,et al.  A Minimax Portfolio Selection Rule with Linear Programming Solution , 1998 .

[17]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[18]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

[19]  E. Elton.  Modern portfolio theory and investment analysis , 1981 .

[20]  Eva K. Lee,et al.  COMPUTATIONAL EXPERIENCE OF AN INTERIOR-POINT SQP ALGORITHM IN A PARALLEL BRANCH-AND-BOUND FRAMEWORK , 2000 .

[21]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[22]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[23]  J. Mulvey,et al.  Stochastic network programming for financial planning problems , 1992 .

[24]  B. R. Feiring,et al.  Portfolio selection in downside risk optimization approach: application to the Hong Kong stock market , 1994 .

[25]  H. Konno,et al.  Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market , 1991 .

[26]  John E. Mitchell,et al.  A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs , 1997, Comput. Oper. Res..

[27]  Maria Grazia Speranza,et al.  A heuristic algorithm for a portfolio optimization model applied to the Milan stock market , 1996, Comput. Oper. Res..

[28]  Nigel Meade,et al.  A simple algorithm to incorporate transactions costs in quadratic optimisation , 1994 .

[29]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[30]  Hiroshi Konno,et al.  A mean-absolute deviation-skewness portfolio optimization model , 1993, Ann. Oper. Res..

[31]  A. Shiryaev,et al.  Probability (2nd ed.) , 1995, Technometrics.

[32]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

[33]  Maria Grazia Speranza,et al.  Heuristic algorithms for the portfolio selection problem with minimum transaction lots , 1999, Eur. J. Oper. Res..

[34]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[35]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[36]  Hiroshi Konno,et al.  PIECEWISE LINEAR RISK FUNCTION AND PORTFOLIO OPTIMIZATION , 1990 .

[37]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[38]  Edwin J. Elton,et al.  Portfolio Theory, 25 Years After. , 1981 .

[39]  Daniel Bienstock,et al.  Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.

[40]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[41]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[42]  A. Yoshimoto.  THE MEAN-VARIANCE APPROACH TO PORTFOLIO OPTIMIZATION SUBJECT TO TRANSACTION COSTS , 1996 .

[43]  Stavros A. Zenios,et al.  Some financial optimization models: I Risk management , 1993 .

[44]  Terence C. Mills.  Stylized facts on the temporal and distributional properties of daily FT-SE returns , 1997 .

[45]  C. Floudas.  Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .

[46]  Pierre Hansen,et al.  State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming , 1993, INFORMS J. Comput..

[47]  Yusif Simaan.  Estimation risk in portfolio selection: the mean variance model versus the mean absolute deviation model , 1997 .