A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods

被引:63
|
作者
Diabat, Ali [1 ]
Abdallah, Tarek [2 ]
Le, Tung [3 ]
机构
[1] Masdar Inst Sci & Technol, Dept Engn Syst & Management, Abu Dhabi, U Arab Emirates
[2] NYU, Stern Sch Business, 44 West Fourth St, New York, NY 10012 USA
[3] LLamasoft Inc, Dept Appl Res, U201 South Main St, Ann Arbor, MI 48104 USA
关键词
Inventory-routing; Perishable goods; Tabu search; Integer programming; SUPPLY CHAIN; ALLOCATION;
D O I
10.1007/s10479-014-1640-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Most of the research on integrated inventory and routing problems ignores the case when products are perishable. However, considering the integrated problem with perishable goods is crucial since any discrepancy between the routing and inventory cost can double down the risk of higher obsolescence costs due to the limited shelf-life of the products. In this paper, we consider a distribution problem involving a depot, a set of customers and a homogeneous fleet of capacitated vehicles. Perishable goods are transported from the depot to customers in such a way that out-of-stock situations never occur. The objective is to simultaneously determine the inventory and routing decisions over a given time horizon such that total transportation cost is minimized. We present a new "arc-based formulation" for the problem which is deemed more suitable for our new tabu search based approach for solving the problem. We perform a thorough sensitivity analysis for each of the tabu search parameters individually and use the obtained gaps to fine-tune the parameter values that are used in solving larger sized instances of the problem. We solve different sizes of randomly generated instances and compare the results obtained using the tabu search algorithm to those obtained by solving the problem using CPLEX and a recently published column generation algorithm. Our computational experiments demonstrate that the tabu search algorithm is capable of obtaining a near-optimal solution in less computational time than the time required to solve the problem to optimality using CPLEX, and outperforms the column generation algorithm for solving the "path flow formulation" of the problem in terms of solution quality in almost all of the considered instances.
引用
收藏
页码:373 / 398
页数:26
相关论文
共 50 条
  • [31] A Hybrid Heuristic for an Inventory Routing Problem
    Archetti, Claudia
    Bertazzi, Luca
    Hertz, Alain
    Speranza, M. Grazia
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (01) : 101 - 116
  • [32] A heuristic (R,T) periodic review perishable inventory model with lead times
    Chiu, HN
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1995, 42 (01) : 1 - 15
  • [33] A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
    Belhaiza, Slim
    Hansen, Pierre
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2014, 52 : 269 - 281
  • [34] A tabu-search-based heuristic for clustering
    Sung, CS
    Jin, HW
    PATTERN RECOGNITION, 2000, 33 (05) : 849 - 858
  • [35] Tabu search heuristic for the undirected selective travelling salesman problem
    Universite de Montreal, Montreal, Canada
    Eur J Oper Res, 2-3 (539-545):
  • [36] Tabu search heuristic for efficiency of dynamic facility layout problem
    Bozorgi, N.
    Abedzadeh, M.
    Zeinali, M.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 77 (1-4): : 689 - 703
  • [37] A tabu search heuristic for the heterogeneous fleet vehicle routing problem
    Gendreau, M
    Laporte, G
    Musaraganyi, C
    Taillard, ÉD
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (12) : 1153 - 1173
  • [38] Mathematical modeling and tabu search heuristic for the traveling tournament problem
    Lee, Jin Ho
    Lee, Young Hoon
    Lee, Yuri Ho
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3, 2006, 3982 : 875 - 884
  • [39] A tabu search heuristic for the heterogeneous fleet vehicle routing problem
    Gendreau, Michel
    Laporte, Gilbert
    Musaraganyi, Christophe
    Taillard, Éric D.
    Computers and Operations Research, 1999, 26 (12): : 1153 - 1173
  • [40] A tabu search heuristic procedure for the capacitated facility location problem
    Minghe Sun
    Journal of Heuristics, 2012, 18 : 91 - 118