A combined GA-TS algorithm for two-echelon dynamic vehicle routing with proactive satellite stations

被引:20
作者
Xue, Guiqin [1 ]
Wang, Yong [2 ]
Guan, Xiangyang [3 ]
Wang, Zheng [1 ]
机构
[1] Dalian Maritime Univ, Sch Maritime Econ & Management, Dalian 116000, Peoples R China
[2] Chongqing Jiaotong Univ, Sch Econ & Management, Chongqing 400074, Peoples R China
[3] Univ Washington, Dept Civil & Environm Engn, Seattle, WA 98195 USA
关键词
Proactive satellite stations; Dynamic customer demands; Two-echelon dynamic vehicle routing problem; Hybrid algorithm; Make-to-stock strategy; TABU SEARCH; NEIGHBORHOOD SEARCH; GENETIC ALGORITHM; TIME; DELIVERY; CAPACITY; MODELS;
D O I
10.1016/j.cie.2021.107899
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The make-to-stock strategy can improve the operational efficiency of urban freight delivery, especially in a dynamic transportation system with idle storage resources. This study proposes a two-echelon dynamic vehicle routing problem with proactive satellite stations (2E-DVRP-PSSs), which converts customers with available idle storage to satellite stations and optimizes the operating cost and make-to-stock cost. In 2E-DVRP-PSSs, heavy trucks depart from the depot, serve original static customers and proactive satellite stations (PSSs), and then return to the depot in the first-echelon network. In the second-echelon network, light vehicles depart from the PSSs to serve the dynamic customer demands. To compute the delivery mutes efficiently, a hybrid algorithm integrating the cutting plane and improved genetic algorithm-tabu search (GA-TS) algorithm is proposed and implemented. An exact method using Gurobi solver and an improved GA-TS algorithm with multiply optimization strategies are also incorporated. Furthermore, the effectiveness of the 2E-DVRP-PSS formulation and the applicability of the hybrid algorithm for various instances are experimentally evaluated. An empirical case study of a two-echelon dynamic network in Dalian, China indicates that the proposed make-to-stock strategy with the PSS network can reduce costs and improve the efficiency of operations in urban transportation networks.
引用
收藏
页数:21
相关论文
共 53 条
[1]   How do network resources affect firms' network-oriented dynamic capabilities? [J].
Alinaghian, Leila ;
Razmdoost, Kamran .
INDUSTRIAL MARKETING MANAGEMENT, 2018, 71 :79-94
[2]   Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search [J].
Alinaghian, Mandi ;
Shokouhi, Nadia .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2018, 76 :85-99
[3]   Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems [J].
Applegate, D ;
Bixby, R ;
Chvátal, V ;
Cook, W .
MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) :91-153
[4]   An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Roberti, Roberto ;
Clavo, Roberto Wolfler .
OPERATIONS RESEARCH, 2013, 61 (02) :298-314
[5]   Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach [J].
Belgin, Onder ;
Karaoglan, Ismail ;
Altiparmak, Fulya .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 :1-16
[6]   Dynamic pickup and delivery problems [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) :8-15
[7]   Warehousing in the e-commerce era: A survey [J].
Boysen, Nils ;
de Koster, Rene ;
Weidinger, Felix .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (02) :396-411
[8]   Waiting' strategies for dynamic vehicle routing [J].
Branke, J ;
Middendorf, M ;
Noeth, G ;
Dessouky, M .
TRANSPORTATION SCIENCE, 2005, 39 (03) :298-312
[9]   Optimal joint replenishment, delivery and inventory management policies for perishable products [J].
Coelho, Leandro C. ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 47 :42-52
[10]   The inventory-routing problem with transshipment [J].
Coelho, Leandro C. ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) :2537-2548