An Elastic Demand Model for Locating Electric Vehicle Charging Stations

Xu Ouyang, Min Xu, Bojian Zhou
{"title":"An Elastic Demand Model for Locating Electric Vehicle Charging Stations","authors":"Xu Ouyang, Min Xu, Bojian Zhou","doi":"10.1007/s11067-021-09546-5","DOIUrl":null,"url":null,"abstract":"<p>In this study, we aim to optimally locate multiple types of charging stations, e.g., fast-charging stations and slow-charging stations, for maximizing the covered flows under a limited budget while taking drivers’ partial charging behavior and nonlinear demand elasticity into account. This problem is first formulated as a mixed-integer nonlinear programming model. Instead of generating paths and charging patterns, we develop a compact formulation to model the partial charging logic. The proposed model is then approximated and reformulated by a mixed-integer linear programming model by piecewise linear approximation. To improve the computational efficiency, we employ a refined formulation using an efficient Gray code method, which reduces the number of constraints and binary auxiliary variables in the formulation of the piecewise linear approximate function effectively. The ε-optimal solution to the proposed problem can be therefore obtained by state-of-the-art MIP solvers. Finally, a case study based on the highway network of Zhejiang Province of China is conducted to assess the model performance and analyze the impact of the budget on flow coverage and optimal station selection.</p>","PeriodicalId":501141,"journal":{"name":"Networks and Spatial Economics","volume":"74 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks and Spatial Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11067-021-09546-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this study, we aim to optimally locate multiple types of charging stations, e.g., fast-charging stations and slow-charging stations, for maximizing the covered flows under a limited budget while taking drivers’ partial charging behavior and nonlinear demand elasticity into account. This problem is first formulated as a mixed-integer nonlinear programming model. Instead of generating paths and charging patterns, we develop a compact formulation to model the partial charging logic. The proposed model is then approximated and reformulated by a mixed-integer linear programming model by piecewise linear approximation. To improve the computational efficiency, we employ a refined formulation using an efficient Gray code method, which reduces the number of constraints and binary auxiliary variables in the formulation of the piecewise linear approximate function effectively. The ε-optimal solution to the proposed problem can be therefore obtained by state-of-the-art MIP solvers. Finally, a case study based on the highway network of Zhejiang Province of China is conducted to assess the model performance and analyze the impact of the budget on flow coverage and optimal station selection.

电动汽车充电站选址的弹性需求模型
在考虑驾驶员局部充电行为和非线性需求弹性的前提下,以在有限的预算下实现覆盖流量最大化为目标,对快速充电站和慢速充电站等多种充电站进行优化配置。该问题首先被表述为一个混合整数非线性规划模型。我们不是生成路径和充电模式,而是开发了一个紧凑的公式来模拟部分充电逻辑。然后用分段线性逼近的混合整数线性规划模型对所提出的模型进行近似和重新表述。为了提高计算效率,我们采用了一种使用高效Gray编码方法的精炼公式,有效地减少了分段线性近似函数公式中的约束和二元辅助变量的数量。因此,该问题的ε-最优解可以通过最先进的MIP求解器得到。最后,以浙江省公路网为例,对模型的性能进行了评价,并分析了预算对流量覆盖率和最优站点选择的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信