A genetic algorithm for the UCITS-constrained index-tracking problem

O. Strub, N. Trautmann
{"title":"A genetic algorithm for the UCITS-constrained index-tracking problem","authors":"O. Strub, N. Trautmann","doi":"10.1109/CEC.2017.7969394","DOIUrl":null,"url":null,"abstract":"We consider the problem of replicating the returns of a financial index as accurately as possible by selecting a subset of the assets that constitute the index and determining the portfolio weight of each selected asset subject to various constraints that are relevant in practice, including the UCITS III (Undertakings for Collective Investments in Transferable Securities) 5/10/40 concentration rule. For this problem, we present a genetic algorithm, in which the individuals correspond to subsets of the index constituents. The fitness of the individuals is determined by applying mixed-integer quadratic programming. Two main features of the presented genetic algorithm are novel. First, we use a representation of subsets which is the first that exhibits all of the four desirable properties feasibility, efficiency, locality, and heritability. The representation also allows to incorporate problem-specific knowledge in a very simple way. Second, to reduce the CPU time for the fitness evaluations, we first estimate the fitness of the individuals in an efficient way and then evaluate the fitness of promising individuals only. The results of a computational experiment based on real-world data demonstrate that in particular for large instances, the presented genetic algorithm devises very good solutions in short CPU time.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2017.7969394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We consider the problem of replicating the returns of a financial index as accurately as possible by selecting a subset of the assets that constitute the index and determining the portfolio weight of each selected asset subject to various constraints that are relevant in practice, including the UCITS III (Undertakings for Collective Investments in Transferable Securities) 5/10/40 concentration rule. For this problem, we present a genetic algorithm, in which the individuals correspond to subsets of the index constituents. The fitness of the individuals is determined by applying mixed-integer quadratic programming. Two main features of the presented genetic algorithm are novel. First, we use a representation of subsets which is the first that exhibits all of the four desirable properties feasibility, efficiency, locality, and heritability. The representation also allows to incorporate problem-specific knowledge in a very simple way. Second, to reduce the CPU time for the fitness evaluations, we first estimate the fitness of the individuals in an efficient way and then evaluate the fitness of promising individuals only. The results of a computational experiment based on real-world data demonstrate that in particular for large instances, the presented genetic algorithm devises very good solutions in short CPU time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ucits约束下索引跟踪问题的遗传算法
我们考虑尽可能准确地复制金融指数回报的问题,方法是选择构成指数的资产子集,并根据实践中相关的各种约束,包括UCITS III(可转让证券集体投资承诺)5/10/40集中规则,确定每个选定资产的投资组合权重。对于这个问题,我们提出了一种遗传算法,其中个体对应于索引成分的子集。采用混合整数二次规划方法确定个体的适应度。本文提出的遗传算法有两个主要特点。首先,我们使用子集的表示,这是第一个展示所有四个理想属性的可行性,效率,局部性和遗传性。这种表示还允许以一种非常简单的方式合并特定于问题的知识。其次,为了减少适应度评估的CPU时间,我们首先以一种有效的方式估计个体的适应度,然后只评估有希望的个体的适应度。基于实际数据的计算实验结果表明,本文提出的遗传算法能够在较短的CPU时间内得到很好的解,特别是对于大型实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Knowledge-based particle swarm optimization for PID controller tuning Local Optima Networks of the Permutation Flowshop Scheduling Problem: Makespan vs. total flow time Information core optimization using Evolutionary Algorithm with Elite Population in recommender systems New heuristics for multi-objective worst-case optimization in evidence-based robust design Bus Routing for emergency evacuations: The case of the Great Fire of Valparaiso
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1