Bi-objective portfolio optimization for minimizing risk and maximizing expected return has received considerable attention using evolutionary algorithms. Although the problem is a quadratic programming (QP) problem, the practicalities of investment often make the decision variables discontinuous and introduce other complexities. In such circumstances, usual QP solution methodologies can not always find acceptable solutions. In this paper, we modify a bi-objective evolutionary algorithm (NSGA-II) to develop a customized hybrid NSGA-II procedure for handling situations that are non-conventional for classical QP approaches. By considering large-scale problems, we demonstrate how evolutionary algorithms enable the proposed procedure to find fronts, or portions of fronts, that can be difficult for other methods to obtain. © 2011 Springer-Verlag.
CITATION STYLE
Deb, K., Steuer, R. E., Tewari, R., & Tewari, R. (2011). Bi-objective portfolio optimization using a customized hybrid NSGA-II procedure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6576 LNCS, pp. 358–373). https://doi.org/10.1007/978-3-642-19893-9_25
Mendeley helps you to discover research relevant for your work.