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 条
  • [21] Novel heuristic and genetic algorithms for the VLSI test coverage problem
    Ibrahim, Walid
    El-Chouemi, Amr
    El-Sayed, Hesham
    2006 IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1-3, 2006, : 402 - +
  • [22] A comparison of genetic/memetic algorithms and other heuristic search techniques
    Areibi, S
    Moussa, M
    Abdullah, H
    IC-AI'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS I-III, 2001, : 660 - 666
  • [23] Heuristic rules and genetic algorithms for open shop scheduling problem
    Puente, J
    Díez, HR
    Varela, R
    Vela, CR
    Hidalgo, LP
    CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, 2004, 3040 : 394 - 403
  • [24] Comparing heuristic search methods and genetic algorithms for warehouse scheduling
    Whitley, LD
    Howe, AE
    Rana, S
    Watson, JP
    Barbulescu, L
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 2466 - 2471
  • [25] Genetic algorithms of structural fuzzy reliability index
    Hu, YC
    Li, XJ
    Zhang, LY
    CHINA OCEAN ENGINEERING, 1998, 12 (01) : 33 - 42
  • [26] Genetic Algorithms of Structural Fuzzy Reliability Index
    Hu Yunchang
    ChinaOceanEngineering, 1998, (01) : 33 - 42
  • [27] Viscosity index and classifications
    Holdmeyer, Dan
    Tribology and Lubrication Technology, 2023, 79 (03): : 46 - 47
  • [28] Genetic Algorithms Applied to Spectral Index Extraction
    Ordonez, Diego
    Dafonte, Carlos
    Manteiga, Minia
    Arcay, Bernardino
    COMPUTATIONAL INTELLIGENCE, 2011, 343 : 195 - +
  • [29] Rough mill component scheduling: Heuristic search versus genetic algorithms
    Siu, N
    Elghoneimy, E
    Wang, YL
    Gruver, WA
    Fleetwood, M
    Kotak, DB
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4226 - 4231
  • [30] Heuristic genetic algorithms for general capacitated lot-sizing problems
    Xie, JX
    Dong, JF
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2002, 44 (1-2) : 263 - 276