An Efficient Implementation of the Backtesting of Trading Strategies

  • Jiarui Ni
  • Chengqi Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3758)

Abstract

Some trading strategies are becoming more and more complicated and utilize a large amount of data, which makes the backtesting of these strategies very time consuming. This paper presents an efficient implementation of the backtesting of such a trading strategy using a parallel genetic algorithm (PGA) which is fine tuned based on thorough analysis of the trading strategy. The reuse of intermediate results is very important for such backtesting problems. Our implementation can perform the backtesting within a reasonable time range so that the tested trading strategy can be properly deployed in time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clark, D.E. (ed.): Evolutionary Algorithms in Molecular Design. Wiley-VCH, Weinheim (2000)Google Scholar
  2. 2.
    Metcalfe, T.S., Charbonneau, P.: Stellar structure modeling using a parallel genetic algorithm for objective global optimization. Journal of Computational Physics 185(1), 176–193 (2003)MATHCrossRefGoogle Scholar
  3. 3.
    Nowostawski, M., Poli, R.: Parallel genetic algorithm taxonomy. In: Proc. of 3rd Int. Conference on Knowledge-based Intelligent Information Engineering Systems (KES 1999), Adelaide, Australia (1999)Google Scholar
  4. 4.
    Stender, J.: Parallel Genetic Algorithms: Theory & Applications. IOS Press, Amsterdam (1993)MATHGoogle Scholar
  5. 5.
  6. 6.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jiarui Ni
    • 1
  • Chengqi Zhang
    • 1
  1. 1.Faculty of Information TechnologyUniversity of TechnologySydneyAustralia

Personalised recommendations