A Multi-Depot Two-Echelon Vehicle Routing Problem With Urban Logistics Co Delivery System

In recent years,with the popularization of big data,Internet of Things and other technologies in China,logistics information technology is developing rapidly.How to use the core algorithm technology to optimize the vehicle routing of urban logistics joint distribution is a brand-new topic for our in-depth study.As a new modern logistics mode,urban logistics joint distribution has been the first pilot cities in China since 2012.With the increasing demand of urban logistics distribution,how to approach the actual situation of urban logistics joint distribution? In-depth study of vehicle routing mode,further provide a good vehicle routing optimization scheme for logistics companies,reduce the transportation costs of enterprises,it is extremely important to study the multi-depot double-deck vehicle routing problem.Combined the practical application and characteristics of urban logistics distribution,we study the Multi-Depot Two-Echelon Vehicle Routing Problem(MD-TEVRP)in common urban logistics distribution,and a hybrid two stage algorithm for clustering algorithm and artificial bee colony algorithm(HTSA)is constructed.On the one hand,we pay attention to the many-to-many relationship between depots,satellites and customers in the common urban logistics distribution system;On the other hand,we consider the two-level delivery mode which includes the level between depot and satellites and another level between satellites and customers in common urban logistics distribution.Therefore,we use the characteristics of the two problems to skillfully split the Multi-Depot Two-Echelon Vehicle Routing Problem.In the first stage,the customer points are classified and served by the respective depot due to the positional relationship between the yard and the customer point.We simplify the MD-TEVRP into multiple 2E-VRP so that we reduce the complexity of the problem.In the second stage,the artificial bee colony algorithm is used to solve the single 2E-VRP one by one.Finally,the feasibility of the hybrid two-stage algorithm(HTSA)of clustering algorithm and artificial bee colony algorithm in solving the MD-TEVRP is verified by experiments.