杠杆(统计)
布线(电子设计自动化)
排队
静态路由
计算机科学
电动汽车
运筹学
计算机网络
工程类
路由协议
量子力学
机器学习
物理
功率(物理)
作者
Nicholas Kullman,Justin C. Goodson,Jorge E. Mendoza
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2021-03-24
卷期号:55 (3): 637-659
被引量:46
标识
DOI:10.1287/trsc.2020.1018
摘要
We introduce the electric vehicle routing problem with public-private recharging strategy in which vehicles may recharge en route at public charging infrastructure as well as at a privately-owned depot. To hedge against uncertain demand at public charging stations, we design routing policies that anticipate station queue dynamics. We leverage a decomposition to identify good routing policies, including the optimal static policy and fixed-route-based rollout policies that dynamically respond to observed queues. The decomposition also enables us to establish dual bounds, providing a measure of goodness for our routing policies. In computational experiments using real instances from industry, we show the value of our policies to be within 10% of a dual bound. Furthermore, we demonstrate that our policies significantly outperform the industry-standard routing strategy in which vehicle recharging generally occurs at a central depot. Our methods stand to reduce the operating costs associated with electric vehicles, facilitating the transition from internal-combustion engine vehicles.
科研通智能强力驱动
Strongly Powered by AbleSci AI