摘要
为了使路网中有限的充电站尽可能满足更多需求,充分发挥电动汽车改变能源消费结构和减少温室气体的优点,提出一个双目标充电站优化选址问题,模型包含两个不可相互转换的目标函数:绕行成本最小化和出行频率最大化。采用参数法将此双目标优化问题转换为一系列具有不同对应系数的目标函数线性组合的单目标优化问题,从而保证了原问题帕累托解集的完整性,并利用分支定界法来求解此算法框架中的单目标优化问题。算例采用长江三角洲城际高速路网的充电站建设,通过对比分析不同方案,证明投资预算限制和电动汽车里程限制对于帕累托解的影响明显不同,其中里程限制的影响更为显著。
To better utilize the limited charging stations in road network,which would reduce petroleum consumption and electric vehicles greenhouse gas emissions,a new bi-objective optimal location model was formulated and solved by a parametric method,including two incomparable objective functions:minimization of detour cost and maximization of trip frequency.The solution set of the problem can be exhausted by repeatedly solving a parameterized scalar problem and updating the parameter set to ensure the set completeness.An efficient branch and bound algorithm was implemented in the framework to solve the parameterized problem,and an intercity highway network in the Yangtze River Delta was used as a case study.By a numerical comparison between different scenarios,it was found that various budget limits and driving ranges differently affect the distribution of Pareto-optimal solutions,whereby the driving ranges have a higher effect.
作者
米阳
MI Yang(School of Naval Architecture,Ocean&Civil Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
出处
《哈尔滨工程大学学报》
EI
CAS
CSCD
北大核心
2018年第8期1264-1268,1342,共6页
Journal of Harbin Engineering University
基金
国家自然科学基金项目(71471111)
关键词
交通运输工程
电动汽车
充电站选址
参数法
帕累托解
分支定界法
最短路问题
transportation engineering
electric vehicles
locations of charging stations
parametric method
Pareto-optimal solutions
branch and bound
shortest path problem
作者简介
通信作者:米阳(1993-),女,硕士研究生.E_mail:MY_SJTU@sjtu.edu.cn.
