Metaheuristic Approach to Solve Portfolio Selection Problem

11/10/2022
by   Taylan Kabbani, et al.
0

In this paper, a heuristic method based on TabuSearch and TokenRing Search is being used in order to solve the Portfolio Optimization Problem. The seminal mean-variance model of Markowitz is being considered with the addition of cardinality and quantity constraints to better capture the dynamics of the trading procedure, the model becomes an NP-hard problem that can not be solved using an exact method. The combination of three different neighborhood relations is being explored with Tabu Search. In addition, a new constructive method for the initial solution is proposed. Finally, I show how the proposed techniques perform on public benchmarks

READ FULL TEXT
research
05/25/2022

Transitions from P to NP-hardness: the case of the Linear Ordering Problem

In this paper we evaluate how constructive heuristics degrade when a pro...
research
01/03/2005

Portfolio selection using neural networks

In this paper we apply a heuristic method based on artificial neural net...
research
04/16/2017

A Hybrid ACO Algorithm for the Next Release Problem

In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HA...
research
03/23/2022

Comparative Analysis of GPGPU based ACO and PSO Algorithm for Employee Scheduling Problems

Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) are ...
research
03/21/2017

On The Projection Operator to A Three-view Cardinality Constrained Set

The cardinality constraint is an intrinsic way to restrict the solution ...
research
04/07/2016

Solving Optimization Problems by the Public Goods Game

We introduce a method based on the Public Goods Game for solving optimiz...
research
09/15/2011

Neigborhood Selection in Variable Neighborhood Search

Variable neighborhood search (VNS) is a metaheuristic for solving optimi...

Please sign up or login with your details

Forgot password? Click here to reset