Abstract
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time–dependent demand and backlogging rates, limited or infinite warehouse capacity and taking into account the time value of money. The algorithm is based on Particle Swarm Optimization and it is capable of computing the number of replenishment cycles as well as the corresponding shortage and replenishment instances concurrently, thereby alleviating the heavy computational burden posed by the analytical solution of the problem through the Kuhn–Tucker approach. The proposed technique does not require any gradient information but cost function values solely, while a penalty function is employed to address the cases of limited warehouse capacity. Experiments are conducted on models proposed in the relative literature, justifying the usefulness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ghare, P.M., Shrader, G.F.: A model for exponentially decying inventories. J. Ind. Eng. 14, 238–243 (1963)
Covert, R.P., Philip, G.C.: An EOQ model for items with Weibull distribution deterioration. Am. Inst. Ind. Eng. Trans. 5, 323–326 (1973)
Tadikamalla, P.R.: An EOQ inventory model for items with Gamma distribution. AIIE Trans. 5, 100–103 (1978)
Resh, M., Friedman, M., Barbosa, L.C.: On a general solution of the deterministic lot size problem with time–proportional demand. Oper. Res. 24, 718–725 (1976)
Donaldson, W.A.: Inventory replenishment policy for a linear trend in demand: An analytical solution. Oper. Res. Quart. 28, 663–670 (1977)
Goyal, S.K., Giri, B.C.: Recent trends in modeling of deteriorating inventory. Eur. J. Oper. Res. 134, 1–16 (2001)
Raafat, F.: Survey of literature on continuously deteriorating inventory model. J. Oper. Res. Soc. 42, 27–37 (1991)
Chang, H.J., Dye, C.Y.: An EOQ model for deteriorating items with time varying demand and partial backlogging. J. Oper. Res. Soc. 50, 1176–1182 (1999)
Skouri, K., Papachristos, S.: A continuous review inventory model, with deteriorating items, time–varying demand, linear replenishment cost, partially time–varying backlogging. Applied Mathematical Modelling 26, 603–617 (2002)
Teng, J.T., Chang, H.J., Dye, C.Y., Hung, C.H.: An optimal replenishment policy for deteriorating items with time–varying demand and partial backlogging. Oper. Res. Let. 30, 387–393 (2002)
Chern, M.S., Yang, H.L., Teng, J.T., Papachristos, S.: Partial backlogging inventory lot–size models for deteriorating items with fluctuating demand under inflation. European Journal of Operational Research (in press 2007)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th Symp. Micro Machine and Human Science, pp. 39–43 (1995)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Int. Conf. Neural Networks, vol. IV, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Chichester (2006)
Parsopoulos, K.E., Vrahatis, M.N.: Recent approaches to global optimization problems through particle swarm optimization. Natural Computing 1(2–3), 235–306 (2002)
Parsopoulos, K.E., Vrahatis, M.N.: On the computation of all global minimizers through particle swarm optimization. IEEE Transactions on Evolutionary Computation 8(3), 211–224 (2004)
Kennedy, J.: Small worlds and mega–minds: Effects of neighborhood topology on particle swarm performance. In: Proc. IEEE Congr. Evol. Comput., Washington, D.C., USA, pp. 1931–1938. IEEE Press, Los Alamitos (1999)
Suganthan, P.N.: Particle swarm optimizer with neighborhood operator. In: Proc. IEEE Congr. Evol. Comput., Washington, D.C., USA, pp. 1958–1961 (1999)
Clerc, M., Kennedy, J.: The particle swarm–explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)
O´Neill, M., Leahy, F., Brabazon, A.: Grammatical swarm: A variable–length particle swarm algorithm. In: Nedjah, N., Macedo Mourelle, L. (eds.) Studies in Computational Intelligence, vol. 26, pp. 59–74. Springer, Heidelberg (2006)
Laskari, E.C., Parsopoulos, K.E., Vrahatis, M.N.: Particle swarm optimization for integer programming. In: Proceedings of the IEEE 2002 Congress on Evolutionary Computation, Hawaii (HI), USA, pp. 1582–1587. IEEE Press, Los Alamitos (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parsopoulos, K.E., Skouri, K., Vrahatis, M.N. (2008). Particle Swarm Optimization for Tackling Continuous Review Inventory Models. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-78761-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78760-0
Online ISBN: 978-3-540-78761-7
eBook Packages: Computer ScienceComputer Science (R0)