Abstract
The use of mechanical trading systems allows managing a huge amount of data related to the factors affecting investment performance (macroeconomic variables, company information, industrial indicators, market variables, etc.) while avoiding the psychological reactions of traders when they invest in financial markets. When trading is executed in an intra-daily frequency instead a daily frequency, mechanical trading systems needs to be supported by very powerful engines since the amount of data to deal with grow while the response time required to support trades gets shorter. Numerous studies document the use of genetic algorithms (GAs) as the engine driving mechanical trading systems. The empirical insights provided in this paper demonstrate that the combine use of GA together with a GPU-CPU architecture speeds up enormously the power and search capacity of the GA for this kind of financial applications. Moreover, the parallelization allows us to implement and test previous GA approximations. Regarding the investment results, we can report 870% of profit for the S&P 500 companies in a 10-year time period (1996–2006), when the average profit of the S&P 500 in the same period was 273%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
These returns on historical data cannot be taken as a guaranty of future similar returns when using new data, since the rules implemented by the trading systems can suffer from over-fitting.
References
Allen F, Karjalainen R (1999) Using genetic algorithms to find technical trading rules. J Financ Econ 51(2):245–271
Bali T, Demirtas O, Tehranian H (2008) Aggregate earnings, firm-level earnings, and expected stock returns. JFQA 43(3):657–684
Banzhaf W, Harding S, Langdon WB, Wilson G (2009) Accelerating genetic programming through graphics processing units. In: Genetic programming theory and practice, vol VI. Springer, Berlin, pp 1–19
Basu S (1977) The investment performance of common stocks in relation to their price-earnings ratios: a test of the efficient market hypothesis. J Finance 32:663–682
Campbell JY, Yogo M (2006) Efficient tests of stock return predictability. J Financ Econ 81:27–60
Cantú-Paz E (2000) Efficient and accurate parallel genetic algorithms. Kluwer, Norwell
Chan L, Hamao Y, Lakonishok R (1991) Fundamentals and stock returns in Japan. J Finance 46(5):1739–1764
Fama E, French (1992) The cross-section of expected stock returns. J Finance 47(2):427–465
Fama EF, French KR (1989) Business conditions and expected returns on stocks and bonds. J Financ Econ 25:23–49
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1st edn. Addison-Wesley Longman Publishing Co., Boston
Jiang Y, Núñez L (2009) Efficient market hypothesis or adaptive market hypothesis? A test with the combination of technical and fundamental analysis. In: Proceedings of the 15th international conference. Computing in Economics and Finance, University of Technology, Sydney, Australia., The Society for Computational Economics
Kräger F, Maitre O, Jimúnez S, Baumes A, Collet P (2010) Speedups between 70 and 120 for a generic local search (memetic) algorithm on a single gpgpu chip. In: EvoApplications (1), pp 501–511
Langdon WB (2009) A fast high quality pseudo random number generator for nvidia cuda. In: Proceedings of the 11th annual conference companion on genetic and evolutionary computation conference: late breaking papers. ACM, New York, GECCO’09, pp 2511–2514
Maitre O, Baumes L, Lachiche N, Corma A, Collet P (2009) Coarse grain parallelization of evolutionary algorithms on gpgpu cards with easea. In: Proceedings of the 11th annual conference on genetic and evolutionary computation. ACM, New York, GECCO ’09, pp 1403–1410
Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9:193–212
Munawar A, Wahib M, Munetomo M, Akama K (2009) Hybrid of genetic algorithm and local search to solve max-sat problem using nvidia cuda framework. Genet Program Evolv Mach 10:391–415
Núñez L (2002) Trading systems designed by genetic algorithms. Manag Finance 28:87–106
Núñez L (2007) Fitting the control parameters of a genetic algorithm: an application to technical trading systems design. Eur J Oper Res 179:847–868
Núñez L, Pacheco J, Casado S (2011) Applying genetic algorithms to wall street. Int J Data Mining Model Manag (in press)
Pospichal P, Jaros J, Schwarz J (2010) Parallel genetic algorithm on the cuda architecture. In: EvoApplications (1), pp 442–451
Reinganum M (1988) Selecting superior securities charlottesville. the tesearch foundation of the institute of chartered financial analysts, Technical report. The Tesearch foundation of the institute of Chartered Financial Analysts
Ritter JR (2003) Behavioral finance. Pac Basin Finance J 11(4):429–437
Zhang S, He Z (2009) Implementation of parallel genetic algorithm based on cuda. In: Proceedings of the 4th international symposium on advances in computation and intelligence, ISICA ’09. Springer, Berlin, pp 24–30
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Contreras, I., Jiang, Y., Hidalgo, J.I. et al. Using a GPU-CPU architecture to speed up a GA-based real-time system for trading the stock market. Soft Comput 16, 203–215 (2012). https://doi.org/10.1007/s00500-011-0714-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-011-0714-3