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

被引:90
作者
Azadeh, A. [1 ,2 ]
Elahi, S. [1 ,2 ]
Farahani, M. Hosseinabadi [3 ]
Nasirian, B. [1 ,2 ]
机构
[1] Univ Tehran, Coll Engn, Sch Ind & Syst Engn, Tehran 14174, Iran
[2] Univ Tehran, Coll Engn, Ctr Excellence Intelligent Based Expt Mech, Tehran 14174, Iran
[3] Univ Texas Dallas, Naveen Jindal Sch Management, Richardson, TX 75083 USA
关键词
Inventory routing problem; Perishable products; Transshipment; Mathematical programming; Genetic algorithm; Taguchi design; TIME-WINDOWS; SCHEDULING PROBLEM; CUT ALGORITHM; VEHICLE; OPTIMIZATION; MODEL; SETUP;
D O I
10.1016/j.cie.2016.12.019
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:124 / 133
页数:10
相关论文
共 54 条
[1]   Heuristic approaches for the inventory-routing problem with backlogging [J].
Abdelmaguid, Tamer F. ;
Dessouky, Maged M. ;
Ordonez, Fernando .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) :1519-1534
[2]  
Abdul Rahim M. K. I., 2014, INT J PROD RES, P1, DOI DOI 10.1049/IET-CDS.2013.0220
[3]   A price-directed approach to stochastic inventory/routing [J].
Adelman, D .
OPERATIONS RESEARCH, 2004, 52 (04) :499-514
[4]   Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) :103-120
[5]   Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model [J].
Al-Khayyal, Faiz ;
Hwang, Seung-June .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) :106-130
[6]   An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem [J].
Anily, S ;
Bramel, J .
DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) :22-39
[7]   A three-dimensional matching model for perishable production scheduling [J].
Arbib, C ;
Pacciarelli, D ;
Smriglio, S .
DISCRETE APPLIED MATHEMATICS, 1999, 92 (01) :1-15
[8]   A branch-and-cut algorithm for a vendor-managed inventory-routing problem [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Laporte, Gilbert ;
Speranza, Maria Grazia .
TRANSPORTATION SCIENCE, 2007, 41 (03) :382-391
[9]   A Hybrid Heuristic for an Inventory Routing Problem [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Hertz, Alain ;
Speranza, M. Grazia .
INFORMS JOURNAL ON COMPUTING, 2012, 24 (01) :101-116
[10]   A lower bound for the split delivery vehicle routing problem [J].
Belenguer, JM ;
Martinez, MC ;
Mota, E .
OPERATIONS RESEARCH, 2000, 48 (05) :801-810