A hybrid metaheuristic algorithm for location inventory routing problem with time windows and fuel consumption

被引:55
作者
Wu, Weitiao [1 ]
Zhou, Wei [1 ]
Lin, Yue [1 ]
Xie, Yuanqi [1 ]
Jin, Wenzhou [1 ]
机构
[1] South China Univ Technol, Sch Civil Engn & Transportat, Guangzhou 510641, Peoples R China
基金
中国国家自然科学基金;
关键词
Location-inventory-routing problem; Fuel consumption; Hybrid heuristic algorithm; Gradient descent algorithm;
D O I
10.1016/j.eswa.2020.114034
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce a multi-period location-inventory-routing problem with time windows and fuel consumption, which simultaneously optimizes the location, routing, and inventory decisions for both the distribution center and customers in a multi-echelon supply chain. To better reflect reality, the fuel consumption is also incorporated into the variable transportation cost. The problem is formulated as a mixed integer nonlinear programming model. We then propose a two-stage hybrid metaheuristic algorithm to address this problem. In the first stage, a customized genetic algorithm is proposed. In the second stage, a gradient descent algorithm is used to improve the inventory decision to further reduce the total cost. Results of numerical experimentations on generated instances confirm the effectiveness of the algorithm. Results show that inventory management activities contribute considerably to total cost saving. Given the cost trade-off between transportation and inventory, the retailers' inventory level shows more shortages after post-optimization, while the inventory level in the distribution centers can be either reduced or increased, depending on the spatial distribution of retailers in the vicinity of the distribution center. Sensitivity analysis on the model parameters is also conducted to provide managerial insights.
引用
收藏
页数:16
相关论文
共 28 条
[1]  
Augerat, 2009, CVRP INSTANCES
[2]  
Barth M., 2005, Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model
[3]   The Pollution-Routing Problem [J].
Bektas, Tolga ;
Laporte, Gilbert .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (08) :1232-1250
[4]   IMPROVING THE DISTRIBUTION OF INDUSTRIAL GASES WITH AN ONLINE COMPUTERIZED ROUTING AND SCHEDULING OPTIMIZER [J].
BELL, WJ ;
DALBERTO, LM ;
FISHER, ML ;
GREENFIELD, AJ ;
JAIKUMAR, R ;
KEDIA, P ;
MACK, RG ;
PRUTZMAN, PJ .
INTERFACES, 1983, 13 (06) :4-23
[5]   A two-phase algorithm for the cyclic inventory routing problem [J].
Chitsaz, Masoud ;
Divsalar, Ali ;
Vansteenwegen, Pieter .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (02) :410-426
[6]   An adaptive large neighborhood search heuristic for the Pollution-Routing Problem [J].
Demir, Emrah ;
Bektas, Tolga ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :346-359
[7]   Combining service frequency and vehicle routing for managing supplier shipments [J].
Dong, Zhijie ;
Turnquist, Mark A. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 79 :231-243
[8]   An extended robust approach for a cooperative inventory routing problem [J].
Fardi, Keyvan ;
Jafarzadeh-Ghoushchi, Saeid ;
Hafezalkotob, Ashkan .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 116 :310-327
[9]   The time-dependent pollution-routing problem [J].
Franceschetti, Anna ;
Honhon, Dorothee ;
Van Woensel, Tom ;
Bektas, Tolga ;
Laporte, Gilbert .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 56 :265-293
[10]   A hybrid imperialist competitive-simulated annealing algorithm for a multisource multi-product location-routing-inventory problem [J].
Ghorbani, Atiye ;
Jokar, Mohammad Reza Akbari .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 :116-127