IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v42y2013i4p453-470.html
   My bibliography  Save this article

Bacterial Foraging Optimization Approach to Portfolio Optimization

Author

Listed:
  • Yucheng Kao
  • Hsiu-Tzu Cheng

Abstract

In this paper we propose a heuristic approach based on bacterial foraging optimization (BFO) in order to find the efficient frontier associated with the portfolio optimization (PO) problem. The PO model with cardinality and bounding constraints is a mixed quadratic and integer programming problem for which no exact algorithms can solve in an efficient way. Consequently, various heuristic algorithms, such as genetic algorithms and particle swarm optimization, have been proposed in the past. This paper aims to examine the potential of a BFO algorithm in solving the PO problem. BFO is a new swarm intelligence technique that has been successfully applied to several real world problems. Through three operations, chemotaxis, reproduction, and elimination-dispersal, the proposed BFO algorithm can effectively solve a PO problem. The performance of the proposed approach was evaluated in computational tests on five benchmark data sets, and the results were compared to those obtained from existing heuristic algorithms. The proposed BFO algorithm is found to be superior to previous heuristic algorithms in terms of solution quality and time. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Yucheng Kao & Hsiu-Tzu Cheng, 2013. "Bacterial Foraging Optimization Approach to Portfolio Optimization," Computational Economics, Springer;Society for Computational Economics, vol. 42(4), pages 453-470, December.
    • Handle: RePEc:kap:compec:v:42:y:2013:i:4:p:453-470
    DOI: 10.1007/s10614-012-9357-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10614-012-9357-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10614-012-9357-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, March.
    2. Fred Glover, 1990. "Tabu Search: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 74-94, August.
    3. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
    4. Schaerf, Andrea, 2002. "Local Search Techniques for Constrained Portfolio Selection Problems," Computational Economics, Springer;Society for Computational Economics, vol. 20(3), pages 177-190, December.
    5. N. J. Jobst & M. D. Horniman & C. A. Lucas & G. Mitra, 2001. "Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints," Quantitative Finance, Taylor & Francis Journals, vol. 1(5), pages 489-501.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2015. "Linear vs. quadratic portfolio selection models with hard real-world constraints," Computational Management Science, Springer, vol. 12(3), pages 345-370, July.
    2. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
    3. Steuer, Ralph E. & Qi, Yue & Wimmer, Maximilian, 2024. "Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices," European Journal of Operational Research, Elsevier, vol. 313(2), pages 628-636.
    4. Ralph Steuer & Markus Hirschberger & Kalyanmoy Deb, 2016. "Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers," Journal of Global Optimization, Springer, vol. 64(1), pages 33-48, January.
    5. Branke, J. & Scheckenbach, B. & Stein, M. & Deb, K. & Schmeck, H., 2009. "Portfolio optimization with an envelope-based multi-objective evolutionary algorithm," European Journal of Operational Research, Elsevier, vol. 199(3), pages 684-693, December.
    6. Chen, Wei & Zhang, Wei-Guo, 2010. "The admissible portfolio selection problem with transaction costs and an improved PSO algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2070-2076.
    7. Walter Briec & Kristiaan Kerstens & Octave Jokung, 2007. "Mean-Variance-Skewness Portfolio Performance Gauging: A General Shortage Function and Dual Approach," Management Science, INFORMS, vol. 53(1), pages 135-149, January.
    8. Derigs, Ulrich & Marzban, Shehab, 2009. "New strategies and a new paradigm for Shariah-compliant portfolio optimization," Journal of Banking & Finance, Elsevier, vol. 33(6), pages 1166-1176, June.
    9. Alexander Nikiporenko, 2023. "Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation," Papers 2307.04045, arXiv.org.
    10. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    11. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    12. Briec, Walter & Kerstens, Kristiaan, 2009. "Multi-horizon Markowitz portfolio performance appraisals: A general approach," Omega, Elsevier, vol. 37(1), pages 50-62, February.
    13. Rui Pedro Brito & Hélder Sebastião & Pedro Godinho, 2015. "Portfolio Management With Higher Moments: The Cardinality Impact," GEMF Working Papers 2015-15, GEMF, Faculty of Economics, University of Coimbra.
    14. Gaivoronski, Alexei A. & Krylov, Sergiy & van der Wijst, Nico, 2005. "Optimal portfolio selection and dynamic benchmark tracking," European Journal of Operational Research, Elsevier, vol. 163(1), pages 115-131, May.
    15. Dimitris Andriosopoulos & Michalis Doumpos & Panos M. Pardalos & Constantin Zopounidis, 2019. "Computational approaches and data analytics in financial services: A literature review," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(10), pages 1581-1599, October.
    16. Aouni, Belaid & Colapinto, Cinzia & La Torre, Davide, 2014. "Financial portfolio management through the goal programming model: Current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 234(2), pages 536-545.
    17. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    18. Calvo, Clara & Ivorra, Carlos & Liern, Vicente, 2015. "Finding socially responsible portfolios close to conventional ones," International Review of Financial Analysis, Elsevier, vol. 40(C), pages 52-63.
    19. Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 518-535.
    20. Akiko Takeda & Mahesan Niranjan & Jun-ya Gotoh & Yoshinobu Kawahara, 2013. "Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios," Computational Management Science, Springer, vol. 10(1), pages 21-49, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:42:y:2013:i:4:p:453-470. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.