• DocumentCode
    2926893
  • Title

    The efficient set GA for stock portfolios

  • Author

    Shoaf, Jacqueline ; Foster, James A.

  • Author_Institution
    Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA
  • fYear
    1998
  • fDate
    4-9 May 1998
  • Firstpage
    354
  • Lastpage
    359
  • Abstract
    The genetic algorithm (GA) for the efficient set portfolio problem based on the Markowitz model, introduced by Shoaf and Foster (1996), offers significant benefits over the quadratic programming approach. These benefits include simultaneous optimization of risk and return. The efficient set GA uses an indirect representation style in order to avoid infeasible solutions and penalty functions. The success of this approach had raised questions about the scalability of this GA. New empirical results confirm that the efficient set GA scales well with time complexity O(n log n) for portfolios containing up to n=100 stocks. Additional experiments also show that a deme implementation extends the period of active solution improvement for this GA
  • Keywords
    computational complexity; genetic algorithms; securities trading; active solution improvement; efficient set portfolio problem; genetic algorithm; indirect representation style; return; risk; scalability; simultaneous optimization; time complexity; Computer science; Covariance matrix; Equations; Genetic algorithms; Investments; Portfolios; Quadratic programming; Resource management; Security; Wheels;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on
  • Conference_Location
    Anchorage, AK
  • Print_ISBN
    0-7803-4869-9
  • Type

    conf

  • DOI
    10.1109/ICEC.1998.699758
  • Filename
    699758