Abstract

The grey forecasting model has been successfully applied in numerous fields since it was proposed. The nonhomogeneous discrete grey model (NDGM) was approximately constructed based on the nonhomogeneous index trend; it increased the applicability of discrete grey model. However, the NDGM required accurate data and better effect when the original data did not meet the conditions and fitting and prediction errors were larger. For this, the NDGM with the fractional order accumulating operator (abbreviated as ) has higher performance. In this paper, the matrix perturbation bound of the parameters was used to analyze the stability of and the can decrease the disturbance bound. Subsequently, the parameter estimation method of was studied and the Particle Swarm Optimization algorithm was employed to optimize the order number of and some steps were provided. In addition, the results of two practical examples demonstrated that the perturbation of was smaller than that of NDGM and provided remarkable predication performance compared with the traditional NDGM model and DGM model.

1. Introduction

Forecasting the future values of time series data plays a very important role in our research; thus, many forecasting methods have been developed for many years, such as the Rough sets theory proposed by Pawlak (see [1, 2]) and fuzzy mathematics proposed by Zadeh (see [3]). However, because of limited knowledge and information, only part of system structure could be fully known. To address this problem, professor Deng proposed grey forecasting models to catch the system development tendency [4, 5].

As a core model of grey prediction, GM (1, 1) model has been widely used in some fields such as transportation, agriculture, economy, and management [6–10]. Meanwhile, many scholars have improved the GM (1, 1) model a lot [11–19], thus enhancing its simulative accuracy and predictive accuracy. However, during the processes of both practical application and theoretical research of the GM (1, 1) model, GM (1, 1) model directly jumped from discrete form to continuous form, which resulted in failing in completely fitting homogeneous exponential sequence in simulation and prediction. Then the discrete grey model [20] was put forward to solve the transformation from discrete to continuous GM (1, 1) model. However, GM (1, 1) model and DGM model were constructed based on a hypothesis that the original data sequence was a homogeneous index sequence. However, the fact was not consistent, and the most original data sequence was the nonhomogeneous index sequence.

Hence, Xie and Liu [21] come up with nonhomogeneous discrete grey model (NDGM), and the model was constructed based on the approximate nonhomogeneous index trend. The results indicate there is no error between original value and simulative value based on pure nonhomogeneous index sequence. And NDGM model was the extension of DGM model while the latter was the special case of the former. NDGM model increased the applicability of discrete grey model. According to improve simulation and prediction accuracies, there were some the results [22, 23] of nonhomogeneous discrete grey model. However, these models had a higher requirement for data; when the data did not meet the requirements, the errors of both model-fitting and prediction were larger. The actual value cannot always meet the definition of monotonic increasing (decreasing) concave (convex) function. So the original data were accumulated to increase the exponent law according to the classical grey modeling mechanism. However, the accumulation of integer order was not suitable for some data, as modeling, and the effects of simulation and prediction were poor. Nevertheless, the current fraction grey model which used factional order accumulation [24–27] has the important significance for improving the performance of grey model.

Therefore, Wu et al. [28] defined the actual data with fractional order accumulation and defined the NDGM model with fractional order accumulation (). But they only presented the algorithm of model and some random fractional order values without considering the initial value of the model and presenting the nature of model. When a system was studied, the stability must be considered. They did not study the stability of the model; hence, the parameters of matrix perturbation bound were used to analyze the stability of model; then it was concluded that the solution of the model perturbation bound of solution was smaller than that of NDGM model. When , the solution of model perturbation bound of solution was smaller and could decrease the disturbance bound. And they did not conclude which order number was the best as well as how to obtain the best order number and other properties. In order to solve these issues, the parameter estimation method of was studied. Furthermore, the Particle Swarm Optimization algorithm was employed to optimize the order number of the model and obtained the better simulation and prediction results. Finally, the results from previous works demonstrated that the perturbation bound solution of that model was smaller than traditional NDGM model in Case 1, and the results the Case 2 practical demonstrated that provided better predication performance than the traditional NDGM model and DGM model.

This paper is organized as follows. In Section 2, we introduced the NDGM model with integer order accumulating operator and the model. In Section 3, the stability of the model was discussed. In Section 4, the Particle Swarm Optimization algorithm was employed to optimize the order number of model; some steps were provided. Finally, in Section 5, the paper was concluded.

2. NDGM Model with Fractional Order Accumulating Operator

Definition 1 (see [29]). Assume that the sequenceis an original data sequence, and the symbol represents a kind of mathematical operational method. When is applied once on the sequence , we have thatis the accumulated generation sequence of , where Then is called the first-order accumulating generation operator of , denoted by 1-AGO. If is applied times on , we obtain where Then is called the -order accumulating generation operator of , denoted by -AGO.
Accordingly, the inverse accumulating generation operator is the inverse operation of the accumulating generation process and plays a role in recovery from the acts of accumulating operators; the inverse accumulating operator is defined as follows:where In Definition 1, the order , and we call the two operators accumulating and inverse accumulating generation operators with integer order.
The sequence is the mean sequence of , where

Definition 2 (see [29]). The equation is called a model, where , The whitenization equation of model is solved to obtain

Definition 3 (see [20]). The sequences and are defined as (1) and (2). Then the equation is called discrete grey model (DGM). Similar with GM (1, 1) model, and are the parameters of DGM model. The equation is called the recursive function of DGM model.

Definition 4 (see [21]). The sequences and are defined as (1) and (2). Then the equation is called nonhomogenous discrete grey model (NDGM). is the simulative value of and is the iterative value of the NDGM model. , , , and are parameters of NDGM model. The equation is called the recursive function of DGM model.

Definition 5. Let the order accumulated generating operator of the original nonhomogeneous index sequence be . Let , ; then , , where order inverse accumulated generating operator of is

Definition 6 (see [28]). Assume thatis established.
The sequences and are defined as (2) and (18). Then (18) is called nonhomogenous discrete grey model with fractional order accumulation (abbreviated as model). is the simulative value of and is the iterative value of the NDGM model. , , , and are parameters of model.

That is least square method. So we can get the expressions of parameters in Proposition 7.

Proposition 7. Based on the least square method the first level parameters , , and satisfy the matrix equationwhere

Proposition 8. The recursive function of model is

Proof. By Definition 6, we have We use the least square method to calculate the value of parameter . By minimizing the error of and , . We can construct a nonrestraint optimized model; then where .

3. The Stability of the Solution of NDGM Model with Fractional Order Accumulation

3.1. The Stability of Model

In order to illustrate the stability of the model, the theorem related to the matrix perturbation analysis was introduced as follows.

Lemma 9 (see [29]). Let , , , and . Suppose and satisfy and . If and , where is the pseudo-inverse of matrix , then where , , and are the tolerance norm and , , and .

Theorem 10. For the model of original data based on nonhomogeneous index sequence, if the rth data is disturbed, that is, , , based on the least square method , let be a solution of the Lemma 9; then the perturbation bound is and where , and when , then where mathematical notation is the same as Lemma 9.

Proof. If is regarded as a disturbance of , then thus, we have Because is maximum of eigenvalue, then By Lemma 9 and based on the least square method , is the disturbed solution of equation , and we have When , then According to the proof of , we have According to this rule, if is regarded as a disturbance of , , both and changed; thus, If is regarded as a disturbance of , we have When , let be the perturbation bound of the NDGM model. By Theorem 10, we have

Obviously, and are all positive and increasing function of ; other variables are not changed. Therefore, perturbation bounds and are the increasing function of the effect of sample size ; that is, and will change large when . When is a constant value, is lager; then is lager too. When , we have , . When the perturbation bound of solution was large, the perturbation was not always large. This was because the perturbation cannot exceed the perturbation bound. Hence, from the perspective of the size of perturbation bound, when , , the disturbed solution of the model is lower. The model is more stable than NDGM model.

3.2. Verification of the Stability Model

In this section, the effectiveness of the model is verified by two real cases study. Mean absolute percentage error (MAPE) compares the real and forecasted values to evaluate the precision. MAPE is defined as , where is the actual value at time , and is the predicted value for time .

Case 1 (syphilis incidence predicted in China [30]). The trends of syphilis incidence in China forecasting example [31] compare the precision; the historical incidence of China from 2000 to 2008 was employed as the model-fitting. Then the actual values of 2009 and 2010 were predicted. The model, NDGM model, and a classical GM(1, 1) model were built, respectively, to simulate the trends of syphilis incidence in China. The simulated/forecasted values and absolute percentage error with different grey models were shown in Table 1.

As can be seen from Table 1, from a short-term forecasting viewpoint, obtained lower MAPE than the GM(1, 1) model, which implied that the could significantly enhance the precision of grey forecasting model. Moreover, obtained lower MAPE than the ; therefore, it was also shown that the perturbation bound was smaller and the prediction accuracy was higher. According to Table 1, a scatter broken-line figure regarding the simulated and forecasted data was shown in Figure 1.

Figure 1 showed that the whole performances of the four models for simulating and forecasting the trends of syphilis incidence in China. Obviously, the prediction effect of GM(1, 1) model was better than that of NDGM model, but the simulation and prediction precisions of other NDGM models were better than those of GM(1, 1) model. For NDGM model, the simulation and prediction precisions of were the best, followed by , but those of NDGM model of integer order were the worst. Moreover, for the NDGM model of fractional order, the simulation, and prediction precisions of smaller fraction were higher than those of bigger one. In addition, Theorem 10 can also be proved to be correct from the stability of system. Namely, the smaller the perturbation order was, the higher the system stability was, and the higher the precisions of simulation and prediction were.

4. Optimizing the Order Number of the Model by Particle Swarm Optimization (PSO) Algorithm

4.1. Model Steps

We have discussed the model and the main steps of modeling; the steps were as follows.

Step 1. Calculation of the order accumulation sequence

Step 2. Put , into (19); then use the least squares estimate parameter of , , and .

Step 3. Using then we will predict

Step 4. Assume that , is the fractional order accumulation sequence and the equationis established.

4.2. Optimizing the Order Number of the Model by Particle Swarm Optimization (PSO) Algorithm

The value of the mean absolute percentage error (MAPE) is often used to judge the merits of modeling. The order of the model is sought under the condition of the least mean absolute percent as follows: In this section, we will use the Particle Swarm Optimization (PSO) algorithm to optimize the order number of the model. The searing process of the optimization order of the model is as follows.

Step 1. Defining structure and initializing randomly the position (pBest) and speed for each particle, let .

Step 2. Set the first as the current position and as the optimal particle position in initial swarm.

Step 3. All the particles in the particle swarm were operated according to the following order:(1)Update the locations and speeds of particles; let , , and (2)Judge whether the particle location Present meets the scope; if beyond the scope, a new location should be set for Present. If within the scope, then the calculation continued according to the following steps. When , the average relative error of fractional order operator model, the concrete steps were as follows:(a)Computing , is the rth order accumulating generating sequence of .(b)Compute the mean generated sequence with consecutive neighbours of .(c)Compute the -order inverse accumulating generation sequence of .(d)Solve the parameters .(e)Deduce the time response expression of .(f)Compute the simulative values .(g)Compute the restored simulative values of .(h)Compute the MAPE .(i)Judge whether the value of is less than ; if , the new position is set to . If the () is not superior to , the new position is set to .

Step 4. Step was carried out according to the order from the second particle to the last one.

Step 5. Judging whether the algorithm meets the convergence rule, if it meets then go to Step ; else go to Step .

Step 6. Output Best “,” which is the optimal value of the order outputting the simulated or forecasted values of the model, when .

According to the modeling mechanism of the proposed model and the Particle Swarm Optimization (PSO) algorithm of the order number, the flowchart of the new model is summarized in Figure 2.

4.3. Verification of Model

Case 2 (logistics demand forecasting in Jiangsu province [30]). We consider an example from paper [30] which provides the sample data. We will build four models that simulate Jiangsu province’s logistics demand from 2002 to 2006 and to forecast it from 2007 to 2009. We will compare the simulation and prediction mean absolute percentage error of the model with a classical NDGM model and DGM model.
According to MATLAB programs of the model and Particle Swarm Optimization (PSO) algorithm, the optimal order of the is . The simulated/forecasted values and mean absolute percentage error with the four different grey models are shown in Table 2.

According to Table 2, in order to show the performances of four models clearly, we can draw Figures 3(a), 3(b), and 3(c).

As can be seen from Figures 3(a)–3(c), obviously, both of the simulation and prediction performance of the grey model with the optimal fractional order were superior to those of the corresponding grey model with an integer order. This showed that the fractional order accumulating generation could really improve the performance of a grey prediction model. It was shown that the improved effect of the fractional order on grey prediction model was also influenced by the raw model. Moreover, we can rank the effect of three models from the worst to the best in terms of their abilities to fit the data, namely, DGM model, NDGM model, and model.

5. Conclusion

When some systems were studied, the stability must be considered. The grey theory model mainly deals with the incomplete information cases and the uncertainty of the system models. From the perspective of model stability, model is more stable than traditional NDGM, and it was the result of a case to explain the stability. Because GM(1, 1) model, DGM(1, 1) model, and NDGM model had a higher requirement for data and when the data did not meet the requirements, the errors of both simulation and prediction were larger, and the model has the important significance for improving the performance of grey model. Furthermore, we provided the Particle Swarm Optimization algorithm which was employed to optimize the order number of model. Using a case studied in Section 3, it has been shown that the MAPE of the model was always the lowest among the four grey models.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by National Natural Science Foundation of China (Grants nos. 71540027, 11671001, 71671135, and 51479151), Chongqing Frontier and Applied Basic Research Project (Grants nos. cstc2015jcyjA00034 and cstc2015jcyjA00015), and the Science and Technology Research Program of Chongqing Municipal Educational Committee (Grant no. KJ1600425), Chongqing University of Posts and Telecommunications’ Innovative Training Program (Grant no. 201610617088X).