کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
480336 1446096 2011 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Heuristic algorithms for the cardinality constrained efficient frontier
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Heuristic algorithms for the cardinality constrained efficient frontier
چکیده انگلیسی

This paper examines the application of genetic algorithm, tabu search and simulated annealing metaheuristic approaches to finding the cardinality constrained efficient frontier that arises in financial portfolio optimisation. We consider the mean–variance model of Markowitz as extended to include the discrete restrictions of buy-in thresholds and cardinality constraints. Computational results are reported for publicly available data sets drawn from seven major market indices involving up to 1318 assets. Our results are compared with previous results given in the literature illustrating the effectiveness of the proposed metaheuristics in terms of solution quality and computation time.


► Finding the cardinality constrained efficient frontier in portfolio optimisation.
► Metaheuristic algorithms are used.
► Good quality results are achieved.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 213, Issue 3, 16 September 2011, Pages 538–550
نویسندگان
, , ,