<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">ASDS</journal-id><journal-title-group><journal-title>Applied Statistics and Data Science</journal-title></journal-title-group><issn>3066-8433</issn><eissn>3066-8441</eissn><publisher><publisher-name>Art and Technology</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.61369/ASDS.2026080010</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>考虑分时拥堵与返回时限的多车辆同时取送路径优化研究</title><url>https://artdesignp.com/journal/ASDS/2/8/10.61369/ASDS.2026080010</url><author>李美娇</author><pub-date pub-type="publication-year"><year>2026</year></pub-date><volume>2</volume><issue>8</issue><history><date date-type="pub"><published-time>2026-08-20</published-time></date></history><abstract>针对城市快递末端配送中投递与取货并行、道路通行时间随时段变化且车辆需按时回场的作业特征，构建考虑分时拥堵与返回时限的多车辆同时取送路径优化模型。模型以车辆固定成本和分时路网距离成本之和最小为目标，约束客户唯一服务、车辆容量、路径连续、分时时间传播和最大作业时长。为求解该问题，设计插入式构造启发式与改进模拟退火相结合的算法，并通过禁忌记忆和容量辅助候选搜索提升解的多样性。基于真实服务网点得到高德时间&amp;mdash; 距离矩阵，经Solomon 数据集仿真客户需求量，构造TD-SPDP-50算例。结果显示，动态拥堵方案总成本为1275.99元，使用7辆车，最晚返回16:57:47；静态平均速度方案动态复算后最晚返回17:09:26，未满足返回时限。研究表明，分时拥堵建模能够提高路径方案的执行可靠性。</abstract><keywords>同时取送,车辆路径问题,分时拥堵,返回时限,模拟退火</keywords></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>[1] DANTZIG G B, RAMSER J H. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91.[2] SOLOMON M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 254-265.[3] MIN H. The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research Part A: General, 1989, 23(5): 377-386.[4] COKYASAR T, SUBRAMANYAM A, LARSON J, et al. Time-constrained capacitated vehicle routing problem in urban e-commerce delivery[J]. Transportation Research Record: Journal of the Transportation Research Board, 2023, 2677(2): 190-203.[5] 范厚明, 甘兰, 陈天磊, 等. 时变路网及区域限时禁飞下车辆- 无人机同时取送货路径问题[J]. 系统管理学报, 2025, 34(1): 50-67.[6] PRAXEDES A, BULH&amp;Otilde;ES T, SUBRAMANIAN A, et al. A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery[J]. Computers &amp;amp; Operations Research, 2024, 162: 106467.[7] 郭放, 黄志红, 黄卫来. 考虑前置仓选址与服务策略的同时取送货车辆路径问题研究[J]. 系统工程理论与实践, 2021, 41(4): 962-978.[8] 吴腾宇, 张景露, 余海燕. 非对称网络下的在线取送货路径优化问题[J]. 中国管理科学, 2023, 31(9): 214-221.[9] HU Y, LIU J, LI Y, et al. Disruption recovery for pickup and delivery problem with time windows: A scenario-based approach for online food delivery[J]. Computers &amp;amp; Operations Research, 2023, 157: 106282.[10] 孙欣蕊, 李昆鹏, 刘腾博. 考虑订单取件时间和柔性时间窗的取送货车辆路径问题[J]. 运筹与管理, 2022, 31(7): 9-16.[11] ZHOU G, LI D, BIAN J, et al. Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization[J]. Computers &amp;amp; Operations Research, 2024, 167: 106600.[12] 丁秋雷, 刘目康, 胡祥培, 等. 时间窗变动下生鲜品同时取送车辆路径问题的干扰管理方法 [J]. 运筹与管理, 2025, 34 (9): 61-69.[13] 王勇, 罗思妤, 周雪, 等. 多中心共同配送开闭混合式的车辆路径优化问题[J]. 系统管理学报, 2023, 32(2): 215-232.[14] ZHOU S, ZHANG D, YUAN W, et al. Pickup and delivery problem with electric vehicles and time windows considering queues[J]. Transportation Research Part C: Emerging Technologies, 2024, 167: 104829.[15] ZHAO F, SI B, WEI Z, et al. Time-dependent vehicle routing problem of perishable product delivery considering the differences among paths on the congested road[J]. Operational Research, 2023, 23(1): 1-23.</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
