检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李建华[1] 王泽鼎 LI Jian-hua;WANG Ze-ding(School of Architecture&Art Design,Hebei University of Technology,Tianjin 300130,China)
机构地区:[1]河北工业大学建筑与艺术设计学院,天津300130
出 处:《吉林大学学报(工学版)》2023年第8期2298-2303,共6页Journal of Jilin University:Engineering and Technology Edition
基 金:河北省自然科学基金项目(E2019202449).
摘 要:针对充电桩选点规划存在单一因素局部求解局限的问题,提出一种考虑路径耗时的城市汽车分布式规划算法。从空间和时间两个维度上分析汽车对充电负荷要求,求得充电高峰时间作为规划参照条件之一。通过GIS技术采集城市道路电动汽车充电的排队数据,建立路径耗时最短的目标函数,计算在一天中不同时间段内排队等待概率值和当下电力峰值,推导得出电力稳态方程,求解得到负荷目标函数、电力峰值最低和排队最小概率的阈值,以此作为规划目标。对路面线路和地下电力线路实施电力路径和行驶路径演算,不断迭代查找最优解,直至符合目标值结束演算。实验证明,本文算法达到目标函数所需的迭代次数为275次。经该方法规划充电桩选点后,可以保证各节点的电力分配均匀,规划方案符合实际运行情况,适应能力强且算法所需运算量小。Aiming at the problem that there is a single factor local solution limitation in the planning of charging piles,a distributed planning algorithm for urban vehicles considering the path time-consuming is proposed.From the two dimensions of space and time,the vehicle's charging load requirements are analyzed,and the charging peak time is obtained as one of the planning reference conditions.Collect the queuing data of electric vehicle charging on urban roads through GIS technology,establish the objective function with the shortest path time,calculate the queuing probability value and the current power peak value in different time periods of the day,derive the power steady state equation,and solve the load The objective function,the threshold for the minimum power peak and the minimum probability of queuing,are used as planning goals.The power path and driving path calculation is implemented for road lines and underground power lines,and the optimal solution is continuously iteratively searched until the target value is met and the calculation is completed.Experiments show that the number of iterations required by the proposed algorithm to achieve the objective function is 275 times.And after the charging piles are planned and selected by this method,it can ensure that the power distribution of each node is even,the planning scheme is in line with the actual operation situation,the adaptability is strong,and the calculation amount required by the algorithm is small.
关 键 词:交通运输系统工程 路径耗时 充电高峰 目标函数 分布式充电桩 路径演算
分 类 号:U491.1[交通运输工程—交通运输规划与管理] TK51[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49