On the performance and convergence properties of hybrid intelligent schemes: Application on portfolio optimization domain

Abstract

Hybrid intelligent algorithms, especially those who combine nature-inspired techniques, are well known for their searching abilities in complex problem domains and their performance. One of their main characteristic is that they manage to escape getting trapped in local optima. In this study, two hybrid intelligent schemes are compared both in terms of performance and convergence ability in a complex financial problem. Particularly, both algorithms use a type of genetic algorithm for asset selection and they differ on the technique applied for weight optimization: the first hybrid uses a numerical function optimization method, while the second one uses a continuous ant colony optimization algorithm. Results indicate that there is great potential in combining characteristics of nature-inspired algorithms in order to solve NP-hard optimization problems. © 2011 Springer-Verlag.