 |
Description  |
|
|
FIELD OF THE INVENTION
This invention relates to the management of inventory in physical distribution networks. Specifically, the invention relates to a distribution logistics framework known as Distribution Resource Planning (DRP), widely used in industry to manage
the flow of goods through such networks. The inveniton focuses on the problem of projection (or, equivalently, estimation) of future distribution requirements and of future inventory levels and discloses preferred methods for enhancing the capability of
DRP in this regard.
INTRODUCTION TO THE INVENTION
Problem Definition
Overview
A physical distribution system consists of a collection of warehouses, distribution centers, and retailers through which products flow on their way from manufacturer to final customer. Management of inventory in such networks entails deciding
how much inventory of each product to stock at each location in the network, when and how to replenish these stocks, and how large the replenishment order quantities should be. Distribution Resource Planning (DRP) refers to a general framework for
planning and managing inventory in distribution systems. In particular, it allows for the setting of inventory control parameters and the calculation of time-phased inventory requirements, based on user-specified goals, such as service level targets or
total inventory investment. It can take into consideration a host of different constraints, including supply capacity constraints, minimum and maximum order quantity constraints, etc. Since the early 1980's, DRP systems have been implemented in a
variety of commercial software packages, offering a wide range of decision support capabilities to inventory managers and procurement personnel, and have been widely used in industry. For descriptions of DRP as well as examples of how it is used, refer
to Martin, Silver and Peterson, Stenger, Mlot et al., and Smith. (Martin, A. J., Distribution Resource Planning: Distribution Management's Most Powerful Tool, Prentice-Hall, Englewood Cliffs, N.J. and Oliver Wight Ltd. Publications, Inc., Essex
Junction, Vt., 2nd ed., 1990; Silver, E. A. and Peterson, R., Decision Systems for Inventory Management and Production Planning, Wiley, New York, 2nd ed., 1985; Stenger, A. J., Distribution Resource Planning in: The Logistics Handbook, J. F. Robeson and
W. C. Copacino (eds.), The Free Press, New York, 1994; Mlot, B., DiFrancesco, L., Perry, D., Landvater, D. and Martin, A., Distribution Resource Planning: The Critical Link from Final Point of Manufacture to Final Point of Sale, The 39th APICS
International Conference Proceedings, 1996, pp. 294-297). Examples of popular software packages that implement DRP include those sold by Manugistics Inc., American Software, i2, and LPA.
SUMMARY OF THE INVENTION
One of the advertised strengths of DRP is its putative ability to project future on-hand inventory and future replenishment requirements at all echelons of a distribution network. Indeed, Stenger states that "the projection plan represented by
any one [DRP] table is of great value in its own right because it shows the inventory levels we need to maintain to meet demand and provide customers with the service needed (through the safety stock). It also indicates when replenishments--and their
quantities--need to be scheduled to make the plan work." The projection of future on-hand inventory and replenishment requirements is accomplished using standard DRP logic, described below. However, as we explain below, standard DRP logic provides
estimates of projected future on-hand inventory and replenishment requirements without taking into consideration the uncertainty of future demands. Specifically, DRP logic, in its calculation of projected on-hand inventory and replenishment
requirements, implicitly assumes that the demand that will be realized in the future is exactly equal to the forecast. We provide a simple example which demonstrates that the standard DRP logic, by ignoring future demand variability, can lead to
misleading performance estimates. This invention, in sharp contrast to the prior art, discloses two methods for enhancing DRP's performance projection capabilities by making explicit use of future demand variability information, one preferably based on
an analytical approximation and one preferably based on Monte Carlo simulation.
Accordingly, in a first aspect, the invention discloses a program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for use in a physical distribution network, the
method comprising the steps of:
(1) using a distribution resource planning (DRP) logic for providing estimates of at least one of projected future on-hand inventory and replenishment requirements; and
(2) incorporating within the DRP logic an uncertainty of future demand for estimating at least one of future replenishment requirements and inventory levels in the physical distribution network.
In a second aspect, the invention comprises a distribution resource planning engine comprising:
(1) an input means for inputting to the engine information derived from a database, a forecast engine, and an inventory planning engine and comprising respectively inventory status, planning parameters, and demand forecasts;
(2) a logic means connectable to the input means and operable upon its information and comprising a distribution resource planning agent incorporating an uncertainty of future demand for estimating at least one of future replenishment
requirements and inventory levels in a physical distribution network; and
(3) an output means connected to the logic means for outputting estimates of at least one of future replenishment requirements and inventory levels in a physical distribution network.
The invention as defined can realize important advantages. For example, it enables one to retain all the virtues of extant DRP logic, while it removes its current noted deficiencies with respect to implicit assumption (i.e., that a demand that
will be realized in the future is presumably to be exactly equal to a forecast). In this way, the invention can realize the significant advantage of enhancing DRP performance projection capabilities.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention is illustrated in the accompanying drawing, in which:
FIG. 1 shows a layout of a distribution network;
FIGS. 2-4 and 6 comprise Tables of utility in explaining the invention;
FIG. 5 is a graph in further illustration of an aspect of the present invention; and
FIG. 7 provides a schematic of a DRP engine.
DETAILED DESCRIPTION OF THE INVENTION
Formal Description of DRP Logic
By DRP logic, we mean a mathematical algorithm used in standard DRP procedures to calculate future on-hand inventory and future replenishment requirements. We begin with a mathematical description of DRP logic. Our description is a formal
abstraction from standard DRP procedures, descriptions of which are widely available in professional references such as Stenger, as well as in manuals of commercial software, such as those mentioned above. We explain the logic in terms of a single
product at a single location; later, we provide an example illustrating how the logic carries over to distribution networks with multiple locations and multiple products.
DRP logic is based on a set of recursive equations that characterize the inventory dynamics over time. To be more precise, the principal logic of DRP involves the recursive calculation of the replenishment requirements, the on-hand inventory,
and the backordered demand in the future for a specific product at a specific location. The first step in describing the recursion is to divide the future time into a set of discrete periods of equal length, indexed by t=1,2, . . . ,n, where n is the
time horizon of interest. As a practical matter, DRP logic is typically implemented using weekly or monthly periods with a time horizon of 6 months to one year. So, assuming that we are currently at the beginning of period 1 (equivalently, the end of
period 0) the objective of DRP logic is to project, for the product and location of interest, the following quantities for all future periods,
I.sub.t : the on-hand inventory at the end of time period t.
B.sub.t :=the backordered demand at the end of time period t.
A.sub.t :=the required quantity of product needed at the beginning of period t.
Q.sub.t :=the planned receipts of product needed at the beginning of period t.
R.sub.t :=the recommended order quantity at the beginning of period t.
The distinction between the requirements, A.sub.t, and the planned receipts, Q.sub.t, is important. Whereas A.sub.t represents the quantity that is needed at the beginning of period t, Q.sub.t reflects what is feasible, taking into account lead
time constraints and order quantity restrictions. For example, if A.sub.t =40 and the maximum order quantity is 30, then Q.sub.t would be set to 30.
To carry out the recursive calculation of these quantities, DRP assumes that the following information is known (again, for the specific product and location) at the start of time period 1:
D.sub.t :=the demand in future time period t,t=1,2, . . . ,n. Although the actual future demand is unknown, DRP assumes that the future demand in period t is known through its mean, E[D.sub.t ], and standard deviation, sd[D.sub.t ]. (This
information presumably comes from some forecasting procedure but how this information is generated is not relevant to DRP logic.)
T.sub.t :=the scheduled receipts at the beginning of time period t. This is the quantity of the product that is currently (i.e., at the beginning of period 1) scheduled to arrive at the location at the start of period t.
K.sub.t :=the safety stock requirement for period t. This is the quantity of the product that should be kept at this location in this period to protect against uncertainty in demand.
Most DRP software implementations provide a variety of methods to automatically calculate safety stock requirements for each period. These methods vary in degree of sophistication but, just as with forecast generation, the particular approach
used is not relevant to DRP logic.
I.sub.0 :=the on-hand inventory at the beginning of time period 1. This is the current on-hand inventory.
B.sub.0 :=the backordered demand at the beginning of time period 1.
The scheduled receipts, T.sub.t, should not be confused with the planned receipts, Q.sub.t. The former is an input to DRP and reflects what is actually going to be delivered at the start of period t; the latter is an output of DRP and reflects
an assessment of what is additionally needed at the start of period t. The scheduled receipts are sometimes referred to as "in-transit" to suggest that the goods are physically en route to the location in question.
To project future requirements, A.sub.t, t=1 , . . . ,n, DRP makes use of the following recursive relation:
where [x ].sup.+ denotes max {x,0}. The above equation says that the replenishment requirement in each period along with any on-hand inventory from the last period and scheduled receipts due at the beginning of this period, should be able to
supply the demand of the current period and any backlog from the last period, and still result in a surplus that is equal to the required safety stock for this period. The next step in DRP logic is to modify A.sub.t to reflect what can feasibly be
obtained by the start of period t. To this end, the planned receipts, Q.sub.t, are derived from A.sub.t by applying any set of order restrictions that have been prespecified. Mathematically,
where .function. is an arbitrary user-defined function which characterizes the replenishment order policy. Two commonly used replenishment order policies are lot-for-lot and min-max. In lot-for-lot, the function .function. is the identity
function and Q.sub.t =A.sub.t t=1, . . . ,n. That is, no restrictions are placed on order quantities. In min-max, minimum and maximum order quantities, Q.sub.min and Q.sub.max, as are specified and the order policy rule is
That is, the order quantity is made to fall within the minimum and maximum order quantity range.
The recursive equations governing the on-hand inventory, I.sub.t, and the backorders, B.sub.t, are simple to describe as well. First, denote the net inventory level at the beginning of period t as
Then, clearly,
The final calculation performed by DRP is the recommended orders. Suppose that the order lead time for a specific product at a specific location is L weeks. In DRP, replenishment requirements translate to recommended order quantities L weeks
earlier:
So, the recommended order quantity at the start of period t is whatever the calculated planned receipts quantity is in period t+L.
Since the future demand D.sub.t is known only through its forecasted mean and standard deviation, to implement the recursions defined in (1)-(5), DRP logic uses the forecasted mean demand, E[D.sub.t ], in place of D.sub.t to obtain the following
modified recursions:
We use the tilde () to differentiate the formal recursions defined above from the DRP implementation of these recursions using the forecasted mean demand. Therefore, these quantities can be viewed as DRP's estimates of unknown future quantities. For example, R.sub.t can be interpreted as DRP's estimate of the quantity that will be ordered at the start of week t standing at the beginning of period 1. In particular, R.sub.1 is the current recommended order quantity--i.e., it is the amount that,
according to DRP, should be ordered right now. R.sub.5 is DRP's current best guess at the quantity that is most likely to be ordered at the start of period 5.
EXAMPLE
To help illustrate DRP logic, we consider an extremely simple distribution network, illustrated schematically in FIG. 1, numeral 10. The network consists of three retailers supplied by one warehouse location. The retailers obtain replenishments
from the warehouse, who in turn obtains replenishments from a supplier. For the purpose of this example, we focus on one product that is sold by all three retailers. We assume that the replenishment lead time for this product at each of the retailers
is 5 weeks and that the replenishment lead time at the warehouse is 15 weeks. This means, for example, that if a retailer places a replenishment order at the start of week 1, then it will arrive at the start of week 6. Let us suppose that we are
currently at the beginning of week 1 (i.e., t=1) and we are interested in using DRP to project forward 26 weeks into the future. DRP logic assumes that the following information is known at this time:
The mean and standard deviation of each retailer's future weekly demand over the horizon in question.
The current on-hand inventory at each location, namely at all three retailers and at the warehouse.
The scheduled receipts--i.e., a list of all shipments scheduled to arrive at each location by week over the horizon in question.
The safety stock to be held at each location.
For this example, we assume that the weekly demand at each retailer for this product follows a discrete uniform distribution on [0,20]--that is, the weekly demand equals n with probability p=1/21, n=0,1, . . . 20. Thus, the weekly demand at
each retail location has a mean of 10 and a standard deviation of .sqroot.110/3.apprxeq.6.06. We also assume that at the start of week 1, we have 60 units of on-hand inventory available at each retailer and 100 units available at the warehouse. Next,
let us suppose that there are currently no scheduled receipts. Finally, we assume that the retailers wish to hold 10 units of safety stock and the warehouse wishes to hold 15 units of safety stock.
To project on-hand inventory and replenishment requirements for the next 26 weeks at each location in this network, DRP logic first starts with the retail locations and constructs a table for each retailer that reflects the weekly operation of
the retailer over the next 26 weeks. The table consists of 26 columns (one for each week) and the following rows:
1. Expected (i.e., mean) demand (E[D.sub.t ])
2. Scheduled receipts (T.sub.t)
3. Safety stock requirements (K.sub.t)
4. Replenishment requirements (A.sub.t)
5. Planned receipts (Q.sub.t)
6. On-hand inventory (I.sub.t)
7. Backordered demand (B.sub.t)
8. Recommended orders (R.sub.t)
FIG. 2, numeral 12, comprising Table 1 shows a completed DRP table for one retailer in our example. (Since all the retailers are identical in this example, the tables generated for the retailers are identical). All of the projected quantities,
A.sub.t, Q.sub.t, I.sub.t, B.sub.t, and R.sub.t, have been calculated using the recursions specified in equations (6), (7), (8), (9), and (10). In calculating the planned receipts, Q.sub.t, for this example, we have assumed a min-max order policy with
Q.sub.min =Q.sub.max =30 for the retailers and Q.sub.min =Q.sub.max =200 for the warehouse.
To continue with our example, let us assume that the DRP tables have been constructed for all three retailers following the DRP logic described above. The next step is to construct an analogous DRP table for the warehouse. To do this, DRP sums
up the recommended order quantities by week from all three retailers and this becomes the weekly demand forecast used to drive the DRP logic at the warehouse level. That is, row 1 of the DRP table at the warehouse corresponding to the expected weekly
demand at the warehouse is constructed by summing the corresponding recommended order quantities from the three retail DRP tables. Once the weekly demand is specified, the DRP recursive calculations are carried out exactly as for the retailers,
resulting in a completed DRP table for the warehouse. FIG. 3, numeral 14, comprising Table 2 shows a completed DRP table for the warehouse in our example.
To summarize, the end result of the DRP calculations is a set of tables, one for each product and location in the distribution network. The key quantities that these tables contain are projections (equivalently, estimates) about the future
on-hand inventory and replenishment requirements. While we have illustrated the construction of these tables using a simple example, the logic we have described carries over in a straightforward manner to much more complex networks.
Critique of DRP Logic
A primary criticism of DRP logic is that it ignores the variability of unknown future demand in its calculations by substituting the mean forecasted demand in the recursive equations. In our example, the mean demand at the retail level is 10
units per week and this is the number that is used in carrying out the DRP calculations. However, the standard deviation of demand is 6.06 and no where in the DRP logic is this fact used. The calculation of safety stock may make use of the standard
deviation of demand but this calculation falls outside the scope of DRP logic. As stated earlier, the safety stock is assumed to be given as an input to the DRP calculations. In fact, the implicit assumption in DRP logic is that the standard deviation
of demand is 0.
Another way to view the situation is that the formal recursive equations governing DRP logic as defined in (1), (2), (3), (4), and (5), are statements about random quantities. Viewed in this light, it is reasonable to ask if the DRP projections
specified in equations (6), (7), (8), (9), and (10) correspond to the correct expected values of these random quantities. In fact, it is easy to prove mathematically that DRP logic does not provide correct estimates of these expected values. In this
sense, DRP logic is faulty. As we shall demonstrate by numerical example, DRP logic can lead to performance projections which deviate significantly from the expected values. As a practical matter, we know of no way to predict in advance whether DRP
logic will lead to "acceptable" performance projections in specific instances. As a result, the estimates provided by DRP logic are both unreliable and potentially misleading.
Two Methods For Improving DRP Projections
Both methods we describe in this section aim at refining the standard DRP projections by making use of information about future demand variability. Method 1 is based on analytical formulas, and is suitable for cases where the replenishment
policy is lot-for-lot--i.e., there are no order size restrictions. Method 2 is simulation based, and is applicable more generally, including cases with order-quantity constraints, but does require greater computational effort.
In our example, recall that the future demand per week follows a discrete uniform distribution on [0,20] by assumption. Rather than treat this demand as deterministic with a value of 10 per week as DRP logic does, we incorporate in our methods
the fact that the weekly demand has a standard deviation of 6.06. It is precisely this refinement that leads to greater accuracy in our performance estimates.
Method 1: An Improved Analytical Approximation
We describe an analytical approach to improving the DRP projections of on-hand inventory and replenishment requirements, assuming that the replenishment policy used is lot-for-lot. Specifically, we derive an alternative method for projecting the
quantities A.sub.t, I.sub.t, B.sub.t, and R.sub.t for a given product at a given location. To distinguish our method from standard DRP logic and from the formal equations described earlier, we will use the notation A.sub.t, I.sub.t, B.sub.t, and R.sub.t
to denote the results of our calculations. Note that because of our assumption of lot-for-lot replenishment, we do not distinguish in this section between the requirements and the planned receipts. (As explained earlier, under lot-for-lot
replenishments, the planned receipts are identical to the requirements.)
Denote
the mean and standard deviation of D.sub.t ;; and denote, for s<t,
Recall that the lead time is L periods. Suppose we want to determine the requirement A.sub.t for period t. We need to make this decision at the beginning of period t-L, so as to place the order in time for it to arrive in period t.
Now, position ourselves at the beginning of period t-L. What we know are the following: (a) the net inventory left from the previous period, Y.sub.t-L ; (b) the replenishment requirements from previous periods, A.sub.t-L,A.sub.t-, . . .
,A.sub.t-1, and (c) the scheduled receipts for this period, T.sub.t-L. What we do not know is the sequence of demand over the lead time, D.sub.t-L,D.sub.t-L +1, . . . , D.sub.t. At this point, we make the assumption that demand per period follows a
normal distribution and that each period's demand is independent of the demand in other periods. Then, we can write:
where Z is a standard normal random variable. (Standard indicates mean 0 and standard deviation 1.)
Denote A(s,t):=A.sub.s +. . . +A.sub.t, for s<t. We specify the requirements for period as t,A.sub.t, follows:
In the above formula, whenever t.ltoreq.L, we set t-L:=1; and when t-L>t-1, we set A(t-L,t-1)=0. Denote ##EQU1## as the safety factor. There are two cases. Suppose, first, that the quantity on the right hand side of (11) is positive. Then,
and hence, ##EQU2##
In this case, at the beginning of period t-L, the net inventory is Y.sub.t-L, which, along with the replenishment requirements over the lead time--a total of
is going to supply all the demands over the lead time--a total of D(t-L, t). Hence, at the end of period t, the expected backorder is: ##EQU3## Defining G(x):=E[Z-x].sup.+, we can rewrite (14) as
Similarly,
where H(x):=x+G(x).
Next, suppose A.sub.t =0 in (11). Then,
Hence,
with k.sub.t following (12). Note in this case, the safety factor is at least as large as the safety factor is at least as large as the safety factor in (13) of the first case. Hence, B.sub.t in (14) is no larger than B.sub.t in (14), since G()
is a decreasing function. (Intuitively, in the second case, since the available (net) inventory Y.sub.t-L is higher, the effective safety factor is also higher; hence, the (projected) backorder is lower.)
Similarly, when A.sub.t =, we have
with k.sub.t following (12); and I.sub.t in this case is higher than I.sub.t of (16).
To summarize, we propose the following method for recursively calculating the quantities A.sub.t, B.sub.t and I.sub.t t=1, . . . ,n:
Method 1 for recursive calculation of A.sub.t, B.sub.t and I.sub.t :
1. For t=1 to n:
(a) Calculate A.sub.t using (11);
(b) Calculate B.sub.t using (15, 17);
(c) Calculate I.sub.t using (16, 18);
(d) Set Q.sub.t =A.sub.t ;
2. End for loop.
After calculating A.sub.t, t=1, . . . ,n, we calculate the recommended order quantities, R.sub.t, following
Method 2: Monte Carlo Simulation
An alternative approach to estimate the quantities E[A.sub.t ], E[Q.sub.t ], E[I.sub.t ], E[B.sub.t ], and E[R.sub.t ],t=1, . . . ,n, is to use the technique of Monte Carlo simulation. See Bratley, Fox, and Schrage (Bratley, P., Fox, B. L. and
Schrage, L. E., A Guide to Simulation, Springer-Verlag, New York, 1987), Law and Kelton (Law, A. M. and Kelton, W. D., Simulation Modeling & Analysis, McGraw-Hill, Inc., New York, 1991), and Banks and Carson (Banks, J., Carson, J. S. and Nelson, B. L.,
Discrete-Event System Simulation, Prentice-Hall, New Jersey, 2nd edition, 1996) for details about this methodology. Essentially, this approach is statistical rather than analytical. It has the advantage over Method 1 of being applicable regardless of
order quantity restrictions imposed by the user in calculating the planned receipts from the requirements. To implement this method, we make use of the same set of DRP recursions described in equations (1)-(5). However, rather than using the mean
demand as the basis for our calculations, we use a set of randomly sampled demands.
For the purposes of describing the method, we assume for the moment that we have a set of M random samples of demand. Specifically, we assume that we have M sets of n numbers, (d.sub.t.sup.m, . . . , d.sub.n.sup.m),m=1, . . . ,M. The set
(d.sub.1.sup.m, . . . ,d.sub.n.sup.m)represents a random sample of demands for each period. For the m.sup.th set, calculate the quantities a.sub.t.sup.m, b.sub.t.sup.m, and i.sub.t.sup.m, recursively using the relations:
Then, our estimates, denoted A.sub.t, Q.sub.t, I.sub.t, and B.sub.t, are ##EQU4## To calculate the recommended order quantifies, R.sub.t, we use, as before,
To generate the sets of random samples, we make use of the fact that we are given the mean and standard deviation of the demand for each period. The first step requires selecting a probability distribution which matches the mean and standard
deviation for each period. Then, to generate random samples from this probability distribution, we make use of any of several standard techniques (cf. Law and Kelton, Law, A. M. and Kelton, W. D., Simulation Modeling & Analysis, McGraw-Hill, Inc., New
York, 1991), such as the inverse transform method.
As a final observation, we point out the generality of this method. For example, the method can be applied to situations in which demand is correlated across time or among different products. Also, the method can handle arbitrarily complex
ordering rules--not just the lot-for-lot and min-max rules described earlier.
A Numerical Example
In this section, we use the example described above to compare results obtained using standard DRP logic (referred to as Standard DRP), to those obtained using the two methods that we have proposed (referred to as Method 1 and Method 2). For the
purposes of this example, we focus on one of the three retailers and compare the estimates obtained for replenishment requirements, on-hand inventory, and backordered demand.
In our first comparison, we use a lot-for-lot replenishment rule to compare Standard DRP with Method 1. FIG. 4, numeral 16 comprising Table 3 contains DRP tables generated using both approaches. Note that the requirements generated for this
example | | |
