You are on page 1of 9

# Hindawi Publishing Corporation

## Mathematical Problems in Engineering

Volume 2015, Article ID 231765, 8 pages
http://dx.doi.org/10.1155/2015/231765

Research Article
Short-Term Power Load Point Prediction Based on the Sharp
Degree and Chaotic RBF Neural Network

## Dongxiao Niu, Yan Lu, Xiaomin Xu, and Bingjie Li

School of Economics and Management, North China Electric Power University, Beijing 102206, China

## Academic Editor: Dan Simon

Copyright © 2015 Dongxiao Niu et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

In order to realize the predicting and positioning of short-term load inflection point, this paper made reference to related research
in the field of computer image recognition. It got a load sharp degree sequence by the transformation of the original load sequence
based on the algorithm of sharp degree. Then this paper designed a forecasting model based on the chaos theory and RBF neural
network. It predicted the load sharp degree sequence based on the forecasting model to realize the positioning of short-term load
inflection point. Finally, in the empirical example analysis, this paper predicted the daily load point of a region using the actual
load data of the certain region to verify the effectiveness and applicability of this method. Prediction results showed that most of
the test sample load points could be accurately predicted.

## 1. Introduction Markov chain models. Literature  studied the short-term

load forecasting based on the wavelet transform and grey
Short-term load forecasting (STLF) plays a key role in model improved by PSO. Literature  proposed a relevance
power dispatching work. It is the foundation of power vector machine short-term load forecasting model based on
grid planning, grid control, system safety analysis, and the nonnegative matrix decomposition.
economic operation. The forecasting accuracy is closely On the whole, research on short-term load forecasting
related to the grid running safety and economy [1, 2]. At has been relatively mature. The models are more complicated
present, many scholars and experts have already done a lot and intelligent. Combination forecasting model is a research
of theoretical researches and practical simulations on short- trend . Inflection point is usually the most concern of
term load forecasting [3–20]. More common short-term load the dispatch staff in short-term load forecasting. How to
forecasting models include regression prediction model , identify and predict inflection point of short-term load is a
time series prediction model , artificial neural network challenge problem. At present, there is no mature solution to
prediction model , fuzzy logic and expert system [6, 7], the short-term load forecasting of inflection point. This paper
the wavelet analysis model , chaos theory , and com- gets a load sharp degree sequence by the transformation of
bination prediction model [10–12]. Literature  analyzed the original load sequence based on the algorithm of sharp
the power factors and predicted the short-term load based degree. Then, it forecasts the load sharp degree sequence by
on rough set method. Literature [14, 15] introduced data designing and training the forecasting model of chaotic RBF
mining techniques for short-term load forecasting. Literature neural network to realize the short-term load forecasting of
 proposed a novel combination prediction model for inflection point.
short-term load forecasting which mainly studied the weight
of combination prediction model with different scenarios. 2. Inflection Point Identification Algorithm
Literature  established a combination of modified firefly Based on Sharp Degree
algorithm and support vector regression model which was
used for the STLF. Literature  studied the short-term Inflection point is the most important features of load
forecasting of categorical changes in wind power based on curve. The inflection point in this paper is the point that
2 Mathematical Problems in Engineering

## Pi Therefore, in a very small load curve, the variable sharp can

be defined as sharp degree of 𝛼
a
󵄨󵄨 󵄨
󵄨𝑃 𝑃𝑖+𝑘 󵄨󵄨󵄨
sharp = 1 − ang = 1 − 󵄨󵄨 󵄨 𝑖−𝑘 󵄨 󵄨 󵄨. (5)
󵄨󵄨𝑃𝑖 𝑃𝑖−𝑘 󵄨󵄨󵄨 + 󵄨󵄨󵄨𝑃𝑖 𝑃𝑖+𝑘 󵄨󵄨󵄨
Pi−k Pi+k The larger the value of sharp, the smaller the value of 𝛼, and
the curve would be more sharp. On the contrary, the curve
would be more smooth. Because of the continuity of load,
O the identification of inflection point is closely related to the
interval of load curve sequence and the set threshold value.
Figure 1: Part outline figure of the load curve.
Therefore, the threshold value can be set according to the load
curve characteristics and actual situation. If sharp (𝑃𝑖 ) > 𝑇,
the 𝑃𝑖 can be regarded as inflection point.
changes the direction of load curve upward or downward in
a certain time interval. This paper identifies the inflection
point according to the sharp degree of each point on the load
3. Prediction Model Based on
curve. Set the function of load curve as 𝑃 = 𝑝(𝑡), in which Chaotic RBF Neural Network
the independent variable 𝑡 means time and the dependent
Artificial neural network is a common type of load fore-
variable 𝑃 represents the load time series.
casting methods. This method is highly intelligent which
Randomly select a point 𝑃𝑖 on the curve as the center. 𝑃𝑖−𝑘
has strong ability to look for patterns . Radical basis
is the point in front of 𝑃𝑖 a distance of 𝑘. And 𝑃𝑖+𝑘 is the point
function (RBF) neural network is a kind of highly efficient
behind 𝑃𝑖 a distance of 𝑘.
feed-forward neural network. It has the best approximation
Define the vector 𝑘:
performance and global optimal property. And the structure
𝑎𝑖𝑘 = (𝑇 (𝑖) − 𝑇 (𝑖 + 𝑘) , 𝑃 (𝑖) − 𝑃 (𝑖 + 𝑘)) , is simple; the training speed is fast . Chaos prediction
algorithm applied to power load is a very hot research field
𝑏𝑖𝑘 = (𝑇 (𝑖) − 𝑇 (𝑖 − 𝑘) , 𝑃 (𝑖) − 𝑃 (𝑖 − 𝑘)) , (1) which is caused by the intrinsic characteristics of systems.
It can be predicted in the short term . It predicts
𝑐𝑖𝑘 = (𝑇 (𝑖 − 𝑘) − 𝑇 (𝑖 + 𝑘) , 𝑃 (𝑖 − 𝑘) − 𝑃 (𝑖 + 𝑘)) . directly according to the laws of the objective extracting data
sequence itself and does not need to establish the mapping
Define 𝛼, the angle of 𝑎𝑖𝑘 and 𝑏𝑖𝑘 , as the angle consisting relation model of influence factors. In theory, it not only
of 𝑃𝑖−𝑘 , 𝑃𝑖 , and 𝑃𝑖+𝑘 on the load curve. Figure 1 shows the can decrease the cost of prediction, but can improve the
part outline figure of the load curve. The peripheral solid prediction accuracy as well . The method combining
line is composed of load time series. The dotted line is the chaos and RBF neural network can make full use of the
circular arc fitted by 𝑃𝑖−𝑘 , 𝑃𝑖 , and 𝑃𝑖+𝑘 . And 𝑂 is the center of randomicity and initial value sensitivity of chaos. In addition,
circular arc. Usually, the value of 𝑘 is set in the range of 3– it can make full use of the function of RBF, such as massively
5. For the endpoint of load curve, we will take 3 to 5 sample parallel processing, self-organizing, and self-adapting .
values forward and backward on the sample load data. On the Although sharp degree sequence is turbulent, it can be
actual curve, the points 𝑃𝑖−𝑘 , 𝑃𝑖 , and 𝑃𝑖+𝑘 can be approximately used to identify the inflection point. Chaotic time series are
regarded as three points on the circular arc as the interval of similar to random noise which is chaotic and unpredictable.
the three points is very small . But its inherent nonlinear dynamics structure makes it
Assuming that |𝑃𝑖 𝑃𝑖−𝑘 | = |𝑃𝑖 𝑃𝑖+𝑘 |, then meet the short-term predictability . Use phase space
󵄨󵄨 󵄨 󵄨 󵄨 reconstruction to find the internal of regularity conversion
𝛼 󵄨󵄨𝑃𝑖−𝑘 𝑃𝑖+𝑘 󵄨󵄨󵄨 /2 󵄨󵄨󵄨𝑃𝑖−𝑘 𝑃𝑖+𝑘 󵄨󵄨󵄨 /2
sin ( ) = 󵄨󵄨 󵄨 = 󵄨󵄨 󵄨 sequences that can be described by a nonlinear mapping, and
2 󵄨󵄨𝑃𝑖 𝑃𝑖−𝑘 󵄨󵄨󵄨 󵄨󵄨𝑃𝑖 𝑃𝑖+𝑘 󵄨󵄨󵄨 then approximate the nonlinear mapping by applying radial
󵄨󵄨 󵄨 (2) basis to forecast the inflection point. The process of the model
󵄨𝑃 𝑃𝑖+𝑘 󵄨󵄨󵄨
= 󵄨󵄨 󵄨 𝑖−𝑘 󵄨 󵄨 󵄨. established in this paper is shown in Figure 2.
󵄨󵄨𝑃𝑖 𝑃𝑖−𝑘 󵄨󵄨󵄨 + 󵄨󵄨󵄨𝑃𝑖 𝑃𝑖+𝑘 󵄨󵄨󵄨 First of all, we can get the sharp degree sequence which
can identify the inflection point on the basis of Section 2.
In this function, 0 < 𝛼 ≤ 180. Then, reconstruct phase space and identify chaos based on
When 𝑃𝑖−𝑘 , 𝑃𝑖 , and 𝑃𝑖+𝑘 are in a straight line, 𝛼 = 180, then chaos theory. This paper selects mutual information method
󵄨󵄨 󵄨 to calculate delay time, Cao method to determine embedding
󵄨󵄨𝑃𝑖−𝑘 𝑃𝑖+𝑘 󵄨󵄨󵄨 𝛼 dimension, and the computing of largest Lyapunov exponent
󵄨󵄨 󵄨 󵄨 󵄨 = sin ( 2 ) = sin (90) = 1. (3)
󵄨󵄨𝑃𝑖 𝑃𝑖−𝑘 󵄨󵄨󵄨 + 󵄨󵄨󵄨𝑃𝑖 𝑃𝑖+𝑘 󵄨󵄨󵄨 to identify the chaos. Thirdly, the input layer of RBF neural
network can be determined based on the delay time and
When the value of 𝛼 decreases tending to zero, embedding dimension. Then, train the RBF neural network
󵄨󵄨 󵄨 and predict the sharp degree sequence making use of the
󵄨󵄨𝑃𝑖−𝑘 𝑃𝑖+𝑘 󵄨󵄨󵄨 𝛼 trained network. Finally, determine the threshold and posi-
󵄨󵄨 󵄨󵄨 󵄨󵄨 󵄨󵄨 = sin ( 2 ) = sin (0) = 0. (4)
󵄨󵄨𝑃𝑖 𝑃𝑖−𝑘 󵄨󵄨 + 󵄨󵄨𝑃𝑖 𝑃𝑖+𝑘 󵄨󵄨 tion the inflection point.
Mathematical Problems in Engineering 3

## Mutual Delay time

information
method calculated
Determine RBF neural Get the predicted Point
the input network train sharp degree
position
layer and predict sequence
Sharp Embedding
degree Cao method dimension
sequence determined

Computing the
Identify the
largest Lyapunov
chaos
index

## Figure 2: The steps of chaotic RBF neural network.

3.1. Phase Space Reconstruction and Chaos Identification. delay time 𝜏, 𝐼(𝜏). When the 𝐼(𝜏) meets the minimum for
Extend the time series to three-dimension or higher dimen- the first time, the lag time is the time delay of phase space
sion space by using delay-coordinate method to reconstruct reconstruction.
state space which can find information and rules contained
in the original time series. And by “Takens” theorem, the 3.1.2. Embedding Dimension Determined by Cao Method.
dynamic characteristic of attractor of the system can be There are some methods to determine embedding dimension,
restored in the sense of topological equivalence [29, 30]. such as the pseudo adjacent point method. G-P algorithm,
Assume that the time sequence is 𝑥1 , 𝑥2 , 𝑥3 , . . . , 𝑥𝑛 ; properly and C-C method. Cao algorithm is a mature method which
select embedding dimension 𝑚 and time delay 𝜏; the recon- was put forward by Cao Liangyue . When using Cao
structed phase space is as follows: method, firstly set a delay time, and the embedding dimen-
𝑇 sion and delay time are relatively independent . Define
𝑌1 = (𝑥1 , 𝑥1+𝜏 , . . . , 𝑥1+(𝑚−1)𝜏 ) ,
󵄩󵄩󵄩𝑋𝑖 (𝑚 + 1) − 𝑋𝑛(𝑖,𝑚) (𝑚 + 1)󵄩󵄩󵄩
𝑇
𝑌2 = (𝑥2 , 𝑥2+𝜏 , . . . , 𝑥2+(𝑚−1)𝜏 ) , 𝑎 (𝑖, 𝑚) = 󵄩 󵄩󵄩 󵄩
󵄩. (8)
󵄩󵄩𝑋𝑖 (𝑚) − 𝑋𝑛(𝑖,𝑚) (𝑚)󵄩󵄩󵄩
(6)
.. In the function, 𝑋𝑖 (𝑚+1) is a vector that 𝑖 is in a space of (𝑚+
.
1) dimensions, 𝑛(𝑖, 𝑚) is the integer that makes 𝑋𝑛(𝑖,𝑚) (𝑚) be
𝑌𝑁 = (𝑥𝑁, 𝑥𝑁+𝜏 , . . . , 𝑥𝑁+(𝑚−1)𝜏 ) ,
𝑇 the nearest neighbor domain of 𝑋𝑖 (𝑚) in the 𝑚-dimensional
reconstruction space. 𝑛(𝑖, 𝑚) depends on 𝑖 and 𝑚; and ‖ ∙ ‖
of which 𝑁 = 𝑛 − (𝑚 − 1) ∗ 𝜏 is the length of the vector means the Euclidean distance.
sequence. Define the average of all 𝑎(𝑖, 𝑚) as

1 𝑁−𝑚𝜏
3.1.1. Delay Time Calculated by Mutual Information Method. 𝐸 (𝑚) = ∑ 𝑎 (𝑖, 𝑚) . (9)
Mutual information method is a kind of commonly used 𝑁 − 𝑚𝜏 𝑖=1
methods to calculate delay time . It is suitable for large
Define the change of 𝑚 dimensional to 𝑚 + 1 dimensional as
data sets and nonlinear problem. Set offline random variables
𝑋, 𝑌. The mutual information 𝐼(𝑋, 𝑌) is as follows: 𝐸 (𝑚 + 1)
𝐸1 (𝑚) = . (10)
𝐼 (𝑋, 𝑌) = 𝐻 (𝑋) + 𝐻 (𝑌) − 𝐻 (𝑋, 𝑌) , 𝐸 (𝑚)

𝑞 (7) If the time series are generated by the chaotic attractor, when
𝐻 (𝑋) = ∑𝑃 (𝑥𝑖 ) log 𝑃 (𝑥𝑖 ) . 𝐸1(𝑚) saturated with the increases of 𝑚, the value of 𝑚 + 1
𝑖=1 is the minimum embedding dimension. Define 𝐸2(𝑚) to
distinguish deterministic chaotic signal and random signal:
In the functions, 𝑃(𝑥𝑖 ) is the probability of happening 𝑥𝑖 ,
𝑞 is the total number of possible things or states, and the 1 𝑁−𝑚𝜏 󵄨󵄨 󵄨
𝐸∗ (𝑚) = ∑ 󵄨𝑥 − 𝑥𝑛(𝑖,𝑚)+𝑚𝜏 󵄨󵄨󵄨 ,
logarithmic function often takes 2 for base number. 𝑁 − 𝑚𝜏 𝑖=1 󵄨 𝑖+𝑚𝜏
For the time series 𝑥𝑖 and delay time 𝜏 with an interval (11)
of 𝑛, set 𝑃(𝑥𝑖 ) as the probability of the 𝑥𝑖 in {𝑥𝑖 }, and 𝐸∗ (𝑚 + 1)
𝑃(𝑥𝑖+𝜏 ), the probability of 𝑥𝑖+𝜏 in {𝑥𝑖 }, can be calculated 𝐸2 (𝑚) = .
𝐸∗ (𝑚)
through the frequency in the corresponding time sequence,
and 𝑃(𝑥𝑖 , 𝑥𝑖+𝜏 ), the joint probability of common presence For the random sequence, to all of the values of 𝑚, the values
of 𝑥𝑖 and 𝑥𝑖+𝜏 in these two sequences, can be found in the of 𝐸2(𝑚) always equal about 1, while for the chaotic sequence,
corresponding grid on plane (𝑥𝑖 , 𝑥𝑖+𝜏 ). Therefore, the mutual the values of 𝐸2(𝑚) are related to values of 𝑚. Namely, values
information 𝐼(𝑥𝑖 , 𝑥𝑖+𝜏 ) can be regarded as the function of of 𝐸2(𝑚) are not constant to all of 𝑚 in chaotic sequence .
4 Mathematical Problems in Engineering

3.1.3. Identify the Chaos by Computing the Largest Lyapunov Input layer Hidden layer Output layer
Exponent. The fundamental characteristics of chaos are the
extreme sensitivity to initial values. The sensitivity can
be measured by the exponent of Lyapunov. It reflects the
divergence speed close to the initial orbit. The exponent
of Lyapunov exponent reflects the contracting and tensile X1
properties of the system in all directions. This paper calculates
Lyapunov exponent based on the Wolf method to judge
whether the original sequence is with chaos characteristics
X2 YN
. Wolf method is based on phase trajectory, phase plane,
and phase volume. The process is as follows.
(1) Determine the embedding dimension and delay time XN
to reconstruct phase space.
(2) Track the evolution of the distance from initial point
and its closest point. Limit the short separation.
(3) Continue to the front steps until the end of the time
series.
(4) Get the maximum Lyapunov exponent. Figure 3: RBF neural network structure.

## 3.2. Chaotic Time Series Predicted by RBF Neural Network 2400

3.2.1. The Basic Principle of RBF Neural Network. RBF neural 2200
network is a feed-forward neural network consisting of input 2000

## layer, hidden layer, and output layer [36, 37], as shown in

Figure 3. 1800
Input layer to hidden layer is linear connection. And
1600
hidden layer to output layer is nonlinear connection.
1400
3.2.2. Chaotic RBF Neural Network Prediction Steps. The
1200
specific steps of chaotic RBF neural network prediction are 0 96 192 288 384
as follows. May 2 May 9 May 16 May 23

(1) Establish the Network. Determine the input and output Figure 4: The original load trend chart of a region.
according to the calculated embedding dimension 𝑚 and
delay time 𝜏. The input is a vector [𝑥𝑖 , 𝑥𝑖+𝜏 , . . . , 𝑥𝑖+(𝑚−1)𝜏 ]. The
output is a data 𝑥2+(𝑚−1)𝜏 . RBF neural network is a mapping
𝑌󸀠 = 𝑥𝑛+2 is the actual predictive value of the sequence. Then
from 𝑚-dimension to 1-dimension. In this paper, the number
iterate the network with the predictive value as a new network
of input layer nodes is 𝑚. The number of output layer nodes
input.
is 1. The input matrix 𝑋 and output matrix 𝑌 are as follows:

## 𝑥1 𝑥1+𝜏 ⋅ ⋅ ⋅ 𝑥1+(𝑚−1)𝜏 4. The Empirical Example Analysis

[ 𝑥2 𝑥2+𝜏 ⋅ ⋅ ⋅ 𝑥2+(𝑚−1)𝜏 ]
[ ]
𝑋=[ .. ], To do empirical analysis, this paper selects the load on May
[ ⋅⋅⋅ ⋅⋅⋅ ⋅⋅⋅ . ]
2, 2011, May 9, May 16, and May 23, and May 30 (Monday)
[𝑥𝑛−(𝑚−1)𝜏 𝑥𝑛−(𝑚−2)𝜏 ⋅ ⋅ ⋅ 𝑥𝑛 ] of a region and collects 96 points per day, a total of 480 load
(12) data to calculate. Among them, set the data of first four days,
𝑥2+(𝑚−1)𝜏
[𝑥3+(𝑚−1)𝜏 ] a total of 384 data as the training sample, the data of last day,
[ ] and a total of 96 as test samples, to verify and analyze the load
𝑌=[ .. ].
[ . ] prediction model of inflection points.
Firstly, compose the load data of May 2, 9, 16, and 23 to a
[ 𝑥𝑛+1 ]
load sequence. Then, calculate the sharp degree of every point
(2) Training Stage. Select a certain length of time series; set of the load data according to the identification algorithm of
matrix 𝑋 as input and vector 𝑌 as output to train the network. inflection point based on sharp degree that was mentioned
above. The load sequence and sharp degree sequence are,
respectively, shown in Figures 4 and 5.
(3) Forecasting Stage. Set 𝑋󸀠 = [𝑥𝑛+1−(𝑚−1)𝜏 , 𝑥𝑛+1−(𝑚−2)𝜏 , . . ., As can be seen from Figure 5, the polarization phe-
𝑥𝑛+1 ] as the input of the neural network, and the output nomenon of sharp degree sequence is obvious. The point
Mathematical Problems in Engineering 5

0.9 101
0.8

## Mean squared error (mse)

100
The sharp degree

0.7
0.6
0.5 10−1
0.4
0.3 10−2
0.2
0.1 10−3
0
96 192 288 384 10−4
0 50 100 150 200 250
May 2 May 9 May 16 May 23
285 epochs
Figure 5: The sharp degree of load sequence diagram chart.
Train
Best
Goal
Cao method of minimum embedding dimension
1.4
Figure 7: The convergence curve in training process.
1.2
1
E1 and E2

## 0.8 is the choice of nonlinear excitation function. In some typical

0.6 excitation functions, this paper uses the Gaussian function as
the excitation function for its radial symmetry, smoothness,
0.4 and simple expression formula. Set the error of training
0.2 system to 0.001. Select the self-organizing selection center
0
method to determine the network center, width, and weight.
0 2 4 6 8 10 12 14 Then train the training sample with RBF neural network. The
Dimension convergence curve in training process is shown in Figure 7.
We can see that the blue trace is the convergence curve of
E1
training. The red horizontal line which parallels the 𝑥-axis
E2
and equals 10−3 is the goal of training. The green vertical line
Figure 6: Cao method for minimum embedding dimension. which parallels the 𝑦-axis and equals 285 epochs at the far
right side of the plot means that best training performance
is 0.00099767 at epoch 285. The forecasting result of test
samples of the load sharp degree sequence is shown in
of sharp degree sequence is corresponding to the point of
Figure 8.
original sequence. Most of the values in Figure 5 are less than
This paper uses the average absolute percentage error
0.1, which are corresponding to the flat load curve in Figure 4.
MAPE and the root mean square error RMSE to evaluate the
Only a few values in Figure 5 are between 0.1 and 1, which are
forecasting effect, and the formula is
corresponding to the inflection points in Figure 4. Therefore
set the threshold as 0.1. The load point with a sharp degree
value greater than 0.1 is the inflection point defined in this 1 𝑁𝑛 󵄨󵄨󵄨󵄨 𝑦̂𝑛 − 𝑦𝑛 󵄨󵄨󵄨󵄨
MAPE = ∑󵄨 󵄨,
paper. Thus, inflection point can be effectively identified by 𝑁 𝑛=1 󵄨󵄨󵄨 𝑦𝑛 󵄨󵄨󵄨
the sharp degree sequence. (13)
According to the mutual information method, the delay 1/2
1 𝑁 2
time 𝜏 = 4. And calculate the minimum embedding RMSE = ( ∑ (𝑦̂𝑛 − 𝑦𝑛 ) ) .
dimension with Cao method. It can be seen in Figure 6 that 𝑁 𝑛=1
𝐸1 tends to be saturate along with the increase of 𝑚. When
𝑚 ≥ 5, 𝐸1 remains the same. So the minimum embedding The calculation shows that the MAPE is 5.293% and the
dimension is 6 (𝑚 = 5 + 1 = 6). At the same time, it also RMSE is 6.391%. The predicting is with a high accuracy.
can be seen in the diagram that, with different values of 𝑚, The forecasting error curve of load sharp degree sequence
𝐸2 is not always equal to 1. The value of Lyapunov exponent is test samples based on chaotic RBF is shown in Figure 9. It can
0.3017 after being calculated by Wolf method, which is greater be seen that there is one point whose error value is bigger than
than zero. So the conversion sequences of input can be judged others. The point is the ninth point of prediction sequence.
as chaotic sequence. The actual value of this point is less than 0.001. However, the
Reconstruct the phase space according to the minimum predicted value is 0.576. The reason of this situation is that
embedding dimension and delay time. Then we can predict the ninth point of 96 points in the historical everyday data is
the sharp degree of load sequence based on RBF neural inflection point. The ninth point of forecasting sequence is an
network. The most critical part of determining RBF network abnormal point.
6 Mathematical Problems in Engineering

1 1
0.9

## Sharp degree of value

0.8 0.8
Sharp degree of value

0.7
0.6 0.6
0.5
0.4 0.4
0.3
0.2 0.2
0.1
0 0
0 10 20 30 40 50 60 70 80 90 0 10 20 30 40 50 60 70 80 90
Point Point

## Real value Real value

Predictive value Predictive value based on C-RBF
Predictive valu based on BP
Figure 8: Contrast figure of chaotic RBF inflection point sequence
predicted values and the real values. Figure 10: Contrast figure of the real values, predicted values based
on chaotic RBF, and predicted values based on BP.

0.6 2400
0.5
2200
0.4
The error value

2000

0.3
1800
0.2
0.1 1600

0 1400
−0.1 1200
0 10 20 30 40 50 60 70 80 90 0 10 20 30 40 50 60 70 80 90
Point Point
Error curve The original load curve
Figure 9: Error graph of chaotic RBF inflection. Figure 11: The inflection point location map according to the pre-
dicted results.

## This paper selects BP neural network model in order

to verify the effectiveness and superiority of the proposed The prediction training sample contains 96 points per day of
algorithm. BP neural network is one of the most commonly the same week type 4 weeks before the prediction, and the
used kinds of artificial neural network. The forecasting result training data totally contains 384 points. The prediction error
of test samples based on chaotic RBF and BP is shown in results are shown in Table 1.
Figure 10. The MAPE of the results based on BP neural The forecasting of 16 groups data shows that the average
network is 9.149%, which is much higher than the MAPE of MAPE of the model proposed in this paper is 4.25%. The
chaotic RBF. Thus, the superiority of chaotic RBF algorithm average RMSE is 3.897%. It suggests that the forecast effect
is evident particularly. is fine and the model is with strong practicability and
Set the inflection point threshold 𝑇 = 0.1, extract the applicability.
points with a predictive value greater than 0.1 in sharp degree
sequence, and then locate and highlight the points in the 5. Conclusion
known load curve on May 30, as shown in Figure 11.
It can be seen from Figure 11 that most of the inflection This paper puts forward a feasible load inflection point pre-
points of test samples can be accurately predicted by either diction method by proposing an inflection point forecasting
using inflection point identification algorithm based on model that can realize effective prediction of inflection point
contour sharp degree or forecasting model based on chaotic based on the algorithm of sharp degree and chaotic RBF
RBF neural network and that verified that inflection point neural network on the basis of research on short-term power
prediction model proposed in this paper is of high accuracy. load.
In order to further validate the applicability and effective- In the calculation example, the paper proposed an empir-
ness of model, this paper selected representative load curves ical analysis method of 96 points per day, and the algorithm
of different seasons to carry out the empirical researches. can be also applied to the inflection point prediction of a
Mathematical Problems in Engineering 7

## Number Time MAPE RMSE Number Time MAPE RMSE

1 January 3 6.322 2.647 9 August 9 3.095 2.191
2 January 11 3.769 5.97 10 August 16 3.616 2.094
3 January 19 6.937 3.969 11 August 25 2.31 5.967
4 January 28 4.723 6.162 12 August 31 3.202 1.987
5 May 4 3.11 2.217 13 October 8 2.459 5.967
6 May 18 8.468 4.392 14 October 19 4.193 2.228
7 May 24 4.271 2.344 15 October 22 2.719 5.969
8 May 31 5.187 6.153 16 October 28 3.616 2.092
The mean of MAPE 4.25% The mean of RMSE 3.897%

shorter or a longer time interval. However, the time interval  M. Y. Chow and H. Tram, “Application of fuzzy logic technology
and different threshold selection will directly affect the for spatial load forecasting,” IEEE Transactions on Power Sys-
inflection point identification based on the forecasted sharp tems, vol. 12, no. 3, pp. 1360–1366, 1997.
degree sequence. According to actual needs, the original load  D. Srinivasan and S. S. Tan, “Parallel neural network-fuzzy
time interval and the value of threshold can be adjusted. expert system strategy for short-term load forecasting: system
Although forecasting of the load curve contains the implementation and performance evaluation,” IEEE Transac-
information of inflection point, during the ordinary load tions on Power Systems, vol. 14, no. 3, pp. 1100–1106, 1999.
forecasting, the prediction error of inflection points is  W. J. Staszewski and K. Worden, “Wavelet analysis of time-
series: coherent structures, chaos and noise,” International
slightly larger than other points. This paper transformed
Journal of Bifurcation and Chaos, vol. 9, no. 3, pp. 455–471, 1999.
the original load sequence based on the sharp degree. And
 H. Mori and S. Vrano, “Short-term load forecasting with
after transformation, the polarization phenomenon of the chaos time series analysis,” in Proceedings of the International
sequence is obvious that highlights the regularity of the Conference on Intelligent Systems Applications to Power Systems,
change of the inflection point. In the later research work, pp. 283–287, 2007.
the inflection point forecast correction, the improvement of  J. X. Che and J. Z. Wang, “Short-term load forecasting using
original load curve forecasting results, and mining of the a kernel-based support vector regression combination model,”
influence factors of inflection point to increase the input Applied Energy, vol. 132, pp. 602–609, 2014.
dimension of inflection point prediction can be considered  A. Deihimi, O. Orang, and H. Showkati, “Short-term electric
to further improve the prediction accuracy. load and temperature forecasting using wavelet echo state
networks with neural reconstruction,” Energy, vol. 57, pp. 382–
401, 2013.
Conflict of Interests  H. J. Sadaei, R. Enayatifar, A. H. Abdullah, and A. Gani, “Short-
The authors declare that there is no conflict of interests term load forecasting using a hybrid model with a refined
exponentially weighted fuzzy time series and an improved
regarding the publication of this paper.
harmony search,” International Journal of Electrical Power and
Energy Systems, vol. 62, pp. 118–129, 2014.
Acknowledgment  Z. H. Xiao and S. J. Ye, “Rough set method for short-term load
forecasting,” Journal of Systems Engineering, vol. 24, no. 2, pp.
This paper is supported by the National Science Foundation 143–149, 2009.
of China (Grant nos. 71071052 and 71471059).  C. H. Kim, B. G. Koo, and J. H. Park, “Short-term electric load
forecasting using data mining technique,” Journal of Electrical
Engineering and Technology, vol. 7, no. 6, pp. 807–813, 2012.
References  L. Z. H. Zhu, “Short-term electric load forecasting with com-
 D. X. Niu, S. H. Cao, and J. C. H. Lu, Power Load Forecasting bined data mining algorithm,” Automation of Electric Power
Technique and Its Application, China Electric Power Press, 2009. Systems, vol. 30, no. 14, pp. 82–86, 2006.
 D. X. Niu and Y. N. Wei, “Short-term power load combinatorial
 C. H. Q. Kang, Q. Xia, and M. Liu, Power System Load Forecast-
forecast adaptively weighted by FHNN similar-day clustering,”
ing, China Electric Power Press, 2007.
Automation of Electric Power Systems, vol. 37, no. 3, pp. 54–57,
 T. Hong and P. Wang, “Fuzzy interaction regression for short 2013.
term load forecasting,” Fuzzy Optimization and Decision Mak-  A. Kavousi-Fard, H. Samet, and F. Marzbani, “A new hybrid
ing, vol. 13, no. 1, pp. 91–103, 2014. Modified Firefly Algorithm and Support Vector Regression
 N. Amjady, “Short-term hourly load forecasting using time- model for accurate Short Term Load Forecasting,” Expert
series modeling with peak load estimation capability,” IEEE Systems with Applications, vol. 41, no. 13, pp. 6047–6056, 2014.
Transactions on Power Systems, vol. 16, no. 3, pp. 498–505, 2001.  M. Yoder, A. S. Hering, W. C. Navidi, and K. Larson, “Short-
 L. Hernández, C. Baladrón, J. M. Aguiar et al., “Artificial term forecasting of categorical changes in wind power with
neural networks for short-term load forecasting in microgrids Markov chain models,” Wind Energy, vol. 17, no. 9, pp. 1425–
environment,” Energy, vol. 75, pp. 252–264, 2014. 1439, 2014.
8 Mathematical Problems in Engineering

 S. Bahrami, R.-A. Hooshmand, and M. Parastegari, “Short term  J. Z. Zhou, Y. C. Zhang, Q. Q. Li, and J. Guo, “Probabilistic short-
electric load forecasting by wavelet transform and grey model term load forecasting based on dynamic self-adaptive radial
improved by PSO (particle swarm optimization) algorithm,” basis function network,” Power System Technology, vol. 34, no.
Energy, vol. 72, pp. 434–442, 2014. 3, pp. 37–41, 2010.
 S. H. D. Pan, Z. H. N. Wei, Z. H. Gao et al., “A short-term  H. L. Deng and X. Q. Li, “Stock price inflection point prediction
load forecasting model based on relevance vector machine with method Based on chaotic time series analysis,” Statistics and
nonnegative matrix factorization,” Automation of Electric Power Decision, no. 5, pp. 19–20, 2007.
Systems, vol. 36, no. 11, pp. 62–66, 2012.
 Q.-H. Zhang, “A model for short-term load forecasting in power
system based on multi-AI methods,” System Engineering Theory
and Practice, vol. 33, no. 2, pp. 354–362, 2013.
 Z. G. Qian and X. Z. Lin, “Detection algorithm of image corner
based on contour sharp degree,” Computer Engineering, vol. 34,
no. 6, pp. 202–204, 2008.
 B. Amrouche and X. Le Pivert, “Artificial neural network
based daily local forecasting for global solar radiation,” Applied
Energy, vol. 130, pp. 333–341, 2014.
 R. Mohammadi, S. M. T. F. Ghomi, and F. Zeinali, “A new hybrid
evolutionary based RBF networks method for forecasting time
series: a case study of forecasting emergency supply demand
time series,” Engineering Applications of Artificial Intelligence,
vol. 36, pp. 204–214, 2014.
 H. Y. Luo, T. Q. Liu, and X. Y. Li, “Chaotic forecasting method of
short-term wind speed in wind farm,” Power System Technology,
vol. 33, no. 9, pp. 67–71, 2009.
 M. D. Alfaro, J. M. Sepúlveda, and J. A. Ulloa, “Forecasting
chaotic series in manufacturing systems by vector support
machine regression and neural networks,” International Journal
of Computers Communications & Control, vol. 8, no. 1, pp. 8–17,
2013.
 Z. Y. Zhang, T. Wang, and X. G. Liu, “Melt index prediction by
aggregated RBF neural networks trained with chaotic theory,”
Neurocomputing, vol. 131, pp. 368–376, 2014.
 H. B. Bi and Y. B. Zhang, “Application of the chaotic RBF neural
network on electrical loads prediction,” Science, Technology and
Engineering, vol. 9, no. 24, pp. 7480–7492, 2009.
 W. Y. Zhang, W. C. Hong, Y. Dong, G. Tsai, J. T. Sung, and G.
F. Fan, “Application of SVR with chaotic GASA algorithm in
cyclic electric load forecasting,” Energy, vol. 45, no. 1, pp. 850–
858, 2012.
 S. Kouhi, F. Keynia, and S. N. Ravadanegh, “A new short-term
load forecast method based on neuro-evolutionary algorithm
and chaotic feature selection,” International Journal of Electrical
Power & Energy Systems, vol. 62, pp. 862–867, 2014.
 X.-Q. Lu, B. Cao, M. Zeng, S.-S. Huang, and X.-G. Liu,
“Algorithm of selecting delay time in the mutual information
method,” Chinese Journal of Computational Physics, vol. 23, no.
2, pp. 184–188, 2006.
 K. Aihara, T. Takabe, and M. Toyoda, “Chaotic neural net-
works,” Physics Letters A, vol. 144, no. 6-7, pp. 333–340, 1990.
 Y. R. Cheng and S. B. Guo, “Stock price prediction based on
analysis of chaotic time series,” Journal of UEST of China, vol.
32, no. 4, pp. 469–472, 2003.
 S.-Q. Zhang, J. Jia, M. Gao, and X. Han, “Study on the
parameters determination for reconstructing phase-space in
chaos time series,” Acta Physica Sinica, vol. 59, no. 3, pp. 1576–
1582, 2010.
 D. Kressner, M. Pleinger, and C. Tobler, “A preconditioned low-
rank CG method for parameter-dependent Lyapunov matrix
equations,” Numerical Linear Algebra with Applications, vol. 21,
no. 5, pp. 666–684, 2014.
Advances in Advances in Journal of Journal of
Operations Research
Hindawi Publishing Corporation
Decision Sciences
Hindawi Publishing Corporation
Applied Mathematics
Hindawi Publishing Corporation
Algebra
Hindawi Publishing Corporation
Probability and Statistics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

## The Scientific International Journal of

World Journal
Hindawi Publishing Corporation
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

## Submit your manuscripts at

http://www.hindawi.com

## International Journal of Advances in

Combinatorics
Hindawi Publishing Corporation
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

## Journal of Journal of Mathematical Problems Abstract and Discrete Dynamics in

Complex Analysis
Hindawi Publishing Corporation
Mathematics
Hindawi Publishing Corporation
in Engineering
Hindawi Publishing Corporation
Applied Analysis
Hindawi Publishing Corporation
Nature and Society
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences

## Hindawi Publishing Corporation Hindawi Publishing Corporation Volume 2014

Function Spaces
Hindawi Publishing Corporation
Stochastic Analysis
Hindawi Publishing Corporation
Optimization
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014