Solving Portfolio Optimization Problems Using MOEA/D and Levy Flight
Portfolio optimization is a financial task which requires the allocation of capital on a set of financial assets to achieve a better trade-off between return and risk. To solve this problem, recent studies applied multi-objective evolutionary algorithms (MOEAs) for its natural bi-objective structure. This paper presents a method injecting a distribution-based mutation method named L\'evy Flight into a decomposition based MOEA named MOEA/D. The proposed algorithm is compared with three MOEA/D-like algorithms, NSGA-II, and other distribution-based mutation methods on five portfolio optimization benchmarks sized from 31 to 225 in OR library without constraints, assessing with six metrics. Numerical results and statistical test indicate that this method can outperform comparison methods in most cases. We analyze how Levy Flight contributes to this improvement by promoting global search early in the optimization. We explain this improvement by considering the interaction between mutation method and the property of the problem.
Code (1)
Tasks
Evolutionary AlgorithmsPortfolio OptimizationSimilar Papers 제목 키워드 기반
Automatic Construction of Parallel Algorithm Portfolios for Multi-objective Optimization
It has been widely observed that there exists no universal best Multi-objective Evolutionary Algorithm (MOEA) dominating all other MOEAs on all possible Multi-objective Optimization Problems (MOPs). In this work, we advo…
Utilizing Dependence among Variables in Evolutionary Algorithms for Mixed-Integer Programming: A Case Study on Multi-Objective Constrained Portfolio Optimization
Several real-world applications could be modeled as Mixed-Integer Non-Linear Programming (MINLP) problems, and some prominent examples include portfolio optimization, remote sensing technology, and so on. Most of the mod…
Evolutionary AlgorithmsImage ClassificationPortfolio OptimizationDeep Reinforcement Learning-Assisted Automated Operator Portfolio for Constrained Multi-objective Optimization
Constrained multi-objective optimization problems (CMOPs) are of great significance in the context of practical applications, ranging from scientific to engineering domains. Most existing constrained multi-objective evol…
Reinforcement LearningVariable Division and Optimization for Constrained Multiobjective Portfolio Problems
Variable division and optimization (D\&O) is a frequently utilized algorithm design paradigm in Evolutionary Algorithms (EAs). A D\&O EA divides a variable into partial variables and then optimize them respectively. A co…
Evolutionary AlgorithmsMOEA/D with Angle-based Constrained Dominance Principle for Constrained Multi-objective Optimization Problems
This paper proposes a novel constraint-handling mechanism named angle-based constrained dominance principle (ACDP) embedded in a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained mu…
Diversity