Skip to main content

Set-Based Particle Swarm Optimization for Portfolio Optimization

  • Conference paper
  • First Online:
Swarm Intelligence (ANTS 2020)

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

Included in the following conference series:

Abstract

Portfolio optimization is a complex real-world problem where assets are selected such that profit is maximized while risk is simultaneously minimized. In recent years, nature-inspired algorithms have become a popular choice for efficiently identifying optimal portfolios. This paper introduces such an algorithm that, unlike previous algorithms, uses a set-based approach to reduce the dimensionality of the problem and to determine the appropriate budget al.location for each asset. The results show that the proposed approach is capable of obtaining good quality solutions, while being relatively fast.

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

Access this chapter

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 39.99
Price excludes VAT (USA)
Softcover Book
USD 54.99
Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://people.brunel.ac.uk/~mastjjb/jeb/orlib/portinfo.html.

References

  1. Chang, T., Meade, N., Beasley, J., Sharaiha, Y.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13), 1271–1302 (2000). https://doi.org/10.1016/S0305-0548(99)00074-X

    Article  MATH  Google Scholar 

  2. Coello Coello, C.A., Reyes Sierra, M.: A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol. 2972, pp. 688–697. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24694-7_71

    Chapter  Google Scholar 

  3. Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: MHS 1995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39–43, October 1995. https://doi.org/10.1109/MHS.1995.494215

  4. Franken, N.: Visual exploration of algorithm parameter space. In: 2009 IEEE Congress on Evolutionary Computation, pp. 389–398 (2009)

    Google Scholar 

  5. Kalayci, C.B., Ertenlice, O., Akbay, M.A.: A comprehensive review of deterministic models and applications for mean-variance portfolio optimization. Expert Syst. Appl. 125, 345–368 (2019). https://doi.org/10.1016/j.eswa.2019.02.011

    Article  Google Scholar 

  6. Langeveld, J., Engelbrecht, A.P.: Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell. 6(4), 297–342 (2012). https://doi.org/10.1007/s11721-012-0073-4

    Article  Google Scholar 

  7. Markowitz, H.: Portfolio selection. J. Financ. 7(1), 77–91 (1952). https://doi.org/10.1111/j.1540-6261.1952.tb01525.x

    Article  Google Scholar 

  8. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 69–73 (1998). https://doi.org/10.1109/ICEC.1998.699146

  9. Veldhuizen, D.A.V., Lamont, G.B.: Multiobjective evolutionary algorithm research: a history and analysis. Technical reports, Department of Electrical and Computer Engineering. Graduate School of Engineering, Air Force Inst Technol, Wright Patterson, Technical Report TR-98-03 (1998)

    Google Scholar 

  10. Woodside-Oriakhi, M., Lucas, C., Beasley, J.: Heuristic algorithms for the cardinality constrained efficient frontier. Eur. J. Oper. Res. 213, 538–550 (2011). https://doi.org/10.1016/j.ejor.2011.03.030

    Article  MathSciNet  MATH  Google Scholar 

  11. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003). https://doi.org/10.1109/TEVC.2003.810758

    Article  Google Scholar 

Download references

Acknowledgements

The authors acknowledge the Centre for High Performance Computing (CHPC), South Africa, for providing computational resources to this research project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andries P. Engelbrecht.

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Erwin, K., Engelbrecht, A.P. (2020). Set-Based Particle Swarm Optimization for Portfolio Optimization. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2020. Lecture Notes in Computer Science(), vol 12421. Springer, Cham. https://doi.org/10.1007/978-3-030-60376-2_28

Download citation

Publish with us

Policies and ethics

Profiles

  1. Kyle Erwin