Please use this identifier to cite or link to this item: http://localhost:80/xmlui/handle/123456789/569
Title: Two storage inventory model with random planning horizon
Authors: Maiti, A.K.
Maiti, M.K.
Maiti, M.
Keywords: Region reducing genetic algorithm
Random planning horizon
Two storage inventory
Issue Date: 2006
Publisher: Applied Mathematics and Computation (Elsevier)
Abstract: An inventory model with stock-dependent demand and two storage facilities under inflation and time value of money is developed where the planning horizon is stochastic in nature and follows exponential distribution with a known mean. The model is a order-quantity reorder-point problem where shortages are not allowed. Two rented storehouses are used for storage – one (say RW1) at the heart of the market place and the other (say RW2) little away from the market place. At the beginning, the item is stored at both RW1 and RW2. The item is sold from RW1 and as the demand is stock-dependent, the units are continuously released from RW2 to RW1. Replacement of the item occurs when its inventory level reaches its reorder point (Qr). The model is formulated to maximize the total expected proceeds out of the system from the planning horizon. A genetic algorithm (GA) is developed based on entropy theory where region of search space is gradually decreases to a small neighborhood of the optima. This is named as region reducing genetic algorithm (RRGA) and is used to solve the model. The model is illustrated with some numerical examples and some sensitivity analyses have been done.
URI: http://111.93.204.14:8080/xmlui/handle/123456789/569
ISSN: 0096-3003
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
AMC2_Ajoy.pdf257.26 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.