Metaheuristics for the Portfolio Selection Problem
نویسندگان
چکیده
The Portfolio selection problem is a relevant problem arising in finance and economics. Some practical formulations of the problem include various kinds of nonlinear constraints and objectives and can be efficiently solved by approximate algorithms. Among the most effective approximate algorithms, are metaheuristic methods that have been proved to be very successful in many applications. This paper presents an overview of the literature on the application of metaheuristics to the portfolio selection problem, trying to provide a general descriptive scheme. KeywordsMetaheuristics, Local search, Portfolio selection, Portfolio optimization ∗ Corresponding author’s email: [email protected]
منابع مشابه
Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملThe project portfolio selection and scheduling problem: mathematical model and algorithms
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...
متن کاملDeveloping a multi objective possibilistic programming model for portfolio selection problem
Portfolio selection problem is one of the most important issues in the area of financial management in which is attempted to allocate wealth to different assets with controlling the return and risk. The aim of this paper is to obtain the optimum portfolio with regard to the cardinality and threshold constraints. In the paper, a novel multi-objective possibilistic programming model is developed ...
متن کاملFirefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint
Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem...
متن کاملArtificial Bee Colony Algorithm Hybridized with Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Selection Problem
Portfolio selection (optimization) problem is a very important and widely researched problem in the areas of finance and economy. Literature review shows that many methods and heuristics were applied to this hard optimization problem, however, there are only few implementations of swarm intelligence metaheuristics. This paper presents artificial bee colony (ABC) algorithm applied to the cardina...
متن کامل