Index fund selections with genetic algorithms and heuristic classifications

被引:20
|
作者
Orito, Y
Yamamoto, H
Yamazaki, G
机构
[1] Ashikaga Inst Technol, Ashikaga, Tochigi 3268558, Japan
[2] Tokyo Metropolitan Inst Technol, Hino, Tokyo 1910065, Japan
关键词
index fund; stock price index; heuristic classifications; genetic algorithms;
D O I
10.1016/S0360-8352(03)00020-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
It is well known that index fund selections are important for the risk hedge of investment in a stock market. The,selection' means that for 'futures', n companies of all ones in the market are selected. Suppose that we invest in c stocks of each selected company. The total return rate of a group of n companies, then, has to follow well the increasing rate of the stock price index in the market. We adopt the coefficient of determination (CDP) as the measure of fitness between the total return and increasing rates. The main purpose of this paper is to propose a simple method for the selections. The method consists of two steps. One is to select N companies in the market with heuristic approach. The other is to construct a group of n companies, say I-n,I-N, by applying genetic algorithms to the set of N companies. The method is applied to the 1st and 2nd Sections of Tokyo Stock Exchange. The results show the method gives a near optimal solution for the case of selecting n companies from all ones in the market. There is a set of N-0 companies such that the CDP of I-n,I-N depends a little on the N when N > N-0. This means that it is possible to construct an efficient I-n,I-N even when N is relatively small and hence n is small. The method especially works well when the increasing rate of stock price index over a period can be viewed as a linear time series data. (C) 2003 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:97 / 109
页数:13
相关论文
共 50 条
  • [1] Index fund selections with GAs and classifications based on turnover
    Orito, Y
    Motoyama, T
    Yamazaki, G
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XIV, PROCEEDINGS: COMPUTER SCIENCE, ENGINEERING AND APPLICATIONS, 2003, : 148 - 151
  • [2] Index Fund Optimization Using a Genetic Algorithm and a Heuristic Local Search
    Orito, Yukiko
    Inoguchi, Manabu
    Yamamoto, Hisashi
    ELECTRONICS AND COMMUNICATIONS IN JAPAN, 2010, 93 (10) : 42 - 52
  • [3] Evaluating the efficiency of index fund selections over the fund's future period
    Orito, Yukiko
    Takeda, Manabu
    Limura, Kiyoaki
    Yamazaki, Genji
    COMPUTATIONAL INTELLIGENCE IN ECONOMICS AND FINANCE, VOL II, 2007, : 157 - +
  • [4] Evaluating efficiency of index fund selections over the fund's future period
    Orito, Y
    Takeda, M
    Iimura, K
    Yamazaki, G
    Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, 2005, : 1154 - 1157
  • [5] Index fund optimization using a genetic algorithm and a heuristic local search algorithm on scatter diagrams
    Orito, Y.
    Yamamoto, H.
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 2562 - +
  • [6] Optimising decision classifications using genetic algorithms
    Crockett, KA
    Bandar, Z
    Al-Attar, A
    ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS, 1999, : 191 - 195
  • [7] Optimising a Targeted Fund of Strategies using Genetic Algorithms
    Hurwitz, Evan
    Marwala, Tshilidzi
    PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 2139 - 2143
  • [8] WHEN IS AN INDEX FUND NOT AN INDEX FUND
    HAWTHORNE, F
    INSTITUTIONAL INVESTOR, 1984, 18 (05): : 73 - &
  • [9] Dynamic Index Fund Optimization by a Heuristic GA Method Based on Correlation Coefficients
    Orito, Yukiko
    Yamamoto, Hisashi
    Tsujimura, Yasuhiro
    Kambayashi, Yasushi
    NEW ADVANCES IN INTELLIGENT DECISION TECHNOLOGIES, 2009, 199 : 575 - +
  • [10] Solving timetabling problem using genetic and heuristic algorithms
    Thanh, Nguyen Duc
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 472 - 477