A Meta-heuristic Algorithm for Portfolio Selection Problem under Cardinality and Bounding Constraints

The focus of this paper is on standard Markowitz mean–variance model and its traditional approach to solve portfolio selection problem (Quadratic Planning). For this goal we have applied a meta-heuristic method based on genetic algorithms (GA) in order to trace out the efficient frontier associated with the portfolio selection problem under cardinality and bounding constraints. These constraints ensure the investment in a given number of different assets and limit the amount of capital to be invested in each asset. We have presented some experimental results in two samples from Iranian stock market and overseas ones and compare the GA result with unconstrained quadratic results. Finally, we have found out which proposed GA can optimize portfolio selection problem under cardinality and bounded constrains