VNS Metaheuristics to Solve a Financial Portfolio Design Problem

Abstract

This chapter introduces a VNS-based local search for solving efficiently a financial portfolio design problem described in Chapter 1 and modeled in Chapter 3. The mathematical model tackled is a 0-1 quadratic model. It is well known that exact solving approaches on large instances of this kind of model are costly. The authors have proposed local search approaches to solve the problem, and the efficiency of this type of method has been proved. This chapter shows that the matricial 0-1 model of the problem enables specialized VNS algorithms by taking into account the particular structure of the financial problem considered. First experiments show that VNS with simulated annealing is effective on non-trivial instances of the problem.