MULTIOBJECTIVE EVOLUTIONARY METAHEURISTIC APPROACH TO THE CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we propose a multi-objective evolutionary metaheuristic approach based on the Pareto Ant Colony Optimization (P-ACO) metaheuristic and the non-dominated genetic sorting algorithms (NSGA II and NSGA III) to solve a bi-objective portfolio optimization problem. P-ACO is used to select the best assets composing the efficient portfolio. Then, NSGA II and NSGA III are separately used to find the proportional weights of the budget allocated to the selected portfolio. The results we obtained by these two algorithms were compared to designate the best performing algorithm. Finally, we performed another comparison between our results and those of an exact method used for the same problem. The numerical experiments performed on a set of instances from the literature revealed that the combination of the ant colony optimization metaheuristic and the NSGA III genetic algorithm that we proposed most often gave much better results than both the combination of the ant colony optimization metaheuristic and NSGA II on the one hand and the iterative approach on the other hand.

Cite

CITATION STYLE

APA

Ikhlef, M., & Aïder, M. (2023). MULTIOBJECTIVE EVOLUTIONARY METAHEURISTIC APPROACH TO THE CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM. Pesquisa Operacional, 43. https://doi.org/10.1590/0101-7438.2023.043.00266962

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free