Mathematical Modeling Research in Fashion and Textiles Supply Chains and Operational Control Systems 2014
View this Special IssueResearch Article  Open Access
An Pan, ChiLeung Hui, Frency Ng, "An Optimization of Inventory Policy Based on Health Care Apparel Products with Compound Poisson Demands", Mathematical Problems in Engineering, vol. 2014, Article ID 986498, 9 pages, 2014. https://doi.org/10.1155/2014/986498
An Optimization of Inventory Policy Based on Health Care Apparel Products with Compound Poisson Demands
Abstract
Addressing the problems of a health care center which produces tailormade clothes for specific people, the paper proposes a single product continuous review model and establishes an optimal policy for the center based on control policy to minimize expected average cost on an order cycle. A generic mathematical model to compute cost on realtime inventory level is developed to generate optimal order quantity under stochastic stock variation. The customer demands are described as compound Poisson process. Comparisons on cost between optimization method and experiencebased decision on are made through numerical studies conducted for the inventory system of the center.
1. Introduction
The research starts from the case study of the health care center, a nonprofit organization which provides tailormade apparel making services for the disabled and the old. With smallsized inventory capacity, the center cannot have too much cloth material in stock. Due to limited funding, it is necessary to reduce operation cost including inventory cost. Customer orders are stochastic with random arrivals.
From the case study, we summarize the problem as a single item continuous review system with limited inventory capacity and stochastic customer demands. With continuous review, we adopt classic policy as the inventory control policy: when the inventory position (stock on hand plus stock on order minus backorders) reaches the order point , an order is placed for the fixed amount , the batch size. In this paper, the problem is to determine optimal in the objective of minimization of average cost including purchase cost and delivery cost which are classic terms defined by Hadley and Whitin [1].
For stochastic inventory system, policy is the most widely used. There has been no straightforward solution for computing policy since Federgruen and Zheng [2] propose a simple and efficient algorithm for determination of an optimal policy. The algorithm is based on the observation of longrun average cost. Later Forsberg [3] shows how to exactly evaluate holding and shortage costs for a twolevel inventory system with one warehouse and different retailers. To implement such policy, the system needs the inventory space that can store . However, in real practice, the storage space is usually limited due to high cost of land acquisition. Other research on the singleitem policy includes Hadley and Whitin [1], Lau et al. [4], Zheng [5], and the references cited therein. The issue we consider in this paper is important in the following aspects. Firstly, based on standard method, the model is optimized under the restriction of storage space. Although inventory problems have been studied and solved, the effort required to find better plans for problems in different cases and backgrounds may vary considerably. Secondly, to the author’s knowledge, little attention has been given on the issue of space constraint in literature. Some research have been made for limit production capacity (see [6–9]). Others have dealt with resource constraint problems for newsvendor models (see [10, 11]). Thirdly, also based on author’s knowledge, there have been few even no intuitive expressions for a spacelimited inventory system. Procedures for determining optimal for most models are to solve iteratively (see [12]). The method is complicated in real execution. In Lau et al., 2002, easytouse expressions are presented for computing the exact “average onhand inventory” level for a variety of leadtimedemand distribution forms. However, the expression of is not applicable in minimizing longrun average system cost. Thus, in our paper, we generate methods not only helpful for academic analysis but reasonable and simple enough for business practitioner’s execution. Last, we propose the inventory model with infinitesimal method to compute cost on realtime inventory level and assume customer demands as compound Poisson process.
The rest of the paper is organized as follows. In Section 2, we provide related literature of previous research on model in stochastic environment. Section 3 mainly describes the notation and preliminary studies. Detailed model formulation and derivations are also provided in Section 3. In Section 4, case based numerical analysis is conducted and comparisons are made. Concluding remarks and potential future studies are given in Section 5.
2. Literature Review
An inventory control system tells us how much to order and when to place the order. To propose a reasonable inventory control system improves operation efficiency. Hence, it brings about advantages like costsaving, profit earning, and customer satisfaction. Under continuous review, businesses typically track inventory until it reaches a predetermined point of “low” holdings, whereupon an order is made to push holdings back up to a desirable level. continuous review control policies are mostly used for uncertain demand and lead time.
For stochastic models, the continuous review model can be classified according to whether the demands are discrete or continuous. In the case of discrete demands, Poisson demands in the continuous review models are studied in depth [13]. Song and Zipkin [14] consider the case of Markov modulated Poisson demands, while Browne and Zipkin [15] study a model with continuous demand driven by a Markov process. In our research, we discuss, respectively, the optimal inventory models in continuous demand and discrete demand.
Though different inventory systems are proposed for stochastic situation (see [15–20]), control policies are popular for uncertain demand or random lead time in multiperiod. Song et al. [21] discuss the effect of lead time and uncertain demand in policy. Berk and Gürler [22] show a continuous review policy is reasonable good for a perishable inventory system with fixed shelf lives and study the operating characteristics of the system.
Exact analysis and cost evaluation on continuous review installation stock policy for identical or nonidentical retailers are presented, but with the restriction of items in low demand which is depicted by Poisson or compound Poisson (see e.g., [3, 23–25]). A simple heuristic algorithm is proposed to find an approximate nearoptimal policy [26]. Heuristic solutions have also been presented to policy (see [27, 28]).
The methods which previous research provide are elaborate and brilliant; however, these algorithms are not easy to execute. This brings out an important aspect as pointed out by Alstrøm [29]; that is, in view of the evidence from a number of studies showing that firms’ use of statistical inventory control lags far behind academic interest in the area. The determination of optimal values for the control variables, even in a very simple inventory control system, is a complex task and therefore not suited to practical implementation. Thus, we hope to find a solution easy to carry out for practical inventory control and meaningful to academic research. Reviewing on the research, in the next section we will formulate the problem and produce efficient solutions for inventory policies.
3. Optimization Model
3.1. Overview and Preliminary
The mathematical model is built in the context of a threeechelon supply chain with customer, the health care center, and supplier (see Figure 1). The health care center provides tailormade clothes for the disabled or the old. Customer demands are depicted as compound Poisson process. It is a single item inventory system with purchase cost fixed. As profit is not first consideration for the health care center, the model aims to minimize average cost in an order cycle. The inventory is reviewed by policy continuously (see Figure 2). Lead time is constant. Two optimal policies are proposed for the inventory model. is determined by service level so that the safety stock is kept at a reasonable level. Optimal is expressed through derivation. Genetic algorithm is developed to derive and . We discuss the system in steady state. Demands that cannot be fulfilled in current state are backordered.
Unfixed customer orders, random order arrivals, stochastic order cycle, and nonlinear stock level increase the complexity of the model. We include ordering cost and inventory cost in the model to find the optimal order quantity so as to achieve minimum average cost on an order cycle. Inventory cost is derived based on realtime inventory level.
Parameter AC: average cost on an order cycle : lead time of material procurement : holding cost per unit per time unit : stockout cost per time unit : ordering cost per procurement : safety stock : stock level (continuous random variable) at time : probability density function of stock level at time , : cumulative distribution function of : customer order quantity per order, , : accumulated customer demand at time : probability density function of , : customer order arrivals during : order cycle between two adjacent customer order arrivals : probability density function of : the probability of material arrival at time () : service level.
Decision Variable : order quantity (to a supplier), unit per order.
Assumption(1)the replenishment lead time is constant(2)in an order cycle, there is no outstanding order at . Inventory level at is .
Preliminaries. , , counts the times of customer order arrival during .
, and independently increase, where stands for infinitesimal of higher order.
is a Poisson process. For all , .
Proposition 1. The expected ordering cost per unit time is .
Proof. During a lead time , customer order arrivals are Poisson process.
Thus,
The expectation of customer demands required during is :
Thus, we can infer that the expected ordering cost per unit time is .
3.2. Optimal Policy with Determined by Service Level
In this section, reorder point is predefined by service level . Let represent the c.d.f. of the standard normal distribution with mean 0 and standard deviation 1. Define as the solution to and as the reorder point for a cycle service level of [30, 31].
The order arrivals conform to Poisson process while the customer demand conforms to normal distribution, . Thus the safety stock and reorder point are still determined by the following equations: According to Federgruen and Zheng [2], Hadley and Whitin [1], and Sivazlian [32], in the steady state, . denotes inventory position and inventory level. In this paper, we compute inventory cost based on inventory level.
Thus according to infinitesimal method, during a unit time , the expected inventory cost is
The average cost on an expected order cycle is , is the convex function of , the minimum cost exists.
From model, , and is independent, Notice that when arrives; otherwise can be derived from .
Assume According to Lagrange mean value theorem.
is continuous on interval , According to the assumption , To find solutions to this cubic equation, assume Consider the constraints .
When reaches , Thus : From (16), is the extreme point of (8). However, it still needs to be compared with the two end points in (18) to obtain the minimum of expected average cost.
Thus In this section, we predefine by service level and obtain the expression of optimal . In the following part, we will relax the policy and derive the optimum of and with consideration of the p.d.f of .
3.3. Optimal Policy on and
If we consider the random variability of , then the average cost in (5) is
Proposition 2. The p.d.f of is subject to .
is the p.d.f of order cycle, r.v. ,
Through the following generation, is obtained
The conditional p.d.f of is
The joint probability function of is
Integrate on to get p.d.f of
Thus the proposition is proved.
Thus, in (20) can be written as Traditional optimization method is not easy to find optimum for (19) due to its complexity. Thus we will use genetic algorithm to reach the optimums. , and are selected as input parameters. in (25) is regarded as the objective function. The simulation processes can be illustrated as follows (see Figure 3).
3.4. Extension of the Model
The previous model can be extended for discrete customer demands (see Figure 4).
Assume probability distribution function of demands: .
According to the homogeneity of Poisson process We will also adopt genetic algorithm to obtain the optimal and for discrete demands. The procedures are the same as those in Section 3.2. Numerical analysis will be conducted in Section 4.
4. Numerical Analysis and Insights
To verify the solution, numerical analysis is given with real data obtained from the health care center from January to March, 2013.
Table 1 shows the parameters of the mathematical models. Table 2 shows optimal when is determined by service level. Table 3 reflects the optimal results of genetic algorithm while Table 4 shows the optimization for discrete customer demands.




4.1. Numerical Studies
Assume .
Table 5 is the policy determined by human being in real practice. The inventory manager of the center usually counts on his previous experience to propose the order quantity, while our optimization system is developed on account of mathematical generation. Compared results in Tables 3 and 5, and difference can be found between real practice and optimization system. The expected average cost is generally reduced at around 17~20% with the models introduced in the paper. The inventory manager is usually conservative and reorder point is higher than optimal . When customer demands are considered as discrete in Table 4, the cost is also less than that of real practice. The optimization models provide referenced and for the inventory manager to achieve cost minimization.

4.2. Insights Analysis
Sensitivity analysis is conducted with variation of the input parameters in genetic algorithm to analyze their effect on the optimal results. Take the product of wheelchair raincoat for example.
The increase of increases the ordering cost and thus correspondingly has an increasing effect on the average cost (see Table 6). We find that derived by genetic algorithm also increases. It can be explained that the larger is, the less the ordering cost on each unit increases.

From Table 7, the increase in leads to increase in and . The larger means customer demands per unit time increases. To avoid the occurrence of stockout, and both increase. Thus the average cost increases.

From Table 8, the increase in brings about increases in and average cost. When stockout cost per unit time becomes larger, the shortage cost adds on. To avoid stockout situation, the level of reorder point has to be raised.

From Table 9, the increase of increase inventory cost thus correspondingly has an increasing effect on the average cost. derived by genetic algorithm also increases. It can be explained that larger offsets the increase in the inventory cost on each unit.

5. Conclusion and Future Work
An inventory control system tells us how much to order and when to place the order. Large amounts of research have been made on inventory policy and lots of optimal proposals have been raised for inventory models; however, investigation on the situation of limited inventory capacity is not much, especially under a stochastic environment. In this paper, how to find an optimal order quantity under certain constraints to minimize average cost including inventory and ordering cost is the key issue. We propose an inventory system with restriction on capacity for the case of health care center based on policy. Firstly, we derive the expression of optimal order quantity with polynomial time computational complexity, provided reorder point determined by service level. Secondly, without service level definition, genetic algorithm is proposed to generate optimal and for the capacitated inventory system. Thirdly, we derive a model extension on discrete demands. With comparisons to the results of experiencebased decision on and , the optimal policies we provided lead to an average cost reduction by 17~20%.
In this paper, we discuss the capacitated single item inventory system. However, the resource can be commonly shared across different items, rather than exclusively used in part by a specified item. Then, an optimization problem for multiitem policies with a constraint of such a resource becomes more complex and will be a direction for future research.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
 G. Hadley and T. M. Whitin, Analysis of Inventory Systems, Prentice Hall, Englewood Cliffs, NJ, USA, 1963.
 A. Federgruen and Y. Zheng, “Efficient algorithm for computing an optimal (r, Q) policy in continuous review stochastic inventory systems,” Operations Research, vol. 40, no. 4, pp. 808–813, 1992. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 R. Forsberg, “Exact evaluation of (R, Q)policies for twolevel inventory systems with Poisson demand,” European Journal of Operational Research, vol. 96, no. 1, pp. 130–138, 1997. View at: Publisher Site  Google Scholar
 A. H. Lau, H. S. Lau, and L. W. Robinson, “Convenient expressions for computing the exact annual cost of a continuousreview (Q, R) system with backordering,” Journal of the Operational Research Society, vol. 53, no. 6, pp. 655–663, 2002. View at: Publisher Site  Google Scholar
 Y. Zheng, “On properties of stochastic inventory systems,” Management Science, vol. 38, no. 1, pp. 87–103, 1992. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 J. R. Bradley and P. W. Glynn, “Managing capacity and inventory jointly in manufacturing systems,” Management Science, vol. 48, no. 2, pp. 273–288, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 R. P. Parker and R. Kapuscinski, “Optimal policies for a capacitated twoechelon inventory system,” Operations Research, vol. 52, no. 5, pp. 739–755, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 Ö. Özer and W. Wei, “Inventory control with limited capacity and advance demand information,” Operations Research, vol. 52, no. 6, pp. 988–1000, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 E. L. Plambeck, “Asymptotically optimal control for an assembletoorder system with capacitated component production and fixed transport costs,” Operations Research, vol. 56, no. 5, pp. 1158–1171, 2008. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 S. J. Erlebacher, “Optimal and heuristic solutions for the multiitem newsvendor problem with a single capacity constraint,” Production and Operations Management, vol. 9, no. 3, pp. 303–318, 2000. View at: Google Scholar
 H. Lau and A. H. Lau, “The newsstand problem: a capacitated multipleproduct singleperiod inventory problem,” European Journal of Operational Research, vol. 94, no. 1, pp. 29–42, 1996. View at: Publisher Site  Google Scholar
 E. A. Silver, D. F. Pyke, and R. Peterson, Inventory Management and Production Planning and Scheduling, John Wiley, New York, NY, USA, 1998.
 H. Scarf, A Survey of Analytic Techniques in Inventory Theory, Stanford University Press, Stanford, Calif, USA, 1963.
 J. Song and P. Zipkin, “Inventory control in a fluctuating demand environment,” Operations Research, vol. 41, no. 2, pp. 351–370, 1993. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. Browne and P. Zipkin, “Inventory models with continuous stochastic demands,” Annals of Applied Probability, vol. 1, pp. 419–435, 1991. View at: Google Scholar
 E. A. Silver, “Operations research in inventory management: a review and critique,” Operations Research, vol. 29, no. 4, pp. 628–645, 1981. View at: Publisher Site  Google Scholar  MathSciNet
 S. K. Goyal and A. T. Satir, “Joint replenishment inventory control: deterministic and stochastic models,” European Journal of Operational Research, vol. 38, no. 1, pp. 2–13, 1989. View at: Publisher Site  Google Scholar
 A. Eynan and D. H. Kropp, “Effective and simple EOQlike solutions for stochastic demand periodic review systems,” European Journal of Operational Research, vol. 180, no. 3, pp. 1135–1143, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. A. Tarim and B. G. Kingsman, “Modelling and computing (Rn, Sn) policies for inventory systems with nonstationary stochastic demand,” European Journal of Operational Research, vol. 174, no. 1, pp. 581–599, 2006. View at: Publisher Site  Google Scholar
 M. BenDaya and S. M. Noman, “Integrated inventory and inspection policies for stochastic demand,” European Journal of Operational Research, vol. 185, no. 1, pp. 159–169, 2008. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 J. S. Song, H. Q. Zhang, Y. M. Hou, and M. Z. Wang, “The effect of lead time and demand uncertainties in (r, q) inventory systems,” Operations Research, vol. 58, no. 1, pp. 68–80, 2010. View at: Publisher Site  Google Scholar
 E. Berk and Ü. Gürler, “Analysis of the $(Q,r)$ inventory model for perishables with positive lead times and lost sales,” Operations Research, vol. 56, no. 5, pp. 1238–1246, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 S. Axsäter, “Exact and approximate evaluation of batchordering policies for twolevel inventory systems,” Operations Research, vol. 41, no. 4, pp. 777–785, 1993. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. Axsäter, “Evaluation of installation stock based (R, Q)policies for twolevel inventory systems with poisson demand,” Operations Research, vol. 46, no. 3, pp. 135–145, 1998. View at: Publisher Site  Google Scholar
 S. Axsäter, “Exact analysis of continuous review (R, Q)policies in twoechelon inventory systems with compound Poisson demand,” Operations Research, vol. 48, no. 5, pp. 686–696, 2000. View at: Publisher Site  Google Scholar  MathSciNet
 L. Yang, J. Yang, G. Yu, and H. Q. Zhang, “Nearoptimal (r,Q) policies for a twostage serial inventory system with poisson demand,” International Journal of Production Economics, vol. 133, no. 2, pp. 728–735, 2011. View at: Google Scholar
 D. E. Platt, L. W. Robinson, and R. B. Freund, “Tractable $(Q,R)$ heuristic models for constrained service levels,” Management Science, vol. 43, no. 7, pp. 951–965, 1997. View at: Publisher Site  Google Scholar
 G. Gallego, “New bounds and heuristics for (Q, r) policies,” Management Science, vol. 44, no. 2, pp. 219–233, 1998. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 P. Alstr and P. Alstrøm, “Numerical computation of inventory policies, based on the EOQ/ σx value for orderpoint systems,” International Journal of Production Economics, vol. 71, no. 1–3, pp. 235–245, 2001. View at: Publisher Site  Google Scholar
 E. A. Silver and R. Peterson, Decision Systems for Inventory Management and Production Planning, John Wiley & Sons, New York, NY, USA, 2nd edition, 1985.
 S. Chopra, G. Reinhardt, and M. Dada, “The effect of lead time uncertainty on safety stocks,” Decision Sciences, vol. 35, no. 1, pp. 1–24, 2004. View at: Publisher Site  Google Scholar
 B. D. Sivazlian, “A continuousreview $(s,S)$ inventory system with arbitrary interarrival distribution between unit demand,” Operations Research, vol. 22, no. 1, pp. 65–71, 1974. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
Copyright
Copyright © 2014 An Pan 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.