Simulated annealing for complex portfolio selection problems

Abstract This paper describes the application of a simulated annealing approach to the solution of a complex portfolio selection model. The model is a mixed integer quadratic programming problem which arises when Markowitz’ classical mean–variance model is enriched with additional realistic constraints. Exact optimization algorithms run into difficulties in this framework and this motivates the investigation of heuristic techniques. Computational experiments indicate that the approach is promising for this class of problems.

[1]  Koichi Furukawa,et al.  On the number of securities which constitute an efficient portfolio , 1993, Ann. Oper. Res..

[2]  Robert L. Smith,et al.  Improving Hit-and-Run for global optimization , 1993, J. Glob. Optim..

[3]  L. Ingber,et al.  Application of statistical mechanics methodology to term-structure bond-pricing models , 1991 .

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

[5]  J. Cockcroft.  Investment in Science , 1962, Nature.

[6]  A. G. Malliaris,et al.  Chapter 1 Portfolio theory , 1995, Finance.

[7]  John M. Mulvey,et al.  OR Practice - Large-Scale Nonlinear Network Models and Their Application , 1989, Oper. Res..

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

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

[10]  P. Wolfe.  THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .

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

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

[13]  André F. Perold,et al.  Large-Scale Portfolio Optimization , 1984 .

[14]  Daniel Bienstock,et al.  Computational study of a family of mixed-integer quadratic programming problems , 1995, Math. Program..

[15]  Haim Levy,et al.  Portfolio and Investment Selection: Theory and Practice , 1984 .

[16]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[17]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[18]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[19]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[20]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

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

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

[23]  Hitoshi Takehara.  An interior point algorithm for large scale portfolio optimization , 1993, Ann. Oper. Res..

[24]  Yazid M. Sharaiha,et al.  Heuristics for cardinality constrained portfolio optimisation , 2000, Comput. Oper. Res..