Skip to main content

Abstract

Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by approximate algorithms. In this work, we present a hybrid technique that combines a local search, as master solver, with a quadratic programming procedure, as slave solver. Experimental results show that the approach is very promising and achieves results comparable with, or superior to, the state of the art solvers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armañanzas, R., Lozano, J.A.: A multiobjective approach to the portfolio optimization problem. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC 2005), vol. 2, pp. 1388–1395. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  2. Arnone, S., Loraschi, A., Tettamanzi, A.: A genetic approach to portfolio selection. Neural Network World – International Journal on Neural and Mass-Parallel Computing and Information Systems 3(6), 597–604 (1993)

    Google Scholar 

  3. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), New York, 9–13 July 2002, pp. 11–18. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  4. Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Computers & Operations Research 27(13), 1271–1302 (2000)

    Article  MATH  Google Scholar 

  5. Crama, Y., Schyns, M.: Simulated annealing for complex portfolio selection problems. European Journal of Operational Research 150, 546–571 (2003)

    Article  MATH  Google Scholar 

  6. Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software—Practice & Experience 33(8), 733–765 (2003)

    Article  Google Scholar 

  7. di Tollo, G., Roli, A.: Metaheuristics for the portfolio selection problem. Technical Report R-2006-005, Dipartimento di Scienze, Università “G. D’Annunzio” Chieti–Pescara (2006)

    Google Scholar 

  8. Dioşan, L.: A multi-objective evolutionary approach to the portfolio optimization problem. In: Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation (CIMCA 2005), pp. 183–188. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  9. Gilli, M., Këllezi, E.: A global optimization heuristic for portfolio choice with VaR and expected shortfall. In: Pardalos, P., Hearn, D.W. (eds.) Computational Methods in Decision-making, Economics and Finance. Applied Optimization Series, Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  10. Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  11. Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming 27, 1–33 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gomez, M.A., Flores, C.X., Osorio, M.A.: Hybrid search for cardinality constrained portfolio optimization. In: Proceedings of the 8th annual conference on Genetic and Evolutionary Computation, pp. 1865–1866. ACM Press, New York (2006), doi:10.1145/1143997.1144302

    Chapter  Google Scholar 

  13. Hoos, H.H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)

    MATH  Google Scholar 

  14. Jobst, N.J., Horniman, M.D., Lucas, C.A., Mitra, G.: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints. Quantitative Finance 1, 1–13 (2001)

    Article  MathSciNet  Google Scholar 

  15. Kellerer, H., Maringer, D.G.: Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectrum 25(4), 481–495 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kellerer, H., Mansini, R., Speranza, M.G.: On selecting a portfolio with fixed costs and minimum transaction lots. Annals of Operations Research 99, 287–304 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lin, D., Wang, S., Yan, H.: A multiobjective genetic algorithm for portfolio selection. Working paper (2001)

    Google Scholar 

  18. Loraschi, A., Tettamanzi, A.: An evolutionary algorithm for portfolio selection within a downside risk framework. In: Dunis, C. (ed.) Forecasting Financial Markets. Series in Financial Economics and Quantitative Analysis, pp. 275–285. John Wiley & Sons, Chichester (1996)

    Google Scholar 

  19. Loraschi, A., Tettamanzi, A., Tomassini, M., Verda, P.: Distributed genetic algorithms with an application to portfolio selection problems. In: Pearson, D.W., Steele, N.C., Albrecht, R.F. (eds.) Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp. 384–387. Springer, Heidelberg (1995)

    Google Scholar 

  20. Mansini, R., Speranza, M.G.: Heuristic algorithms for the portfolio selection problem with minimum transaction lots. European Journal of Operational Research 114, 219–233 (1999)

    Article  MATH  Google Scholar 

  21. Mansini, R., Speranza, M.G.: An exact approach for portfolio selection with transaction costs and rounds. IIE Transactions 37, 919–929 (2005)

    Article  Google Scholar 

  22. Mansini, R., Ogryczak, W., Speranza, M.G.: Lp solvable models for portfolio optimization a classification and computational comparison. IMA Journal of Management Mathematics 14, 187–220 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Maringer, D.G.: Optimizing portfolios with ant systems. In: Proceedings of the International ICSC congress on computational intelligence: methods and applications (CIMA 2001), pp. 288–294. ISCS Academic Press (2001)

    Google Scholar 

  24. Maringer, D.G., Winker, P.: Portfolio optimization under different risk constraints with modified memetic algorithms. Technical Report 2003–005E, University of Erfurt, Faculty of Economics, Law and Social Sciences (2003)

    Google Scholar 

  25. Markowitz, H.: Portfolio selection. Journal of Finance 7(1), 77–91 (1952)

    Article  Google Scholar 

  26. Moral-Escudero, R., Ruiz-Torrubiano, R., Suárez, A.: Selection of optimal investment with cardinality constraints. In: Proceedings of the IEEE World Congress on Evolutionary Computation (CEC 2006), pp. 2382–2388 (2006)

    Google Scholar 

  27. Ong, C.S., Huang, J.J., Tzeng, G.H.: A novel hybrid model for portfolio selection. Applied Mathematics and Computation 169, 1195–1210 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  28. Perold, A.F.: Large-scale portfolio optimization. Management Science 30(10), 1143–1160 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  29. Prestwich, S.D., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273–287. Springer, Heidelberg (2005)

    Google Scholar 

  30. Rolland, E.: A tabu search method for constrained real-number search: applications to portfolio selection. Working paper (1996)

    Google Scholar 

  31. Schaerf, A.: Local search techniques for constrained portfolio selection problems. Computational Economics 20(3), 177–190 (2002)

    Article  MATH  Google Scholar 

  32. Speranza, M.G.: A heuristic algorithm for a portfolio optimization model applied to the Milan stock market. Computers & Operations Research 23(5), 433–441 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  33. Streichert, F., Ulmer, H., Zell, A.: Comparing discrete and continuous genotypes on the constrained portfolio selection problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 1239–1250. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Pascal Van Hentenryck Laurence Wolsey

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Di Gaspero, L., di Tollo, G., Roli, A., Schaerf, A. (2007). Hybrid Local Search for Constrained Financial Portfolio Selection Problems. In: Van Hentenryck, P., Wolsey, L. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2007. Lecture Notes in Computer Science, vol 4510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72397-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72397-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72396-7

  • Online ISBN: 978-3-540-72397-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics