基于实际路网情境的配送车辆调度优化
摘要: 在实际路网情境下结合车道数、车道宽度、路口信号灯设置等路网物理特性,构建了考虑综合交通阻抗的多车型车辆调度模型,提出了两阶段求解策略:第1阶段设计了改进A-star精确解算法用于计算客户时间距离矩阵;第2阶段针对实际路网的特征设计了混合模拟退火算法求解调度方案。以大连市某配送中心运营实例进行路网情境仿真试验,结果表明:改进A-star算法较改进Dijkstra算法具有更短的路径搜索时间;混合模拟退火算法求解结果较实际调度方案优化了13.1% 的综合成本;路网增流、区域拥堵和路段禁行三类路网情境均能对配送方案的车辆配置、路径选择、客户服务次序、作业时间和违约费用等5方面内容产生干扰,调度计划的制定需要详细考虑这些因素的变化。
关键词: 实际路网, 车辆调度, 时间距离矩阵, 改进A-star算法, 混合模拟退火算法
Abstract: In urban road network, more physical differences should be considered to measure the comprehensive traffic impedance, such as number and width of lanes in each road and crossing light working rule in each intersections. On this basis, this paper gives a scheduling mathematical model with multiple types of vehicles. A two-stage algorithm is put forward to solve the model. At first stage, an improving A-star search algorithm is designed to calculate the exact time passed matrix. At second stage, a hybrid simulated annealing algorithm is designed to find scheduling scheme. Selecting one of Dalian distribution centers as actual case, the experimental results are used to verify performance of algorithm and analyze scheduling scheme changes in different network situations. Analysis result shows improving A-star search algorithm has faster speed than the Dijkstra signature improving algorithm which ever use. The comprehensive cost of scheduling scheme founded by simulated annealing algorithm has an 13.1% reduction than actual operation scheme. Three changes in urban road network conditions such as the increase of road network flow, the congestion of some areas and the ban of some roads passing, can disturb five parts in distribution scheme, which are vehicle configuration plan, route selection plan, customer service sequence, vehicle operation time and default cost from unpunctuality. The numerical result proposes that the changes in urban road network conditions should be considered in details before planning a scheduling scheme.
Key words: Urban network, Vehicle scheduling, Time-distance Matrix, Improved A-star algorithm, Hybrid simulated annealing algorithm
中图分类号:
U492.2+2
相关知识
基于实际路网情境的配送车辆调度优化
多点物流配送车辆路径问题(VRP)优化与实证分析
物流运输流程优化怎么提高配送效率?
基于动态交通网络的城市物流配送路径优化研究
【物流配送中的最短路径算法】:优化配送,降低成本
基于多目标优化的物流配送路径规划方法
企业运输优化的本质及步骤方向
城市花卉配送网络布局优化
基于静态博弈论的物流配送中心选址优化研究
【优化求解】基于动态全局搜索和柯西变异改进的花授粉算法matlab源码
网址: 基于实际路网情境的配送车辆调度优化 https://www.huajiangbk.com/newsview2148554.html
上一篇: 订单农业+智能物流:盒马如何打造 |
下一篇: “第一公里”和“最后一公里”难题 |
推荐分享

- 1君子兰什么品种最名贵 十大名 4012
- 2世界上最名贵的10种兰花图片 3364
- 3花圈挽联怎么写? 3286
- 4迷信说家里不能放假花 家里摆 1878
- 5香山红叶什么时候红 1493
- 6花的意思,花的解释,花的拼音 1210
- 7教师节送什么花最合适 1167
- 8勿忘我花图片 1103
- 9橄榄枝的象征意义 1093
- 10洛阳的市花 1039