FORECASTING:TIME SERIES

By -

TIME SERIES

Most statistical forecasting methods are based on using historical data from a time series.

A time series is a series of observations over time of some quantity of interest (a random variable). Thus, if Xi is the random variable of interest at time i, and if observations are taken at times1 i = 1, 2, . . . , t, then the observed values{X1 = x1, X2 = x2, . . . , Xt = xt} are a time series.

For example, the recent monthly sales figures for a product comprises a time series, as il- lustrated in Fig. 27.1.

1These times of observation sometimes are actually time periods (months, years, etc.), so we often will refer to the times as periods.

INTRODUCTION TO OPERATIONS RESEARCH-0645

Because a time series is a description of the past, a logical procedure for forecasting the future is to make use of these historical data. If the past data are indicative of what we can expect in the future, we can postulate an underlying mathematical model that is representative of the process. The model can then be used to generate forecasts.

In most realistic situations, we do not have complete knowledge of the exact form of the model that generates the time series, so an approximate model must be chosen. Frequently, the choice is made by observing the pattern of the time series. Several typical time series patterns are shown in Fig. 27.2. Figure 27.2a displays a typical time series if the generating process were represented by a constant level superimposed with random fluctuations. Figure 27.2b displays a typical time series if the generating process were rep- resented by a linear trend superimposed with random fluctuations. Finally, Fig. 27.2c shows a time series that might be observed if the generating process were represented by a constant level superimposed with a seasonal effect together with random fluctuations. There are many other plausible representations, but these three are particularly useful in practice and so are considered in this chapter.

Once the form of the model is chosen, a mathematical representation of the generat- ing process of the time series can be given. For example, suppose that the generating process is identified as a constant-level model superimposed with random fluctuations, as illustrated in Fig. 27.2a. Such a representation can be given by

Xi = A + ei, for i = 1, 2, . . . ,

where Xi is the random variable observed at time i, A is the constant level of the model, and ei is the random error occurring at time i (assumed to have expected value equal to zero and constant variance). Let Ft+1 = forecast of the values of the time series at time t + 1, given the observed values, X1 = x1, X2 = x2, . . . , Xt = xt.

Because of the random error et+1, it is impossible for Ft+1 to predict the value Xt+1 = xt+1 precisely, but the goal is to have Ft+1 estimate the constant level A = E(Xt+1) as closely as possible. It is reasonable to expect that Ft+1 will be a function of at least some of the observed values of the time series.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn...
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each ...
Read more

INTEGER PROGRAMMING:THE BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS

By -
TH E BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS Integer programming has been an especially exciting area of OR since the mid-1980s be- cause of the dramatic progress being made in its solution methodology. Background To place this progress into perspective, consider the historical background. One big break- through had come in the 1960s and early 1970s with the development and refinement of the branch-and-bound approach. But then the state of the art seemed to hit a plateau. Rel- atively small problems (well under 100 variables) could be solved very efficiently, but even a modest increase in problem size might cause an explosion in computation time be- yond feasible limits. Little progress was being made in overcoming this exponential growth in computation time as the problem size was increased. Many important problems arising in practice could not be solved. Then came the next breakthrough in the mid-1980s, with the introduction of the b r an c h- and-cu t approach to sol...
Read more