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

交通运输系统工程与信息 ›› 2018, Vol. 18 ›› Issue (5): 88-94.

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

周芳汀^a，张锦^{*a, b}，周国华^c

西南交通大学 a. 交通运输与物流学院；b. 综合交通运输智能化国家地方联合工程实验室； c. 经济管理学院，成都 610031

收稿日期:2018-05-24 修回日期:2018-08-09 出版日期:2018-10-25 发布日期:2018-10-26
作者简介:周芳汀(1993-)，女，四川成都人，博士生.
基金资助:
国家自然科学基金/National Natural Science Foundation of China(71403225).

Subway-based Distribution Network Routing Optimization Problem with Time Windows

ZHOU Fang-ting^a, ZHANG Jin^{a, b}, ZHOU Guo-hua^c

a. School of Transportation and Logistics; b. National United Engineering Laboratory of Integrated and Intelligent Transportation; c. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China

Received:2018-05-24 Revised:2018-08-09 Online:2018-10-25 Published:2018-10-26

摘要/Abstract

摘要：

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

关键词: 综合交通运输, 路径优化问题, 迭代局部搜索算法, 城市配送, 地铁, 时间窗

Abstract:

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.

Key words: integrated transportation, routing optimization problem, iterative local search algorithm, urban distribution, subway, time windows

中图分类号:

U121

周芳汀，张锦，周国华. 带时间窗的地铁配送网络路径优化问题[J]. 交通运输系统工程与信息, 2018, 18(5): 88-94.

ZHOU Fang-ting, ZHANG Jin, ZHOU Guo-hua. Subway-based Distribution Network Routing Optimization Problem with Time Windows[J]. Journal of Transportation Systems Engineering and Information Technology, 2018, 18(5): 88-94.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract19700.shtml

http://www.tseit.org.cn/CN/Y2018/V18/I5/88

参考文献

[1] 周芳汀, 周国华, 张锦. 基于地铁开展城市配送的选点—路径问题[J]. 控制与决策, 2018, 33(7): 1247- 1254. [ZHOU F T, ZHOU G H, ZHANG J. The pointrouting problem of urban distribution based on subway[J]. Control and Decision, 2018, 33(7): 1247- 1254.]

[2] DAMPIER A, MARINOV M. A study of the feasibility and potential implementation of metro- based freight transportation in newcastle upon tyne[J]. Urban Rail Transit, 2015, 1(3): 164-182.

[3] KIKUTA J, ITO T, TOMIYAMA I, et al. New subwayintegrated city logistics system[J]. Procedia- Social and Behavioral Sciences, 2012, 39: 476-489.

[4] DIZIAIN D, TANIGUCHI E, DABLANC L. Urban logistics by rail and waterways in France and Japan[J]. Procedia- Social and Behavioral Sciences, 2014, 125: 159-170.

[5] MASSON R, TRENTINI A, LEHUÉDÉ F, et al. Optimization of a city logistics transportation system with mixed passengers and goods[J]. EURO Journal on Transportation and Logistics, 2017, 6(1): 81-109.

[6] GHILAS V, DEMIR E, VAN WOENSEL T. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines[J]. Computers & Operations Research, 2016, 72: 12-30.

[7] 柴获, 何瑞春, 马昌喜, 等. 求解带硬时间窗车辆路径问题的改进 UMDA 算法[J]. 交通运输系统工程与信息, 2016, 16(2): 176-182. [CHAI H, HE R C, MA C X, et al. A univariate marginal distribution algorithm hybridized with insertion heuristics for the vehicle routing problem with hard time windows[J]. Journal of Transportation Systems Engineering and Information Technology, 2016, 16(2): 176-182.]

[8] CUERVO D P, GOOS P, SÖRENSEN K, et al. An iterated local search algorithm for the vehicle routing problem with backhauls[J]. European Journal of Operational Research, 2014, 237(2): 454-464.

[9] PENNA P H V, SUBRAMANIAN A, OCHI L S. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem[J]. Journal of Heuristics, 2013, 19(2): 201-232.

[10] 包子阳, 余继周, 杨彬. 智能优化算法及其MATLAB实例(第 2 版)[M]. 北京: 电子工业出版社, 2018. [BAO Z Y, YU J Z, YANG B. Intelligent optimization algorithms and MATLAB examples (the second edition) [M]. Beijing: Publishing House of Electronics Industry, 2018.]

[1]	珠兰, 马潇, 刘卓凡. 时间依赖型绿色车辆路径问题研究[J]. 交通运输系统工程与信息, 2021, 21(6): 187-194.
[2]	郑晓彬, 柏赟, 周姗姗. 基于实测数据的地铁列车能耗特征分析[J]. 交通运输系统工程与信息, 2021, 21(6): 264-271.
[3]	吕彪, 管心怡, 高自强. 地铁网络服务韧性评估与最优恢复策略[J]. 交通运输系统工程与信息, 2021, 21(5): 198-205.
[4]	杨静, 吴可, 张红亮, 代盛旭, 王亦乐. 基于土地利用及客流特征的地铁车站分类[J]. 交通运输系统工程与信息, 2021, 21(5): 228-234.
[5]	黄爱玲，徐笑涵，关伟，段梦媛. 基于加权耦合映像格子的地铁网络稳定性演化研究[J]. 交通运输系统工程与信息, 2021, 21(3): 140-149.
[6]	江世雄，蔡灿煌，林宇晨，陈德旺. 天气因素对福州地铁客流的影响分析[J]. 交通运输系统工程与信息, 2021, 21(3): 268-274.
[7]	谢建平，杨坤，张译颢，张海峰，谢宜斌. 长沙地铁万家丽广场站厅仿真及客流优化研究[J]. 交通运输系统工程与信息, 2021, 21(3): 275-281.
[8]	左大杰，肖国胜，王孟云. 产业转移背景下西部运输需求的完全分解模型[J]. 交通运输系统工程与信息, 2020, 20(5): 15-20.
[9]	冯涛，彭其渊，陶思宇，陈昕梅. 站城融合模式下既有铁路车站城市功能开发体量预测研究[J]. 交通运输系统工程与信息, 2020, 20(5): 21-28.
[10]	赵建立，石敬诗，孙秋霞，任玲，刘彩红. 基于混合深度学习的地铁站进出客流量短时预测[J]. 交通运输系统工程与信息, 2020, 20(5): 128-134.
[11]	张洁斐，任刚，马景峰，高瑾瑶，朱形. 基于韧性评估的地铁网络修复时序决策方法[J]. 交通运输系统工程与信息, 2020, 20(4): 14-20.
[12]	叶菲菲，杨隆浩，王应明，蓝以信. 基于数据包络分析和扩展置信规则库的交通运输业环境治理成本预测[J]. 交通运输系统工程与信息, 2020, 20(3): 20-27.
[13]	周晓晔，崔瑶，何亮，马小云，王思聪. 基于地铁—货车联运的物流配送路径优化[J]. 交通运输系统工程与信息, 2020, 20(3): 111-117.
[14]	骆晨，李想，钟林峰，胡姗姗. 基于家庭属性差异的大学生出行方式选择行为研究[J]. 交通运输系统工程与信息, 2020, 20(3): 227-232.
[15]	诸立超，刘昭然. 托运人在不同时空下的选择行为差异揭示[J]. 交通运输系统工程与信息, 2020, 20(1): 27-32.