Ortalama-varyans portföy optimizasyonunda genetik algoritma uygulamaları üzerine bir literatür araştırması

Mean-variance portfolio optimization model, introduced by Markowitz, provides a fundamental answer to the problem of portfolio management. This model seeks an efficient frontier with the best trade-offs between two conflicting objectives of maximizing return and minimizing risk. The problem of determining an efficient frontier is known to be NP-hard. Due to the complexity of the problem, genetic algorithms have been widely employed by a growing number of researchers to solve this problem. In this study, a literature review of genetic algorithms implementations on mean-variance portfolio optimization is examined from the recent published literature. Main specifications of the problems studied and the specifications of suggested genetic algorithms have been summarized

Particle Swarm Optimization with non-smooth penalty reformulation for a complex portfolio selection problem

In the classical model for portfolio selection the risk is measured by the variance of returns. It is well known that, if returns are not elliptically distributed, this may cause inaccurate investment decisions. To address this issue, several alternative measures of risk have been proposed. In this contribution we focus on a class of measures that uses information contained both in lower and in upper tail of the distribution of the returns. We consider a nonlinear mixed-integer portfolio selection model which takes into account several constraints used in fund management practice. The latter problem is NP-hard in general, and exact algorithms for its minimization, which are both effective and efficient, are still sought at present. Thus, to approximately solve this model we experience the heuristics Particle Swarm Optimization (PSO). Since PSO was originally conceived for unconstrained global optimization problems, we apply it to a novel reformulation of our mixed-integer model, where a standard exact penalty function is introduced.Portfolio selection, coherent risk measure, fund management constraints, NP-hard mathematical programming problem, PSO, exact penalty method, SP100 index's assets.

Portfolio Selection Problem Using Generalized Differential Evolution 3

This Portfolio selection Problem (PSP) remains an intractable research problem in finance and economics and often regarded as NP-hard problem in optimization and computational intelligence. This paper solved the extended Markowitz mean- variance portfolio selection model with an efficient Metaheuristics method of Generalized Differential Evolution 3 (GDE3). The extended Markowitz mean- variance portfolio selection model consists of four constraints: bounds on holdings, cardinality, minimum transaction lots, and expert opinion. There is no research in literature that had ever engaged the set of four constraints with GDE3 to solve PSP. This paper is the first to conduct the study in this direction. The first three sets of constraints have been presented in other researches in literatures. This paper introduced expert opinion constraint to existing portfolio selection models and solved with GDE3. The computational results obtained in this research study show improved performance when compared with other Metaheuristics methods of Genetic algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Particle Swarm Optimization (PSO)

A survey on financial applications of metaheuristics

Modern heuristics or metaheuristics are optimization algorithms that have been increasingly used during the last decades to support complex decision-making in a number of fields, such as logistics and transportation, telecommunication networks, bioinformatics, finance, and the like. The continuous increase in computing power, together with advancements in metaheuristics frameworks and parallelization strategies, are empowering these types of algorithms as one of the best alternatives to solve rich and real-life combinatorial optimization problems that arise in a number of financial and banking activities. This article reviews some of the works related to the use of metaheuristics in solving both classical and emergent problems in the finance arena. A non-exhaustive list of examples includes rich portfolio optimization, index tracking, enhanced indexation, credit risk, stock investments, financial project scheduling, option pricing, feature selection, bankruptcy and financial distress prediction, and credit risk assessment. This article also discusses some open opportunities for researchers in the field, and forecast the evolution of metaheuristics to include real-life uncertainty conditions into the optimization problems being considered.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER, and the Universitat Jaume I mobility program (E-2015-36)

Applying Particle Swarm Optimization to Solve Portfolio Selection Problems

Particle swarm optimization (PSO), introduced by Kennedy and Eberhart in 1995, is a social population-based search algorithm and is generally similar to the evolutionary computation techniques that have been successfully applied to solve various hard optimization problems. The standard Markowitz mean-variance approach to portfolio selection involves tracing out an efficient frontier, a continuous curve illustrating the tradeoff between return and risk. In this paper we applied the particle swarm approach to find an efficient frontier associated with the classical and general (unconstrained and constrained) mean-variance portfolio selection problem. The OR library data sets were tested in our paper and computational results showed that the PSO found better solutions when compared to genetic algorithm (GA), simulated annealing(SA), and tabu search(TS)

On Tackling Real-Life Optimization Problems

Most real-world applications are concerned with minimizing or maximizing some quantity so as to enhance some result. This emphasizes the importance of optimization and subsequently the significance of the optimization methods that are able to tackle these real-life optimization problems. There are a number of practical reasons for which traditional optimization and exhaustive algorithms cannot deal with a variety of these real-life optimization applications although there are numerous optimization problems that can benefit from applying these traditional optimization algorithms to handle them. Therefore, their is a need for propsong new optimization algorithms (such as nature inspired optimization methods) and optimize the capabilities of the existing ones (such as hybridization and parallelization) as well. This paper investigates the most recent optimization directions for dealing with the real-life optimization problems with an application to one of the most common and important optimization problems in a variety of financial fields and other fields which is the portfolio optimization problem since it is considered one of the most crucial problems in the modern financial management and has a variety of applications such as asset management and building strategic asset allocation. The computational results were got utilizing benchmark data from the OR library with the use of modern optimization algorithms. In addition, the article highlights the differences and similarities among the utilized optimization methods. In addition, recent advancements to the utilized optimization methods are highlighted

The application of water cycle algorithm to portfolio selection

Portfolio selection is one of the most vital financial problems in literature. The studied problem is a nonlinear multi-objective problem which has been solved by a variety of heuristic and metaheuristic techniques. In this article, a metaheuristic optimiser, the multiobjective water cycle algorithm (MOWCA), is represented to find efficient frontiers associated with the standard mean-variance (MV) portfolio optimisation model. The inspired concept of WCA is based on the simulation of water cycle process in the nature. Computational results are obtained for analyses of daily data for the period January 2012 to December 2014, including S&P100 in the US, Hang Seng in Hong Kong, FTSE100 in the UK, and DAX100 in Germany. The performance of the MOWCA for solving portfolio optimisation problems has been evaluated in comparison with other multi-objective optimisers including the NSGA-II and multiobjective particle swarm optimisation (MOPSO). Four well-known performance metrics are used to compare the reported optimisers. Statistical optimisation results indicate that the applied MOWCA is an efficient and practical optimiser compared with the other methods for handling portfolio optimisation problems

Improved Constrained Portfolio Selection Model using Particle Swarm Optimization

Objective: The main objective of this study is to improve the extended Markowitz mean-variance portfolio selection model by introducing a new constraint known as expert opinion practicable for portfolio selection in real-life situation. Methods: This new extended model consists of four constraints namely: bounds on holdings, cardinality, minimum transaction lots, and expert opinion. The first three constraints have been presented in other researches in literature. The fourth constraint introduced in this study is an essential parameter in making and guiding a realistic portfolio selection. To solve this new extended model an efficient heuristic method of Particle Swarm Optimization (PSO) was engaged with existing benchmark data in the literature. Results: The outcome of the computational results obtained in this study with the new extended Markowitz mean-variance portfolio selection model proposed in this study and solved with PSO showed an improved performance over existing algorithm in particular GA in different instances of the data set used. Conclusion: The study evolves a new extended portfolio selection model and the findings

Equity portfolio management with cardinality constraints and risk parity control using multi-objective particle swarm optimization

The financial crisis and the market uncertainty of the last years have pointed out the shortcomings of traditional portfolio theory to adequately manage the different sources of risk of the investment process. This paper addresses the issue by developing an alternative portfolio design, that integrates risk parity into the cardinality constrained portfolio optimization model. The resulting mixed integer programming problem is handled by an improved multi-objective particle swarm optimization algorithm. Three hybrid approaches, based on a repair mechanism and different versions of the constrained-domination principle, are proposed to handle constraints. The efficiency of the algorithm and the effectiveness of the solution approaches are assessed through a set of numerical examples. Moreover, the benefits of adopting the proposed strategy instead of the cardinality constrained mean-variance approach are validated in an out-of-sample experiment

Optimal Portfolio Management for Engineering Problems Using Nonconvex Cardinality Constraint: A Computing Perspective

The problem of portfolio management relates to the selection of optimal stocks, which results in a maximum return to the investor while minimizing the loss. Traditional approaches usually model the portfolio selection as a convex optimization problem and require the calculation of gradient. Note that gradient-based methods can stuck at local optimum for complex problems and the simplification of portfolio optimization to convex, and further solved using gradient-based methods, is at a high cost of solution accuracy. In this paper, we formulate a nonconvex model for the portfolio selection problem, which considers the transaction cost and cardinality constraint, thus better reflecting the decisive factor affecting the selection of portfolio in the real-world. Additionally, constraints are put into the objective function as penalty terms to enforce the restriction. Note that this reformulated problem cannot be readily solved by traditional methods based on gradient search due to its nonconvexity. Then, we apply the Beetle Antennae Search (BAS), a nature-inspired metaheuristic optimization algorithm capable of efficient global optimization, to solve the problem. We used a large real-world dataset containing historical stock prices to demonstrate the efficiency of the proposed algorithm in practical scenarios. Extensive experimental results are presented to further demonstrate the efficacy and scalability of the BAS algorithm. The comparative results are also performed using Particle Swarm Optimizer (PSO), Genetic Algorithm (GA), Pattern Search (PS), and gradient-based fmincon (interior-point search) as benchmarks. The comparison results show that the BAS algorithm is six times faster in the worst case (25 times in the best case) as compared to the rival algorithms while achieving the same level of performance