A single period inventory model of a deteriorating item sold from two shops with shortage via genetic algorithm

Authors

  • S.K. Mondal Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Paschim Midnapore, India
  • J.K. Dey Department of Mathematics, Mahishadal Raj College, Mahishadal, East Midnapur, India
  • M. Maiti Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Paschim Midnapore, India

DOI:

https://doi.org/10.2298/YJOR0701075M

Keywords:

deteriorating item, two shops problem, time dependent demand, single period inventory model, genetic algorithm

Abstract

Inventory of differential units of a deteriorating item purchased in a lot and sold separately from two shops under a single management is considered. Here deterioration increases with time and demands are time- and price-dependent for fresh and deteriorated units respectively. For the fresh units, shortages are allowed and later partially-backlogged. For the deteriorated units, there are two scenarios depending upon whether initial rate of replenishment of deteriorated units is less or more than the demand of these items. Under each scenario, five sub-scenarios are depicted depending upon the time periods of the two-shops. For each sub scenarios, profit maximization problem has been formulated and solved for optimum order quantity and corresponding time period using genetic Algorithm (GA) with Roulette wheel selection, arithmetic crossover and uniform mutation and Generalized Reduced Gradient method (GRG). All sub-scenarios are illustrated numerically and results from two methods are compared. .

References

Bhunia, A.K., and Maiti, M., “A two warehouse inventory model for deteriorating items with a linear trend in demand and shortages”, J. Oper. Res. Soc., 49 (1998) 287-292.

Chang, H.J., and Dye, C.Y., “An EOQ model for deteriorating items with time-varying demand and partial backlogging”, J. Oper. Res. Soc., 50 (1999) 1176-1182.

Davis, L. (ed.), Genetic Algorithms and Simulated Annealing, Pitman Publishing, London, 1987.

Davis, L. (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.

Donaldson, W.A., “Inventory replenishment policy for a linear trend in demand - an analytical solution”, Operational Research Quarterly, 28(1991) 663-670.

Forrest, S. (ed.), Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufnann, California, 1993.

Gelsema, E. (ed.), “Special issue on genetic algorithms”, Pattern Recognition Letters, 16(8) (1995).

Goldberg, D.E., Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley, Massachusetts, 1989.

Hadley, G., and Whitin, T. M., Analysis of Inventory System, Prentice-Hall, England, Cliffs, 1963.

Harris, F., Operations and Costs (Factory Management Series), A.W. Shaw Co, Chicago, 1915, 48-52.

Michalewicz, Z., Genetic Algorithms + Data Structure = Evolution Programs, Springer Verlag, Berlin, 1992.

Naddor, E., Inventory System, John Wiley, New York, 1966.

Pal, S.K., De, S., and Ghosh, A., “Designing hopfield type networks using genetic algorithms and its comparison with simulated annealing”, Int. J. Patt. Prog. Art. Intell, 11 (1997) 447-461.

Wee, H.M., and Wang, W.T., “A variable production scheduling policy for deteriorating item with time-varying demand”, Computers and Operations Research, 26 (1999) 237-244.

Downloads

Published

2007-03-01

Issue

Section

Research Articles