首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于时空状态网络的电动物流车辆路径优化方法
引用本文:杨森炎,宁连举,商攀.基于时空状态网络的电动物流车辆路径优化方法[J].交通运输系统工程与信息,2021,21(2):196-204.
作者姓名:杨森炎  宁连举  商攀
作者单位:1. 北京邮电大学,a. 现代邮政学院(自动化学院),b. 经济管理学院,北京 100876; 2. 北京交通大学,交通运输学院,北京 100044
基金项目:国家自然科学基金/National Natural Science Foundation of China(72001029,72001020);中国博士后科学基金/ China Postdoctoral Science Foundation (2019M660566)。
摘    要:针对电动物流车辆续航里程有限与充电基础设施不足的问题,综合考虑电池容量、车辆承载能力、充电站能力、客户服务时间窗、路网空间结构等约束条件,基于离散时空状态网络建立整数线性规划模型。扩展的状态维度可同时表征车辆剩余载重量和剩余电量的时空轨迹。通过对客户服务需求和充电站能力约束进行拉格朗日松弛,并增加二次惩罚项,构建增广拉格朗日模型。经过线性化处理二次目标函数,在块坐标下降框架下,原问题被分解为最短路径子问题,嵌入前向动态规划算法,循环依次求解。惩罚项的引入可以克服解的对称性问题,加快算法的收敛速率。通过计算最优上界与下界之间的间隙,评估可行解的质量。基于Sioux Falls网络构建测试算例,实验结果表明,该方法可以在时间、空间和状态维度上同步优化电动车辆路径和充电决策,可以有效避免车辆绕行充电,节省在途充电时间和配送成本,实现城市电动化物流资源的时空优化配置。

关 键 词:物流工程  车辆路径问题  增广拉格朗日松弛  电动车辆  时空状态网络  
收稿时间:2020-12-28

Electric Logistics Vehicle Routing Optimization Based on Space-time-state Network
YANG Sen-yan,NING Lian-ju,SHANG Pan.Electric Logistics Vehicle Routing Optimization Based on Space-time-state Network[J].Transportation Systems Engineering and Information,2021,21(2):196-204.
Authors:YANG Sen-yan  NING Lian-ju  SHANG Pan
Institution:1.a. School of Modern Post(School of Automation), 1b. School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Abstract:In view of the problems existed in logistic vehicle operations like limited battery capacity and insufficient number of recharging stations, this paper proposes an integer linear programming model for vehicle route optimization based on the discrete time- space- state network. The modeling process considers the constraints of battery capacity, vehicle capacity, recharging station capacity, customer service time window, the spatial structure of road network, and so on. The state dimension is expanded to reflect the spatiotemporal trajectory of both the remaining loads and the remaining electricity of vehicles. The augmented Lagrangian model is established through the Lagrangian relaxation of customer service demand and recharging station capacity constraints, and the quadratic penalty items are added. The quadratic objective function is linearized, and the original problem is transformed as a series of shortest path subproblems, which can be circularly solved by the forward dynamic programming algorithm embedded in the block coordinate descent framework. Adding the penalty terms can break the symmetry problem of solutions and accelerate the convergence rate. The gap between the optimal upper and lower bounds is calculated to evaluate the quality of the feasible solutions. Test examples are constructed based on the Sioux Falls network. The experimental results show that the proposed method can synchronously optimize electric vehicle routing and recharging decisions in time, space and state dimensions, which can effectively avoid vehicles recharge detouring, reduce the recharging time in delivery, reduce the operational costs, and realize the optimal spatial-temporal allocation of urban electric logistics resources.
Keywords:logistics engineering  vehicle routing problem  augmented Lagrangian relaxation  electric vehicles  timespace-state network  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《交通运输系统工程与信息》浏览原始摘要信息
点击此处可从《交通运输系统工程与信息》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号