Abstract

The classic model of Markowitz for designing investment portfolios is an optimization problem with two objectives: maximize returns and minimize risk. Various alternatives and improvements have been proposed by different authors, who have contributed to the theory of portfolio selection. One of the most important contributions is the Sharpe Ratio, which allows comparison of the expected return of portfolios. Another important concept for investors is diversification, measured through the average correlation. In this measure, a high correlation indicates a low level of diversification, while a low correlation represents a high degree of diversification. In this work, three algorithms developed to solve the portfolio problem are presented. These algorithms used the Sharpe Ratio as the main metric to solve the problem of the aforementioned two objectives into only one objective: maximization of the Sharpe Ratio. The first, GENPO, used a Genetic Algorithm (GA). In contrast, the second and third algorithms, SAIPO and TAIPO used Simulated Annealing and Threshold Accepting algorithms, respectively. We tested these algorithms using datasets taken from the Mexican Stock Exchange. The findings were compared with other mathematical models of related works, and obtained the best results with the proposed algorithms.

Highlights

  • In finance, applying the diversification of assets that make up an investment portfolio aims to maximize profits and minimize risk

  • A new solution is accepted if it is better than the old solution; otherwise, the new solution is accepted with a probability based on the Boltzmann distribution; with this criterion, the acceptance rate of incorrect solutions decreases during the execution of the algorithm

  • The experiments performed with the algorithms presented in this paper, and the comparison with the hybrid algorithms described previously are shown

Read more

Summary

SAIPO-TAIPO and Genetic

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations

Introduction
Background & Related Works
Genetic Algorithms
Simulated Annealing and Threshold Accepting
1: Initialize niter and nsteps
Markowitz Model
Yu Model
Gilli Model
Masese Model
Proposed Algorithms
Mathematical Model for the Evaluation Function
Proposed Algorithms Hybridized with Related Models
Results
Experiments
Statistical Test
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call