2020
DOI: 10.1016/j.swevo.2020.100662
|View full text |Cite
|
Sign up to set email alerts
|

An efficient hybrid metaheuristic algorithm for cardinality constrained portfolio optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(25 citation statements)
references
References 16 publications
0
25
0
Order By: Relevance
“…This model is similar to the classical formulation of Markowitz for investment portfolios, and is an optimization problem defined by Equation (20). This model aims to minimize the variance of the portfolio [22]; they use the classical Threshold Accepting algorithm [44].…”
Section: Masese Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…This model is similar to the classical formulation of Markowitz for investment portfolios, and is an optimization problem defined by Equation (20). This model aims to minimize the variance of the portfolio [22]; they use the classical Threshold Accepting algorithm [44].…”
Section: Masese Modelmentioning
confidence: 99%
“…On the other hand, the process behind the Gilli model [21] shown in Equations ( 18) and ( 19) is described in lines 9-14. Finally, the function of the Masese model [22], shown in Equation (20), is presented in lines 15-17. The remainder of the process is the same as in the GENPO algorithm.…”
Section: Hybrid Pseudocodesmentioning
confidence: 99%
See 1 more Smart Citation
“…As opined by Harrison et al [16], in the case of a defined set of projects, selecting and scheduling the optimum subset of projects are challenging issues recognized as nondeterministic polynomial time (NP)-Hard and addressed as project portfolio selection and scheduling problem. It was demonstrated by Kalayci et al [17] that an effective mixed metaheuristic algorithm blends the significant elements of an artificial bee colony (ABC), consistent optimization of an ant colony, and GAs to resolve the issue of cardinality restricted portfolio optimization. Escobar-Anel et al [18] prescribed two approaches: First, the optimization problem is reduced to an associate problem with constraints independent of wealth and a different utility function.…”
Section: Introductionmentioning
confidence: 99%
“…Arriaga and Valenzuela-Rendó, (2012) proposed a simple hill climbing algorithm called steepest ascent hill climbing algorithm which gave similar results as the complex evolutionary algorithm. Moreover, Kalayc et al (2020) present an efficient hybrid metaheuristic algorithm that combines critical components from continuous ant colony optimization, artificial bee colony optimization and genetic algorithms for solving cardinality constrained portfolio optimization problem. Other researchers who applied heuristic algorithms to deal with portfolio problem are (Aranha and Iba 2009;Maringer, 2008;Aranha and Iba 2008;Crama and Schyns, 2003;Schaerf, 2002;Gilli and Këllezi, 2000).…”
Section: Introductionmentioning
confidence: 99%