带时间窗的地铁配送网络路径优化问题

Subway-based Distribution Network Routing Optimization Problem with Time Windows

为应对人们日益增加的货物需求与货车进城难题,提出整合地铁网和道路交通网,形成以地铁列车和城市配送车辆为载体的地铁配送网络.考虑列车开行时间表、客户服务时间窗、城市配送车辆容量等限制条件,构建带时间窗的地铁配送网络路径优化模型,综合优化地铁列车班次的客户分配、出站点的客户分配及末端配送路径.设计随机变邻域的迭代搜索算法(ILS-RVND)进行求解,以成都市地铁3号线运输货物为例,验证了模型和算法的实用性和有效性.结果表明,地铁配送网络配送成本低,准时性高,配送车辆行驶距离短,能满足比货车单独配送更精准的服务需求.

In order to cope with the increasing freight demand and the driving problems of trucks,the subway distribution network based on trains and distribution vehicles is put forward,which integrated both subway network and road network.Considering the restrictions on train schedule,customer service time windows,and distribution vehicles capacity,the routing optimization model with time windows under subway-based distribution network is constructed.The model aimed at optimizing the customer assignment in each train and export station,and the route of terminal distribution.An iterative search algorithm with random variable neighborhoods is designed to solve the problem.The practicality and efficiency of the model and algorithm are verified by case of subway line 3 in Chengdu,China.The results show that the subway distribution network can satisfy more precise service requirements than truck distribution because of lower distribution cost,higher punctuality and shorter distribution distance.