2,329 research outputs found
Clustering stock exchange data by using evolutionary algorithms for portfolio management
In present paper, imperialist competitive algorithm and ant colony algorithm and particle swarm optimization algorithm have been used to cluster stocks of Tehran stock exchange. Also results of the three algorithms have been compared with three famous clustering models so called k-means, Fcm and Som. After clustering, a portfolio has been made by choosing some stocks from each cluster and using NSGA-II algorithm. Results show superiority of ant colony algorithms and particle swarm optimization algorithm and imperialist competitive to other three methods for clustering stocks. Due to diversification of the portfolio, portfolio risk will be reduced while using data chosen from the clusters. The more efficient the clustering, the lower the risk is. Also, using clustering for portfolio management reduces time of portfolio selection.peer-reviewe
Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
Decision trees usefully represent sparse, high dimensional and noisy data.
Having learned a function from this data, we may want to thereafter integrate
the function into a larger decision-making problem, e.g., for picking the best
chemical process catalyst. We study a large-scale, industrially-relevant
mixed-integer nonlinear nonconvex optimization problem involving both
gradient-boosted trees and penalty functions mitigating risk. This
mixed-integer optimization problem with convex penalty terms broadly applies to
optimizing pre-trained regression tree models. Decision makers may wish to
optimize discrete models to repurpose legacy predictive models, or they may
wish to optimize a discrete model that particularly well-represents a data set.
We develop several heuristic methods to find feasible solutions, and an exact,
branch-and-bound algorithm leveraging structural properties of the
gradient-boosted trees and penalty functions. We computationally test our
methods on concrete mixture design instance and a chemical catalysis industrial
instance
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
Portfolio Optimization Using Evolutionary Algorithms
Dissertation presented as the partial requirement for obtaining a Master's degree in Data Science and Advanced AnalyticsPortfolio optimization is a widely studied field in modern finance. It involves finding
the optimal balance between two contradictory objectives, the risk and the return.
As the number of assets rises, the complexity in portfolios increases considerably,
making it a computational challenge. This report explores the application of the
Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) and
Genetic Algorithm (GA) in the field of portfolio optimization.
MOEA/D and GA have proven to be effective at finding portfolios. However, it
remains unclear how they perform when compared to traditional approaches used
in finance. To achieve this, a framework for portfolio optimization is proposed, using
MOEA/D, and GA separately as optimization algorithms and Capital Asset Pricing
Model (CAPM) and Mean-Variance Model as methods to evaluate portfolios.
The proposed framework is able to produce weighted portfolios successfully. These
generated portfolios were evaluated using a simulation with subsequent (unseen)
prices of the assets included in the portfolio. The simulation was compared with
well known portfolios in the same market and other market benchmarks (Security
Market Line and Market Portfolio).
The results obtained in this investigation exceeded expectation by creating
portfolios that perform better than the market. CAPM and Mean-Variance Model,
although they fail to model all the variables that affect the stock market, provide a
simple valuation for assets and portfolios. MOEA/D using Differential Evolution
operators and the CAPM model produced the best portfolios in this research.
Work can still be done to accommodate more variables that can affect markets and
portfolios, such as taxes, investment horizon and costs for transactions
Initial Solution Heuristic for Portfolio Optimization of Electricity Markets Participation
Meta-heuristic search methods are used to find near optimal global solutions for difficult optimization problems. These meta-heuristic processes usually require some kind of knowledge to overcome the local optimum locations. One way to achieve diversification is to start the search procedure from a solution already obtained through another method. Since this solution is already validated the algorithm will converge easily to a greater global solution. In this work, several well-known meta-heuristics are used to solve the problem of electricity markets participation portfolio optimization. Their search performance is compared to the performance of a proposed hybrid method (ad-hoc heuristic to generate the initial solution, which is combined with the search method). The addressed problem is the portfolio optimization for energy markets participation, where there are different markets where it is possible to negotiate. In this way the result will be the optimal allocation of electricity in the different markets in order to obtain the maximum return quantified through the objective function.This work has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 641794 (project DREAM-GO) and from FEDER Funds through COMPETE program and from National Funds through FCT under the project UID/EEA/00760/2013.info:eu-repo/semantics/publishedVersio
Particle Swarm Optimization
Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field
Recommended from our members
A new evolutionary search strategy for global optimization of high-dimensional problems
Global optimization of high-dimensional problems in practical applications remains a major challenge to the research community of evolutionary computation. The weakness of randomization-based evolutionary algorithms in searching high-dimensional spaces is demonstrated in this paper. A new strategy, SP-UCI is developed to treat complexity caused by high dimensionalities. This strategy features a slope-based searching kernel and a scheme of maintaining the particle population's capability of searching over the full search space. Examinations of this strategy on a suite of sophisticated composition benchmark functions demonstrate that SP-UCI surpasses two popular algorithms, particle swarm optimizer (PSO) and differential evolution (DE), on high-dimensional problems. Experimental results also corroborate the argument that, in high-dimensional optimization, only problems with well-formative fitness landscapes are solvable, and slope-based schemes are preferable to randomization-based ones. © 2011 Elsevier Inc. All rights reserved
- …