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

被引:80
|
作者
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
相关论文
共 50 条
  • [41] Solving inventory routing with transshipment and substitution under dynamic and stochastic demands using genetic algorithm and deep reinforcement learning
    Achamrah, Fatima Ezzahra
    Riane, Fouad
    Limbourg, Sabine
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (20) : 6187 - 6204
  • [42] A genetic algorithm approach to solving a multiple inventory loading problem
    Smith, JC
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2003, 10 (01): : 45 - 54
  • [43] An asexual genetic algorithm for the general single vehicle routing problem
    Chakroborty, P
    Mandal, A
    ENGINEERING OPTIMIZATION, 2005, 37 (01) : 1 - 27
  • [44] A Novel Hybrid Heuristic Based on Ant Colony Algorithm for Solving Multi-product Inventory Routing Problem
    Oudouar, Fadoua
    Zaoui, El Miloud
    ADVANCED TECHNOLOGIES FOR HUMANITY, 2022, 110 : 519 - 529
  • [45] GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
    Oualid Guemri
    Abdelghani Bekrar
    Bouziane Beldjilali
    Damien Trentesaux
    4OR, 2016, 14 : 377 - 404
  • [46] GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
    Guemri, Oualid
    Bekrar, Abdelghani
    Beldjilali, Bouziane
    Trentesaux, Damien
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2016, 14 (04): : 377 - 404
  • [47] Integrated supplier selection, scheduling, and routing problem for perishable product supply chain: A distributionally robust approach
    Hashemi-Amiri, Omid
    Ghorbani, Fahimeh
    Ji, Ran
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 175
  • [48] Research on Vehicle Routing problem Based on Genetic Algorithm
    Bai, Ke
    PROCEEDINGS OF THE 2015 2ND INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER ENGINEERING AND ELECTRONICS (ICECEE 2015), 2015, 24 : 1415 - 1418
  • [49] GASBOR: A genetic algorithm approach for solving the switchbox routing problem
    Lienig, J
    Thulasiraman, K
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 1996, 6 (04) : 359 - 373
  • [50] Selective Vehicle Routing Problem: A Hybrid Genetic Algorithm Approach
    Posada, Andrea
    Carlos Rivera, Juan
    Palacio, Juan D.
    ARTIFICIAL EVOLUTION, EA 2019, 2020, 12052 : 148 - 161