Please use this identifier to cite or link to this item: http://111.93.204.14:8080/xmlui/handle/123456789/576
Title: A two warehouse deterministic inventory model for deteriorating items with a linear trend in time dependent demand over finite time horizon by Elitist Real-Coded Genetic Algorithm
Authors: Bhunia, A.K.
Shaikh, Ali Akbar
Maiti, A.K.
Maiti, M.
Keywords: Inventory management
Two-storage
Deterioration
Genetic algorithm
Partial backlogging
Finite time horizon
Issue Date: 2013
Publisher: International Journal of Industrial Engineering Computations (Growing Science Ltd.)
Abstract: This paper deals with a deterministic inventory model developed for deteriorating items having two separate storage facilities (owned and rented warehouses) due to limited capacity of the existing storage (owned warehouse) with linear time dependent demand (increasing) over a fixed finite time horizon. The model is formulated with infinite replenishment and the successive replenishment cycle lengths are in arithmetic progression. Partially backlogged shortages are allowed. The stocks of rented warehouse (RW) are transported to the owned warehouse (OW) in continuous release pattern. For this purpose, the model is formulated as a constrained non-linear mixed integer programming problem. For solving the problem, an advanced genetic algorithm (GA) has been developed. This advanced GA is based on ranking selection, elitism, whole arithmetic crossover and non-uniform mutation dependent on the age of the population. Our objective is to determine the optimal replenishment number, lot-size of two-warehouses (OW and RW) by maximizing the profit function. The model is illustrated with four numerical examples and sensitivity analyses of the optimal solution are performed with respect to different parameters.
URI: http://111.93.204.14:8080/xmlui/handle/123456789/576
ISSN: 1923-2934
1923-2926
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
IJIEC_2013_4_ajoy.pdf180.27 kBAdobe PDFView/Open


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