Skip to main content
SpringerLink
Log in

Steepest Ascent Hill Climbing for Portfolio Selection

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7248))

Included in the following conference series:

Abstract

The construction of a portfolio in the financial field is a problem faced by individuals and institutions worldwide. In this paper we present an approach to solve the portfolio selection problem with the Steepest Ascent Hill Climbing algorithm. There are many works reported in the literature that attempt to solve this problem using evolutionary methods. We analyze the quality of the solutions found by a simpler algorithm and show that its performance is similar to a Genetic Algorithm, a more complex method. Real world restrictions such as portfolio value and rounded lots are considered to give a realistic approach to the problem.

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

Access this chapter

Log in via an institution
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. Aranha, C.C., Iba, H.: A tree-based ga representation for the portfolio optimization problem. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 873–880. ACM, New York (2008)

    Chapter  Google Scholar 

  2. Aranha, C.d.C., Iba, H.: Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 1427–1434. ACM, New York (2009)

    Chapter  Google Scholar 

  3. Castillo Tapia, M., Coello, C.: Applications of multi-objective evolutionary algorithms in economics and finance: A survey. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 532–539 (September 2007)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Chiam, S., Al Mamun, A., Low, Y.: A realistic approach to evolutionary multiobjective portfolio optimization. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 204–211 (September 2007)

    Google Scholar 

  6. Gao, J., Chu, Z.: An improved particle swarm optimization for the constrained portfolio selection problem. In: International Conference on Computational Intelligence and Natural Computing, CINC 2009, vol. 1, pp. 518–522 (June 2009)

    Google Scholar 

  7. Hassan, G., Clack, C.D.: Multiobjective robustness for portfolio optimization in volatile environments. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 1507–1514. ACM, New York (2008)

    Chapter  Google Scholar 

  8. Lu, J., Liechty, M.: An empirical comparison between nonlinear programming optimization and simulated annealing (sa) algorithm under a higher moments bayesian portfolio selection framework. In: Simulation Conference, Winter 2007, pp. 1021–1027 (December 2007)

    Google Scholar 

  9. Maringer, D.: Heuristic optimization for portfolio management [application notes]. IEEE Computational Intelligence Magazine 3(4), 31–34 (2008)

    Article  Google Scholar 

  10. Maringer, D., Kellerer, H.: Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectrum 25, 481–495 (2003), doi:10.1007/s00291-003-0139-1

    Article  MathSciNet  MATH  Google Scholar 

  11. Maringer, D., Parpas, P.: Global optimization of higher order moments in portfolio selection. Journal of Global Optimization 43, 219–230 (2009), doi:10.1007/s10898-007-9224-3

    Article  MathSciNet  MATH  Google Scholar 

  12. Maringer, D.G.: Distribution assumptions and risk constraints in portfolio optimization. Computational Management Science 2, 139–153 (2005), doi:10.1007/s10287-004-0031-8

    Article  MathSciNet  MATH  Google Scholar 

  13. Orito, Y., Yamamoto, H.: Index fund optimization using a genetic algorithm and a heuristic local search algorithm on scatter diagrams. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 2562–2568 (September 2007)

    Google Scholar 

  14. Winker, P., Maringer, D.: The hidden risks of optimizing bond portfolios under var. Journal of Risk 9(4), 1–19 (2007)

    Google Scholar 

  15. Woodside-Oriakhi, M., Lucas, C., Beasley, J.: Heuristic algorithms for the cardinality constrained efficient frontier. European Journal of Operational Research 213(3), 538–550 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Xu, F., Chen, W.: Stochastic portfolio selection based on velocity limited particle swarm optimization. In: The Sixth World Congress on Intelligent Control and Automation, WCICA 2006, vol. 1, pp. 3599–3603 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tecnológico de Monterrey, Campus Monterrey, Av. Eugenio Garza Sada 2501, C.P. 64849, Monterrey, N.L., México

    Jonathan Arriaga & Manuel Valenzuela-Rendón

Authors
  1. Jonathan Arriaga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Valenzuela-Rendón
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, University of Strathclyde, 16 Richmond Street, G1 1XQ, Glasgow, UK

    Cecilia Di Chio

  2. Financial Mathematics and Computation Cluster Natural Computing Research and Applications Group Complex and Adaptive Systems Laboratory, University College, Dublin, Ireland

    Alexandros Agapitos

  3. Department of Computer Engineering, University of Parma, Viale Usberti 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  4. ETSI Informática, Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  5. Centro Universitario de Merida, Universidad de Extremadura, Spain

    Francisco Fernández de Vega

  6. Dalle Molle Institute for Artificial Intelligence (IDSIA), Lugano, Switzerland

    Gianni A. Di Caro

  7. DFKI Bremen, Cyber-Physical Systems, Bremen, Germany

    Rolf Drechsler

  8. Knowledge Engineering Research Group, Aston University, B4 7ET, Aston Triangle, Birmingham, UK

    Anikó Ekárt

  9. Instituto Tecnológico de Informática, Edif. 8G Acceso B, Universidad Politécnica de Valencia, 46022, Valencia, Spain

    Anna I. Esparcia-Alcázar

  10. Next Generation Intelligent Networks Research Center (nexGIN RC), National University of Computer & Emerging Sciences (FAST-NU), Islamabad, Pakistan

    Muddassar Farooq

  11. Department of Computer Science,, University College London, Gower Street, WC1E 6BT, London, UK

    William B. Langdon

  12. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  13. Chair of Algorithm Engineering, Computational Intelligence Group, Dept. of Computer Science, Technische Universität Dortmund, Germany

    Mike Preuss

  14. HTWK Leipzig, Fakultät Elektrotechnik und Informationstechnik, Institut Mess–, Steuerungs– und Regelungstechnik, Postfach 30 11 66, D–04251, Leipzig, Germany

    Hendrik Richter

  15. INESC-ID Lisboa, Rua Alves Redol 9,, 1000-029, Lisboa, Portugal

    Sara Silva

  16. Centre for Informatics and Systems, University of Coimbra, Portugal

    Anabela Simões

  17. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  18. Institute of High Performance Computing and Networking, ICAR-CNR, Naples, Italy

    Ernesto Tarantino

  19. Dipartimento di Tecnologie dell’Informazione, Universita’ degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  20. IT University of Copenhagen, Rued Langaards Vej 7, 2300, Copenhagen, Denmark

    Julian Togelius

  21. Centre for Emergent Computing, Edinburgh Napier University, Edinburgh,, UK

    Neil Urquhart

  22. Department of Computer Engineering, Istanbul Technical University, 34490, Maslak, Turkey

    A. Şima Uyar

  23. Center For Computer Games Research, IT University Of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Georgios N. Yannakakis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arriaga, J., Valenzuela-Rendón, M. (2012). Steepest Ascent Hill Climbing for Portfolio Selection. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2012. Lecture Notes in Computer Science, vol 7248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29178-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29178-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29177-7

  • Online ISBN: 978-3-642-29178-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation