Skip to main content

A Novel Framework for Portfolio Optimization Based on Modified Simulated Annealing Algorithm Using ANN, RBFN, and ABC Algorithms

  • Chapter
  • First Online:
Towards Extensible and Adaptable Methods in Computing

Abstract

The objective of the portfolio optimization problem is to search an optimal solution for investing an amount as a stipulated value if a set of assets or securities is given. This paper has a description of a new approach for a framework that has two nascent basal parameters which are derived from return values obtained from the basic mean-variance model and another significant parameter conditional value at risk. This framework is capable of finding an optimal solution for the cost involving quadratic equations using these basal parameters, and an illustration of the approach based on modified stimulated annealing (SA) is offered in the framework, which uses a significant parameter, viz. modified step and computes optimal values of the cost. The computation of the value of the parameter modified step uses another parameter radius. Two approaches for computing the value of parameter radius are provided, which are based on ABC algorithm or by applying RBFN. ABC algorithm uses two significant parameters which are used for binding maximum and minimum values for computing the value of radius. RBFN uses three different functions, and the value of radius is computed from the maximum and minimum value of points in these functions. Lastly, the value of step is modified by multiplying it by another factor which is computed from ANN structure. Finally, the modified SA algorithm is applied, such that an optimal value of the cost, as well as the optimal value of the basal parameter, may be obtained using this modified value of step. The intention is to minimize the overall cost which is computed from quadratic equations based on these basal key parameters. A comparison of both the approaches which are based on either modified ABC or modified RBFN is shown in the paper. The results obtained show the validation of the two schemes adopted in the paper for computing the optimal solutions of the basal parameters used in the solution of portfolio optimization.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

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

    Google Scholar 

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

    Article  Google Scholar 

  3. Gupta, P., Mehlawat, M. K., Inuiguchi, M., & Chandra, S. (2014). Fuzzy portfolio optimization: Advances in hybrid mult-criteria methodologies (Vol. 316). Springer.

    Google Scholar 

  4. Chen, W. (2015). Artificial bee colony algorithm for constrained possibilistic portfolio optimization problem. Physica A: Statistical Mechanics and its Applications, 429, 125–139.

    Article  MathSciNet  Google Scholar 

  5. Shen, W., Guo, X., Wu, C., & Wu, D. (2011). Forecasting stock indices using radial basis function neural networks optimized by artificial fish swarm algorithm. Knowledge-Based Systems, 24(3), 378–385.

    Article  Google Scholar 

  6. Kumar, D., & Mishra, K. K. (2017). Portfolio optimization using novel co-variance guided artificial bee colony algorithm. Swarm and Evolutionary Computation, 33, 119–130.

    Article  Google Scholar 

  7. Luo, Y., Zhu, B., & Tang, Y. (2014). Simulated annealing algorithm for optimal capital growth. Physica A: Statistical Mechanics and its Applications, 408, 10–18.

    Article  MathSciNet  Google Scholar 

  8. Yu, L., Wang, S., & Lai, K. K. (2008). Neural network-based mean–variance–skewness model for portfolio selection. Computers & Operations Research, 35(1), 34–46.

    Article  Google Scholar 

  9. Yevseyeva, I., Guerreiro, A. P., Emmerich, M. T., & Fonseca, C. M. (2014, September). A portfolio optimization approach to selection in multiobjective evolutionary algorithms. In International Conference on Parallel Problem Solving from Nature (pp. 672–681). Springer, Cham.

    Google Scholar 

  10. Gan, G., & Huang, J. X. (2017, August). A data mining framework for valuing large portfolios of variable annuities. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1467–1475). ACM.

    Google Scholar 

  11. Zhao, H., Liu, Q., Wang, G., Ge, Y., & Chen, E. (2016, August). Portfolio selections in P2P lending: A multi-objective perspective. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 2075–2084). ACM.

    Google Scholar 

  12. Das, P., Banerjee, A. (2011, August). Meta optimization and its application to portfolio selection. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1163–1171). ACM.

    Google Scholar 

  13. Chen, J. S., & Hou, J. L. (2006). A combination genetic algorithm with applications on portfolio optimization. Lecture Notes in Computer Science, 4031, 197.

    Article  Google Scholar 

  14. Meghwani, S. S., Thakur, M. (2017). Multi-criteria algorithms for portfolio optimization under practical constraints. Swarm and Evolutionary Computation.

    Article  Google Scholar 

  15. Qin, Z., Kar, S., & Zheng, H. (2016). Uncertain portfolio adjusting model using semiabsolute deviation. Soft Computing, 20(2), 717–725.

    Article  Google Scholar 

  16. Sivanandam, S. N., Deepa, S. N. (2006). Introduction to neural networks using Matlab 6.0. Tata McGraw-Hill Education.

    Google Scholar 

  17. Calvet, L., Kizys, R., Juan, A. A., & De Armas, J. (2016). A SimILS-based methodology for a portfolio optimization problem with stochastic returns. In Modeling and Simulation in Engineering, Economics and Management (pp. 3–11). Springer International Publishing.

    Google Scholar 

  18. Better, M., Glover, F., Kochenberger, G., & Wang, H. (2008). Simulation optimization: Applications in risk management. International Journal of Information Technology & Decision Making, 7(04), 571–587.

    Article  Google Scholar 

  19. Qi, R., & Yen, G. G. (2017). Hybrid bi-objective portfolio optimization with pre-selection strategy. Information Sciences, 417, 401–419.

    Article  Google Scholar 

  20. Qiu, H., Han, F., Liu, H., & Caffo, B. (2015). Robust portfolio optimization. In Advances in Neural Information Processing Systems (pp. 46–54).

    Google Scholar 

  21. Kothari, D. P., Dhillon, J. S. (2006). Power system optimization (pp. 131–244, 321–386). New Delhi: Prentice-Hall.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chanchal Kumar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kumar, C., Doja, M.N., Baig, M.A. (2018). A Novel Framework for Portfolio Optimization Based on Modified Simulated Annealing Algorithm Using ANN, RBFN, and ABC Algorithms. In: Chakraverty, S., Goel, A., Misra, S. (eds) Towards Extensible and Adaptable Methods in Computing. Springer, Singapore. https://doi.org/10.1007/978-981-13-2348-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2348-5_13

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2347-8

  • Online ISBN: 978-981-13-2348-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics