Skip to main content
Log in

A hybrid rolling grey framework for short time series modelling

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Time series modelling is gaining spectacular popularity in the prediction process of decision making, with applications including real-world management and engineering. However, for short time series, prediction has to face unavoidable limitation for modelling extremely complex systems. It has to apply inadequate and incomplete data from short time to predict unknown observations. With such limited data source, existing techniques, such as statistical modelling or machine learning methods, fail to predict short time series effectively. To address this problem, this paper provides a global framework for short time series modelling predictions, integrating the rolling mechanism, grey model, and meta-heuristic optimization algorithms. In addition, dragonfly algorithm and whale optimization algorithm are investigated and deployed to optimize the framework by enhancing its predicting accuracy with less computational costs. To verify the performance of the proposed framework, three industrial cases are introduced as simulation experiments in this paper. Experimental results confirm that the framework solves corresponding short time series modelling predictions with greater accuracy and speed than the standard GM(1,1) models. The source codes of this framework are available at: https://github.com/zhesencui/HybridRollingGreyFramework.git.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Mudassir M, Bennbaia S, Unal D, Hammoudeh M (2020) Time-series forecasting of bitcoin prices using high-dimensional features: a machine learning approach. Neural Comput Appl 1–15

  2. Ping J, Ranran L, Lu H, Xiaobo Z (2020) Modeling of electricity demand forecast for power system. Neural Comput Appl 32(11):6857–6875

    Article  Google Scholar 

  3. Xin P, Wang SSJ, Robinson C, Li L, Wang Y-G, Barry DA (2014) Memory of past random wave conditions in submarine groundwater discharge. Geophys Res Lett 41(7):2401–2410

    Article  Google Scholar 

  4. Wang J, Yang W, Pei D, Niu T (2020) Outlier-robust hybrid electricity price forecasting model for electricity market management. J Clean Prod 249:119318

    Article  Google Scholar 

  5. Waheeb W, Ghazali R (2019) A novel error-output recurrent neural network model for time series forecasting. Neural Comput Appl 1–27

  6. Gocheva-Ilieva SG, Voynikova DS, Stoimenova MP, Ivanov AV, Iliev IP (2019) Regression trees modeling of time series for air pollution analysis and forecasting. Neural Comput Appl 31(12):9023–9039

    Article  Google Scholar 

  7. Wu J, Cui Z, Chen Y, Kong D, Wang Y-G (2019) A new hybrid model to predict the electrical load in five states of Australia. Energy 166:598–609

    Article  Google Scholar 

  8. Dudek G (2016) Pattern-based local linear regression models for short-term load forecasting. Electr Power Syst Res 130:139–147

    Article  Google Scholar 

  9. Bianco V, Manca O, Nardini S (2009) Electricity consumption forecasting in Italy using linear regression models. Energy 34(9):1413–1421

    Article  Google Scholar 

  10. Kocak C (2017) Arma (p, q) type high order fuzzy time series forecast method based on fuzzy logic relations. Appl Soft Comput 58:92–103

    Article  Google Scholar 

  11. Chu F-L (2009) Forecasting tourism demand with ARMA-based methods. Tour Manag 30(5):740–751

    Article  Google Scholar 

  12. Ozturk S, Ozturk F (2018) Forecasting energy consumption of Turkey by Arima model. J Asian Sci Res 8(2):52

    Google Scholar 

  13. Chen Z, Wang Y-G (2004) Efficient regression analysis with ranked-set sampling. Biometrics 60(4):997–1004

    Article  MathSciNet  MATH  Google Scholar 

  14. Chen Y, Peng X, Chu Y, Li W, Yuntao W, Ni L, Bao Y, Wang K (2017) Short-term electrical load forecasting using the support vector regression (SVR) model to calculate the demand response baseline for office buildings. Appl Energy 195:659–670

    Article  Google Scholar 

  15. Claveria O, Monte E, Torra S (2015) Tourism demand forecasting with neural network models: different ways of treating information. Int J Tour Res 17(5):492–500

    Article  Google Scholar 

  16. Ranjeeta Bisoi, Dash PK, Das Pragyan P (2020) Short-term electricity price forecasting and classification in smart grids using optimized multikernel extreme learning machine. Neural Comput Appl 32(5):1457–1480

    Article  Google Scholar 

  17. Qiu X, Ren Y, Suganthan PN, Amaratunga GAJ (2017) Empirical mode decomposition based ensemble deep learning for load demand time series forecasting. Appl Soft Comput 54:246–255

    Article  Google Scholar 

  18. Shi H, Minghao X, Li R (2017) Deep learning for household load forecasting-a novel pooling deep RNN. IEEE Trans Smart Grid 9(5):5271–5280

    Article  Google Scholar 

  19. Rahman MN, Esmailpour A, Zhao J (2016) Machine learning with big data an efficient electricity generation forecasting system. Big Data Res 5:9–15

    Article  Google Scholar 

  20. Li J, Wang R, Wang J, Li Y (2018) Analysis and forecasting of the oil consumption in China based on combination models optimized by artificial intelligence algorithms. Energy 144:243–264

    Article  Google Scholar 

  21. Deng J (1989) Introduction to grey system theory. J Grey Syst 1(1):1–24

    MathSciNet  MATH  Google Scholar 

  22. Duan H, Xiao X, Xiao Q (2020) An inertia grey discrete model and its application in short-term traffic flow prediction and state determination. Neural Comput Appl 32(12):8617–8633

    Article  Google Scholar 

  23. Wu L-F, Liu S-F, Cui W, Liu D-L, Yao T-X (2014) Non-homogenous discrete grey model with fractional-order accumulation. Neural Comput Appl 25(5):1215–1221

    Article  Google Scholar 

  24. Wu J, Ding Z (2020) Improved grey model by dragonfly algorithm for Chinese tourism demand forecasting. In: International conference on industrial, engineering and other applications of applied intelligent systems. Springer, pp 199–209

  25. Nguyen N-T, Tran T-T (2019) Optimizing mathematical parameters of grey system theory: an empirical forecasting case of Vietnamese tourism. Neural Comput Appl 31(2):1075–1089

    Article  Google Scholar 

  26. Lin C-S, Liou F-M, Huang C-P (2011) Grey forecasting model for CO2 emissions: a Taiwan study. Appl Energy 88(11):3816–3820

    Article  Google Scholar 

  27. Tan Y, Craig L, Wu M, Ochoa JJ (2015) Grey forecasting of construction demand in Hong Kong over the next ten years. Int J Construct Manag 15(3):219–228

    Article  Google Scholar 

  28. Miao C, Ding M (2017) Analysis of influence of natural disaster on the economy and prediction of recovery time based on grey forecasting-difference comparison model: a case study in the upper min river. Nat Hazards 85(2):1135–1150

    Article  Google Scholar 

  29. Zhao Z, Wang J, Zhao J, Su Z (2012) Using a grey model optimized by differential evolution algorithm to forecast the per capita annual net income of rural households in China. Omega 40(5):525–532

    Article  Google Scholar 

  30. Wu J, Wang Y-G, Burrage K, Tian Y-C, Lawson B, Ding Z (2020) An improved firefly algorithm for global continuous optimization problems. Expert Syst Appl 113340

  31. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  32. Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm. Adv Eng Softw 105:30–47

    Article  Google Scholar 

  33. Abualigah L, Shehab M, Alshinwan M, Alabool H (2019) Salp swarm algorithm: a comprehensive survey. Neural Comput Appl 1–21

  34. Mirjalili S, Hashim SZM (2010). A new hybrid psogsa algorithm for function optimization. In: 2010 International conference on computer and information application, pp 374–377

  35. Ding Z, Tian Y-C, Tang M, Li Y, Wang Y-G, Zhou C (2019) Profile-guided three-phase virtual resource management for energy efficiency of data centers. IEEE Trans Ind Electron 67(3):2460–2468

    Article  Google Scholar 

  36. Duan Q, Kroese DP (2016) Splitting for optimization. Comput Oper Res 73:119–131

    Article  MathSciNet  MATH  Google Scholar 

  37. Chang S-C, Lai H-C, Yu H-C (2005) A variable p value rolling grey forecasting model for Taiwan semiconductor industry production. Technol Forecast Soc Change 72(5):623–640

    Article  Google Scholar 

  38. Liu L, Wang Q, Wang J, Liu M (2016) A rolling grey model optimized by particle swarm optimization in economic prediction. Comput Intell 32(3):391–419

    Article  MathSciNet  Google Scholar 

  39. Xu N, Ding S, Gong Y, Bai J (2019) Forecasting Chinese greenhouse gas emissions from energy consumption using a novel grey rolling model. Energy 175:218–227

    Article  Google Scholar 

  40. Sun X, Sun W, Wang J, Zhang Y, Gao Y (2016) Using a Grey–Markov model optimized by cuckoo search algorithm to forecast the annual foreign tourist arrivals to China. Tour Manag 52:369–379

    Article  Google Scholar 

  41. Duan H, Lei GR, Shao K (2018) Forecasting crude oil consumption in China using a grey prediction model with an optimal fractional-order accumulating operator. Complexity 2018:1–12

    Article  MATH  Google Scholar 

  42. Yuan C, Zhu Y, Chen D, Liu S, Fang Z (2017) Using the GM (1, 1) model cluster to forecast global oil consumption. Theory Appl Grey Syst

  43. Wang J, Pei D, Haiyan L, Yang W, Niu T (2018) An improved grey model optimized by multi-objective ant lion optimization algorithm for annual electricity consumption forecasting. Appl Soft Comput 72:321–337

    Article  Google Scholar 

  44. Wang M, Luo Q, Kuang L, Zhu X (2019) Optimized rolling grey model for electricity consumption and power generation prediction of China. IAENG Int J Appl Math 49(4):1–11

    MathSciNet  Google Scholar 

  45. Deng J (1985) Grey control system. Printing House of Central China University of Science and Technology, Hubei

    MATH  Google Scholar 

  46. Wang X (2007) Grey prediction with rolling mechanism for electricity demand forecasting of Shanghai. In: 2007 IEEE international conference on grey systems and intelligent services. IEEE, pp 689–692

  47. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Article  Google Scholar 

  48. Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053–1073

    Article  MathSciNet  Google Scholar 

  49. Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33–57

    Article  Google Scholar 

  50. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471

    Article  MathSciNet  MATH  Google Scholar 

  51. Yang X-S, Deb S (2009). Cuckoo search via lévy flights. In: 2009 World congress on nature and biologically inspired computing (NaBIC). IEEE, pp 210–214

  52. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  53. Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1–24

    Article  Google Scholar 

  54. Meraihi Y, Ramdane-Cherif A, Acheli D, Mahseur M (2020) Dragonfly algorithm: a comprehensive review and applications. Neural Comput Appl

  55. Li R, Chen X, Balezentis T, Streimikiene D, Niu Z (2020). Multi-step least squares support vector machine modeling approach for forecasting short-term electricity demand with application. Neural Comput Appl 1–20

  56. Khelil K, Berrezzek F, Bouadjila T (2020) GA-based design of optimal discrete wavelet filters for efficient wind speed forecasting. Neural Comput Appl pp 1–14

  57. Vasiliy O, Victor N, Nataly Z, Dmitriy M (2020). Urban traffic flows forecasting by recurrent neural networks with spiral structures of layers. Neural Comput Appl 1–13

  58. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks, volume 4. IEEE, pp 1942–1948

Download references

Acknowledgements

This work was supported in part by the Natural Science Foundation of China [Grant No. 61773002], the Center of Collaborative Innovation for Educational Big Data Analysis and Application in Changzhi University 1331 project [Grant No. 020-200624], the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) [Grant No. CE140100049], Guangdong Basic and Applied Basic Research Foundation [Grant No. 2020A1515011580], and Provincial key platforms and major scientific research projects of Guangdong universities [Grant No. 2018GKTSCX010].

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jinran Wu or Zhe Ding.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

Below is the link to the electronic supplementary material.

Supplementary material 1 (tex 5 KB)

Appendices

Appendix 1: Whale optimization algorithm

The whale optimization algorithm (WOA) is a swarm intelligence optimization algorithm that simulates the hunting behavior of humpback whales in nature [47]. The algorithm has the characteristics of a simple structure, few parameters, a strong search ability, and easy implementation. The position of each whale represents a feasible solution in WOA. In the course of whale hunting, each whale has two behaviors. One is to surround the prey, and all the whales move toward the other whales; the other is the drum net, where the whale’s annular swimming sprays bubbles to drive away the prey. In the whale’s behavior of encircling its prey, whales choose whether to swim toward the optimal position of the whale or choose a whale as its own target and approach it randomly. Furthermore, three steps are presented to search for the optimization as follows: encircling prey, bubble-net attacking method of exploitation phase, and search for prey section of exploration phase.

Appendix 2: Dragonfly algorithm

The dragonfly algorithm (DA) was developed by [48], and the inspiration for DA comes from static and dynamic swarm behaviors. In static swarm, dragonflies fly in a small area with small groups to hunt other flying prey. In dynamic swarms, huge amounts of dragonflies create groups for migrating in one direction over long distances. Based on the behaviors of dragonflies, three principles of the dragonfly algorithm are proposed: (1) separation, which refers to the static collision avoidance between the individuals and other individuals in adjacent areas; (2) alignment, which indicates velocity matching of individuals to that of other individuals nearby; (3) cohesion, which means the trend of individuals toward the center of the mass of neighborhood; and (4) all individuals should be attracted toward food sources and distract enemies.

Appendix 3: Particle swarm optimization

Particle swarm optimization (PSO) was proposed by [58]. It is a swarm intelligence algorithm designed to simulate bird swarming predation behavior. There are different food sources in the region, and the point of bird swarm is to find the largest food sources (global optimal solution). Birds get to know the location of food source by transmitting the information of their respective positions to each other throughout the search process. Finally, the whole bird group can gather around the food source, which is the optimal solution.

The goal of the particle swarm algorithm is to enable all particles to find the optimal solution in multi-dimensional hyper-volume. First of all, initial random positions and initial random velocities are assigned to all particles in space. Then, the position of each particle is advanced according to the velocity of each particle, the optimal global position in the problem space, and the optimal position of the particle in turn. Particles aggregate around the best value by exploring and exploiting known positions in the search space. The advantage of the algorithm is that it retains the information of the optimal global position and the optimal position is known to the particles, which has a positive effect on both faster convergence speed and avoiding falling prematurely into the local optimal solution.

Appendix 4: Artificial bee colony

Artificial bee colony (ABC) is a swarm intelligence optimization algorithm proposed by [50]. Its intuitive background comes from the honey harvesting behavior of bee colonies. Bees carry out different activities based on their respective behaviors and labor in order to find the optimization results of the problem through sharing and communication of information. It provides a population-based search process in which individuals known as food locations are altered by artificial bees over time. The purpose of the bees is to discover the locations of food sources with the highest nectar amount. ABC combines local search measures performed by employed and bystander bees with global search measures actualized by bystanders and scouts, which contribute to balancing exploration and exploitation.

Appendix 5: Cuckoo search

A cuckoo search (CS) is a meta-heuristic optimization algorithm developed by [51]. It solves the parameter optimum problem through simulating the parasitic brood of some species of cuckoo (Brood Parasitism). Meanwhile, CS also uses the relevant Levy flight search mechanism rather than the more simple isotropic flight in order to obtain an optimal nest, which can achieve an efficient optimization mode. CS has three idealized rules: (1) Each cuckoo lays an egg each time and dumps it randomly into a selected nest; (2) the best nests with premium eggs will be brought to the next generation; (3) the number of available nests is fixed, and the host finds the eggs laid by the cuckoo via probability. Furthermore, the host can destroy the egg or discard the old nest to build a new one. CS has the advantages of having few parameters, simple operation, easy implementation, random search path optimization, and strong optimization ability.

Appendix 6: Grey wolf optimizer

Grey wolf optimizer (GWO) is a group intelligent optimization algorithm proposed by [52]. This algorithm is inspired by the prey activities of grey wolves and has the characteristics of strong convergence performance, few parameters, and easy implementation. It has been successfully applied in parameter optimization, image classification, and so on.

GWO has the following advantages: (1) The search method is unique, and all grey wolves rely on the optimal gray wolf to update its position, which means GWO has better global search performance; (2) GWO uses two parameters to balance exploration and exploitation, so it can obtain faster convergence speed and stronger local search ability; and (3) the fitness values are calculated after all gray wolf positions were updated, and the positions of \(\lambda\), \(\beta,\) and \(\delta\) are updated by greedy algorithm, which means the calculation can be done in parallel in order to achieve a higher speed of operation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cui, Z., Wu, J., Ding, Z. et al. A hybrid rolling grey framework for short time series modelling. Neural Comput & Applic 33, 11339–11353 (2021). https://doi.org/10.1007/s00521-020-05658-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-05658-0

Keywords

Navigation