The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems

作     者：Li, Hongqi Zhang, Lu Lv, Tan Chang, Xinyu 

作者机构：Beihang Univ Sch Transportat Sci & Engn 37 Xueyuan Rd Beijing 100191 Peoples R China 

出 版 物：《TRANSPORTATION RESEARCH PART B-METHODOLOGICAL》 (运输研究B部分：方法)

年 卷 期：2016年第94卷

页      面：169-188页

核心收录：

学科分类：0201[经济学-理论经济学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0814[工学-土木工程] 0823[工学-交通运输工程] 

基　　金：National Natural Science Foundation of China [71202016, 71672005] China Scholarship Council 

主　　题：Routing Two-echelon Linehaul-delivery system Time-constrained Mixed integer programming model Heuristic 

摘      要：Most of the studies address issues relating to the delivery from satellites to customers, which is throughout the end part of the linehaul-delivery system. Differing from the long-term strategic problems including the two-echelon vehicle routing problem (2E-VRP), the two-echelon location routing problem (2E-LRP) and the truck and trailer routing problem (TTRP) which make location decisions in depots or satellites, the paper introduces a short-term tactical problem named the two-echelon time-constrained vehicle routing problem in linehaul-delivery systems (2E-TVRP) that does not involve location decisions. The line haul level and the delivery level are linked through city distribution centers (CDCs) located on the outskirts of cities. The 2E-TVRP has inter-CDC linehaul on the first level and urban delivery from CDCs to satellites on the second level. Vehicle routes on different levels are interacted by time constraints. A mixed integer nonlinear programming model for the 2E-TVRP is put forward, and a mixed integer linear programming model is used as the benchmark model. The Clarke and Wright savings heuristic algorithm (CW) improved by a local search phase is adopted. The 2E-TVRP formulations and the heuristic algorithm are tested by using 140 randomly-generated instances with up to 10 CDCs and 500 satellites. The computational results indicate that the heuristic can effectively solve various instances of the 2E-TVRP. (C) 2016 Elsevier Ltd. All rights reserved.