面向绿色节能的智能网联电动车调度方法  

Intelligent Networked Electric Vehicles Scheduling Method for Green Energy Saving

作　　者：陈瑞 沈鑫[3] 万得胜 周恩亦 CHEN Rui;SHEN Xin;WAN Desheng;ZHOU Enyi(College of Computer Science,Chongqing University,Chongqing 400044,China;Key Laboratory of Dependable Service Computing in Cyber Physical Society(Chongqing University),Chongqing 400044,China;Army Logistics University,Chongqing 401331,China)

机构地区：[1]重庆大学计算机学院,重庆400044 [2]信息物理社会可信服务计算教育部重点实验室(重庆大学),重庆400044 [3]解放军陆军勤务学院勤务指挥系,重庆401331

出　　处：《计算机科学》2023年第12期285-293,共9页Computer Science

基　　金：国家自然科学基金(62172063)。

摘　　要：随着新能源电动车的飞速发展,以智能化、网联化、节能化为特点的智能网联电动车具备群体智能的优点,适合执行大规模城市任务,被广泛用于智慧城市的社会服务建设中。为此,以智能网联电动车为研究对象,重点研究电动车群体的城市任务调度问题,主要面临以下挑战:由于城市任务的分配策略与车辆个体执行任务的能力密切相关,在面向车辆群体制定派遣策略时,需要综合考虑车辆个体在其行驶轨迹上所产生的区域效益,以保证车辆在有限电量的约束条件下完成任务并顺利返回。因此,车辆群体派遣策略与车辆个体路径规划方案之间相互影响,是一个带权二分图匹配问题和旅行商问题紧耦合的NP-hard问题。为了解决上述挑战,提出了基于最大权值匹配的车辆派遣算法,首先采用贪心策略为单个车辆在子区域内选择任务路段;然后利用车辆行驶轨迹产生的区域效益,制定车辆与子区域的最优派遣策略,从而最大化区域效益总量。最后,基于四川省成都市238辆智能环卫车30天的作业数据集,对所提算法进行评估。实验结果表明,所提算法的城市道路清扫率相比源数据方法、随机算法和不更新地图算法平均提升了11.2%。With the rapid development of new energy electric vehicles,intelligent networked electric vehicles featuring intelligence,networking,and energy saving not only have the advantages of group intelligence and are suitable for performing large-scale urban tasks,but also are widely used in the construction of social services in smart cities.For this reason,this paper focuses on the urban task dispatching problem for groups of electric vehicles with intelligent networked electric vehicles as the research object,which mainly faces the following challenges:since the urban task dispatching strategy is closely related to the ability of individual vehicles to perform the task,the regional benefits generated by each vehicle on its driving trajectory needs to be consi-dered when developing a dispatching strategy for a group of vehicles to ensure that the vehicles complete their tasks under the constraint of limited power and return.Therefore,the vehicle group dispatching strategy and the individual vehicle path planning scheme interact as a tightly coupled NP-hard problem with a weighted bipartite graph matching problem and a travel quotient problem.To solve the above challenges,a vehicle dispatching algorithm based on maximum weight matching is proposed,which first selects task sections for individual vehicles within sub-regions by employing a greedy strategy.Then,the optimal dispatching strategy for vehicles and sub-regions is developed using the regional benefits generated by vehicle travel trajectories,to maximize the total regional benefits.Finally,the proposed algorithm is evaluated based on a 30-day operation dataset of 238 intelligent sanitation vehicles in Chengdu,Sichuan province.Experimental results show that the proposed algorithm has an average 11.2%improvement in urban road sweeping rate compared to the source data method,the randomized algorithm and the non-updated map algorithm.

关 键 词：智能网联电动车 智慧城市任务 电池电量 派遣策略 路径规划 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]