Skip to main content

Multi-step Ahead Forecasting Using Cartesian Genetic Programming

  • Chapter
  • First Online:
Inspired by Nature

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 28))

  • 758 Accesses

Abstract

This paper describes a forecasting method that is suitable for long range predictions. Forecasts are made by a calculating machine of which inputs are the actual data and the outputs are the forecasted values. The Cartesian Genetic Programming (CGP) algorithm finds the best performing machine out of a huge abundance of candidates via evolutionary strategy. The algorithm can cope with non-stationary highly multivariate data series, and can reveal hidden relationships among the input variables. Multiple experiments were devised by looking at several time series from different industries. Forecast results were analysed and compared using average Symmetric Mean Absolute Percentage Error (SMAPE) across all datasets. Overall, CGP achieved comparable to Support Vector Machine algorithm and performed better than Neural Networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Palit, A.K., Popovic, D.: Computational intelligence in time series forecasting: theory and engineering applications (advances in industrial control). Springer (2005)

    Google Scholar 

  2. Xiong, T., Bao, Y., Hu, Z.: Beyond one-step-ahead forecasting: evaluation of alternative multi-step-ahead forecasting models for crude oil prices. Energy Econ. 40, 405–415 (2013)

    Google Scholar 

  3. Andalib, A., Atrya, F.: Multi-step ahead forecasts for electricity prices using NARX: a new approach, a critical analysis of one-step ahead forecasts. Energy Convers. Manage. 50(3), 739–747 (2009)

    Google Scholar 

  4. Chang, F.J., Chiang Y.M., Chang, L.C.: Multi-step-ahead neural networks for flood forecasting. Hydrol. Sci. J. 52(1), 114–130 (2007)

    Google Scholar 

  5. Cortez, P.: Sensitivity analysis for time lag selection to forecast seasonal time series using neural networks and support vector machines. In: The 2010 International Joint Conference on Neural Networks (IJCNN) (2010)

    Google Scholar 

  6. Sorjamaa, A., Hao, J., Reyhani, N., Ji, Y., Lendasse, A.: Methodology for long-term prediction of time series. Neurocomputing 70(16–18), 2861–2869 (2007)

    Google Scholar 

  7. Al-Saba, T., El-Amin, I.: Artificial neural networks as applied to long-term demand forecasting. Artif. Intell. Eng. 13(2), 189–197 (1999)

    Google Scholar 

  8. Miller, J.F., Job, D., Vassilev, V.K.: Principles in the evolutionary design of digital circuits—part I. Genet. Program Evolvable Mach. 1(1), 7–35 (2000)

    Google Scholar 

  9. Gajda, Z., Sekanina, L.: Gate-level optimization of polymorphic circuits using Cartesian genetic programming. In: Evolutionary Computation (2009)

    Google Scholar 

  10. Walker, J.A., Liu, Y., Tempesti, G., Tyrrell, A.M.: Automatic code generation on a MOVE processor using Cartesian genetic programming. In: Evolvable Systems: From Biology to Hardware, pp. 238–249 (2010)

    Google Scholar 

  11. Miller, J.F.: Cartesian Genetic Programming. Springer, Berlin Heidelberg (2011)

    Google Scholar 

  12. Armstrong, J.S.: Long-Range Forecasting: From Crystal Ball to Computer. Wiley-Interscience (1985)

    Google Scholar 

  13. NIST, 1.3.5.11. Measures of Skewness and Kurtosis. http://www.itl.nist.gov/div898/handbook/eda/section3/eda35b.htm

  14. Hawkins, D.M., The problem of overfitting. J. Chem. Inf. Comput. Sci. pp. 1–12 (2004)

    Google Scholar 

  15. Taieba, S.B., Bontempia, G., Atiyac, A.F., Sorjamaab, A.: A review and comparison of strategies for multi-step ahead time series forecasting based on the NN5 forecasting competition. Expert Syst. Appl. 39(8), 7067–7083 (2012)

    Google Scholar 

  16. Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever I., Salakhutdinov, R.: Dropout: A simple way to prevent neural networks from overfitting, J Mach Learn Res 15, pp. 1929–1958, (2014)

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank the supporter of this work: Intel Corporation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tatiana Kalganova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Dzalbs, I., Kalganova, T. (2018). Multi-step Ahead Forecasting Using Cartesian Genetic Programming. In: Stepney, S., Adamatzky, A. (eds) Inspired by Nature. Emergence, Complexity and Computation, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-319-67997-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67997-6_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67996-9

  • Online ISBN: 978-3-319-67997-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics