Charging Station Location and Sizing for Electric Vehicles Under Congestion

尺寸 双层优化 数学优化 排队 计算机科学 概率逻辑 充电站 水准点(测量) 位置模型 服务(商务) 排队论 电动汽车 运筹学 最优化问题 工程类 计算机网络 数学 功率(物理) 艺术 物理 大地测量学 经济 量子力学 人工智能 经济 视觉艺术 地理
作者
Ömer Burak Kınay,Fatma Gzara,Sibel A. Alumur
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
被引量:5
标识
DOI:10.1287/trsc.2021.0494
摘要

This paper studies the problem of determining the strategic location of charging stations and their capacity levels under stochastic electric vehicle flows and charging times taking into account the route choice response of users. The problem is modeled using bilevel optimization, where the network planner or leader minimizes the total infrastructure cost of locating and sizing charging stations while ensuring a probabilistic service requirement on the waiting time to charge. Electric vehicle users or followers, on the other hand, minimize route length and may be cooperative or noncooperative. Their choice of route in turn determines the charging demand and waiting times at the charging stations and hence, the need to account for their decisions by the leader. The bilevel problem reduces to a single-level mixed-integer model using the optimality conditions of the follower’s problem when the charging stations operate as M/M/c queues and the followers are cooperative. To solve the bilevel model, a decomposition-based solution methodology is developed that uses a new logic-based Benders algorithm for the location-only problem. Computational experiments are performed on benchmark and real-life highway networks, including a new eastern U.S. network. The impact of route choice response, service requirements, and deviation tolerance on the location and sizing decisions are analyzed. The analysis demonstrates that stringent service requirements increase the capacity levels at open charging stations rather than their number and that solutions allowing higher deviations are less costly. Moreover, the difference between solutions under cooperative and uncooperative route choices is more significant when the deviation tolerance is lower. History: This paper has been accepted for the Transportation Science Special Issue on 2021 TSL Workshop: Supply and Demand Interplay in Transport and Logistics. Funding: This research was supported by the Ontario Graduate Scholarship when Ö. B. Kınay was a PhD candidate at the University of Waterloo, and this support is acknowledged. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2021.0494 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
Daisy1011发布了新的文献求助10
1秒前
1秒前
Tong发布了新的文献求助10
2秒前
子车茗应助申申采纳,获得10
3秒前
桐桐应助忧郁绣连采纳,获得10
5秒前
清脆慕山发布了新的文献求助10
5秒前
朴实凡柔发布了新的文献求助10
6秒前
李健应助贺艳芳采纳,获得10
6秒前
6秒前
Rita应助笨笨小刺猬采纳,获得10
7秒前
7秒前
从容万恶发布了新的文献求助10
11秒前
儒雅谷芹发布了新的文献求助10
11秒前
笑啦啦发布了新的文献求助10
11秒前
lyyyy发布了新的文献求助10
12秒前
Daisy1011完成签到,获得积分10
12秒前
伊森完成签到,获得积分10
12秒前
14秒前
菠萝披萨完成签到,获得积分10
14秒前
李爱国应助热塑性哈士奇采纳,获得10
15秒前
zzd发布了新的文献求助20
16秒前
17秒前
awen完成签到,获得积分10
19秒前
大气的寻桃完成签到,获得积分10
19秒前
Owen应助科研不算楠采纳,获得10
20秒前
20秒前
服部平次发布了新的文献求助10
20秒前
科研靓仔完成签到,获得积分10
21秒前
能能发布了新的文献求助10
22秒前
lzjz发布了新的文献求助10
22秒前
科研靓仔发布了新的文献求助10
23秒前
笑啦啦完成签到,获得积分10
24秒前
儒雅谷芹完成签到,获得积分10
24秒前
Aliofyou发布了新的文献求助10
24秒前
shamy夫妇完成签到,获得积分10
25秒前
aha发布了新的文献求助30
25秒前
vvvvvv发布了新的文献求助10
26秒前
qwt完成签到,获得积分10
26秒前
高分求助中
Lire en communiste 1000
Ore genesis in the Zambian Copperbelt with particular reference to the northern sector of the Chambishi basin 800
Mantiden: Faszinierende Lauerjäger Faszinierende Lauerjäger 700
PraxisRatgeber: Mantiden: Faszinierende Lauerjäger 700
Becoming: An Introduction to Jung's Concept of Individuation 600
Evolution 3rd edition 500
Die Gottesanbeterin: Mantis religiosa: 656 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3171185
求助须知:如何正确求助?哪些是违规求助? 2822095
关于积分的说明 7938128
捐赠科研通 2482611
什么是DOI,文献DOI怎么找? 1322672
科研通“疑难数据库(出版商)”最低求助积分说明 633669
版权声明 602627