4.7 Article

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

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 104, 期 -, 页码 124-133

出版社

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

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据