Polynomial goal programming and particle swarm optimization for enhanced indexation

被引:8
|
作者
Kaucic, Massimiliano [1 ]
Barbini, Fabrizio [2 ]
Verdu, Federico Julian Camerota [1 ]
机构
[1] Univ Trieste, Dept Econ Business Math & Stat, Piazzale Europa 1, I-34127 Trieste, Italy
[2] Generali Italia, Chief Investment Officer Dept, Via Marocchesa 14, I-31021 Mogliano Veneto, TV, Italy
关键词
Enhanced indexation; Cardinality; Turnover constraint; Polynomial goal programming; Particle swarm optimization; Constraint handling; PORTFOLIO OPTIMIZATION; TRACKING-ERROR; ALGORITHM; EVOLUTIONARY; INVESTORS; MODEL;
D O I
10.1007/s00500-019-04378-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Enhanced indexation is an investment strategy that aims to generate moderate and consistent excess returns with respect to a tracked benchmark index. In this work, we introduce an optimization approach where the risk of under-performing the benchmark is separated from the potential over-performance, and the Sharpe ratio measures the profitability of the active management. In addition, a cardinality constraint controls the number of active positions in the portfolio, while a turnover threshold limits the transaction costs. We adopt a polynomial goal programming approach to combine these objectives with the investor's preferences. An improved version of the particle swarm optimization algorithm with a novel constraint-handling mechanism is proposed to solve the optimization problem. A numerical example, where the Euro Stoxx 50 Index is used as the benchmark, shows that our method consistently produces larger returns, with reduced costs and risk exposition, than the standard indexing strategies over a 10-year backtesting period.
引用
收藏
页码:8535 / 8551
页数:17
相关论文
共 50 条
  • [1] Polynomial goal programming and particle swarm optimization for enhanced indexation
    Massimiliano Kaucic
    Fabrizio Barbini
    Federico Julian Camerota Verdù
    Soft Computing, 2020, 24 : 8535 - 8551
  • [2] Sequential linear programming and particle swarm optimization for the optimization of energy districts
    Riccietti, Elisa
    Bellavia, Stefania
    Sello, Stefano
    ENGINEERING OPTIMIZATION, 2019, 51 (01) : 84 - 100
  • [3] Enhanced comprehensive learning particle swarm optimization
    Yu, Xiang
    Zhang, Xueqing
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 242 : 265 - 276
  • [4] Hovering Swarm Particle Swarm Optimization
    Karim, Aasam Abdul
    Isa, Nor Ashidi Mat
    Lim, Wei Hong
    IEEE ACCESS, 2021, 9 (09): : 115719 - 115749
  • [5] Activity assigning of fourth party logistics by particle swarm optimization-based preemptive fuzzy integer goal programming
    Chen, Kuei-Hsien
    Su, Chwen-Tzeng
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (05) : 3630 - 3637
  • [6] Enhanced speciation in particle swarm optimization for multi-modal problems
    Cho, Huidae
    Kim, Dongkyun
    Olivera, Francisco
    Guikema, Seth D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (01) : 15 - 23
  • [7] A solution to bi/tri-level programming problems using particle swarm optimization
    Jialin, Han
    Guangquan, Zhang
    Yaoguang, Hu
    Jie, Lu
    INFORMATION SCIENCES, 2016, 370 : 519 - 537
  • [8] Particle swarm optimization approach to portfolio optimization
    Cura, Tunchan
    NONLINEAR ANALYSIS-REAL WORLD APPLICATIONS, 2009, 10 (04) : 2396 - 2406
  • [9] Dynamic programming integrated particle swarm optimization algorithm for reservoir operation
    Bilal
    Rani, Deepti
    Pant, Millie
    Jain, S. K.
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2020, 11 (02) : 515 - 529
  • [10] Design of Polynomial Function based Blind Equalizer using Particle Swarm Optimization
    Pydi, Sunil Kumar
    Majumder, Saikat
    2021 SIXTH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, SIGNAL PROCESSING AND NETWORKING (WISPNET), 2021, : 48 - 52