4.7 Article

A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment

Journal

COMPUTERS & INDUSTRIAL ENGINEERING
Volume 104, Issue -, Pages 124-133

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2016.12.019

Keywords

Inventory routing problem; Perishable products; Transshipment; Mathematical programming; Genetic algorithm; Taguchi design

Ask authors/readers for more resources

In this paper we present a model of inventory routing problem with transshipment in the presence of a single perishable product. In this problem, vehicle routing and inventory decisions are made simultaneously over the planning horizon to meet customer's demand under maximum level policy. Products are deteriorated at the exponential rate during the time they are stored in the depot or customer's warehouse. Due to the NP-hard nature of the model, we propose a genetic algorithm based approach to solve the problem. Moreover, the proposed algorithm parameters are determined using Taguchi design approach to achieve the best solution. Besides, a numerical example is used to illustrate the validity of the model. To the best of our knowledge, this is the first study that incorporates perishability of the products into inventory routing problem with transshipment, in which the products stocked in the depot or warehouses spoil due to their nature and also environmental issues. (C) 2016 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available