IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-030-70281-6_9.html
   My bibliography  Save this book chapter

Optimal Portfolio Selection with Particle Swarm Algorithm: An Application on BIST-30

In: Applying Particle Swarm Optimization

Author

Listed:
  • Burcu Adıgüzel Mercangöz

    (Istanbul University)

  • Altaf Q. H. Badar

    (National Institute of Technology)

Abstract

Optimization is to find the best-performing solution under the constraints given. It can be something better by optimization process. Heuristic algorithm is an optimization algorithm which depends on natural events. The algorithms are simple and easy to implement for the researcher. The portfolio optimization is a process to find a solution to select the most appropriate combination between all financial assets under certain expectations and constraints. While solving portfolio optimization problems, the aim is to create portfolios by selecting the assets that provide the highest return from huge numbers of financial assets at a certain risk level or provide the lowest risk at a certain level of return. This chapter aims to examine the optimum portfolio with minimum risk by using the particle swarm optimization (PSO) technique, for the stocks in the BIST-30 index. Logarithmic returns are calculated using the price data of the stocks. By using these returns, the optimum portfolio with minimum risk is created with PSO and nonlinear GRG (generalized reduced gradient) techniques. The empirical results obtained indicate that both methods give similar results.

Suggested Citation

  • Burcu Adıgüzel Mercangöz & Altaf Q. H. Badar, 2021. "Optimal Portfolio Selection with Particle Swarm Algorithm: An Application on BIST-30," International Series in Operations Research & Management Science, in: Burcu Adıgüzel Mercangöz (ed.), Applying Particle Swarm Optimization, edition 1, chapter 0, pages 155-167, Springer.
    • Handle: RePEc:spr:isochp:978-3-030-70281-6_9
    DOI: 10.1007/978-3-030-70281-6_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-3-030-70281-6_9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.