自助充电站和第三方充电站代客充电服务的路径规划

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Tianyi Zhao;Na Li
{"title":"自助充电站和第三方充电站代客充电服务的路径规划","authors":"Tianyi Zhao;Na Li","doi":"10.1109/TASE.2025.3551799","DOIUrl":null,"url":null,"abstract":"Many electric vehicle (EV) companies have begun providing energy replenishment services to EV owners. Valet-charging is one such service where valet-staff are dispatched to substitute for EV owners in charging their EVs. This paper considers a routing scheduling problem for the service. We explore the charging options available at both the service provider’s self-operating charging stations and third-party charging stations. We formulate the problem via a robust optimization framework to capture the uncertain waiting time at the third-party stations. A Partial-Branch-and-Price algorithm (PB&B) is designed to solve the problem to optimal efficiently for large scales. Specifically, we innovatively proposed acceleration methods to speed up our extended robust labelling algorithm within the PB&B. We conduct a case study to show the effect of uncertainty in detail and provide investment suggestions for the firm’s investment on whether to contract a third-party charging station. Note to Practitioners—The inconvenience of charging has received significant attention for EVs, and energy replenishment services offer an effective approach beyond infrastructure expansion. Valet-charging, first introduced by NIO Inc., followed by FAW-Volkswagen and NETA AUTO, represents a notable attempt in this direction. Valet-staff routing scheduling needs to consider station assignment decisions, which introduces another potential issue: the number of charging stations owned by valet-charging service providers is insufficient. Including third-party charging stations with uncertain waiting times complicates this issue further. We believe our work develops an effective tool for valet-charging service providers to handle routing scheduling with both types of stations and analyze the investment value on charging stations.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"13341-13358"},"PeriodicalIF":6.4000,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Routing Scheduling for Valet-Charging Service With Self-Operating and Third-Party Charging Stations\",\"authors\":\"Tianyi Zhao;Na Li\",\"doi\":\"10.1109/TASE.2025.3551799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many electric vehicle (EV) companies have begun providing energy replenishment services to EV owners. Valet-charging is one such service where valet-staff are dispatched to substitute for EV owners in charging their EVs. This paper considers a routing scheduling problem for the service. We explore the charging options available at both the service provider’s self-operating charging stations and third-party charging stations. We formulate the problem via a robust optimization framework to capture the uncertain waiting time at the third-party stations. A Partial-Branch-and-Price algorithm (PB&B) is designed to solve the problem to optimal efficiently for large scales. Specifically, we innovatively proposed acceleration methods to speed up our extended robust labelling algorithm within the PB&B. We conduct a case study to show the effect of uncertainty in detail and provide investment suggestions for the firm’s investment on whether to contract a third-party charging station. Note to Practitioners—The inconvenience of charging has received significant attention for EVs, and energy replenishment services offer an effective approach beyond infrastructure expansion. Valet-charging, first introduced by NIO Inc., followed by FAW-Volkswagen and NETA AUTO, represents a notable attempt in this direction. Valet-staff routing scheduling needs to consider station assignment decisions, which introduces another potential issue: the number of charging stations owned by valet-charging service providers is insufficient. Including third-party charging stations with uncertain waiting times complicates this issue further. We believe our work develops an effective tool for valet-charging service providers to handle routing scheduling with both types of stations and analyze the investment value on charging stations.\",\"PeriodicalId\":51060,\"journal\":{\"name\":\"IEEE Transactions on Automation Science and Engineering\",\"volume\":\"22 \",\"pages\":\"13341-13358\"},\"PeriodicalIF\":6.4000,\"publicationDate\":\"2025-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Automation Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10929050/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10929050/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

许多电动汽车公司已经开始为电动汽车车主提供能源补充服务。代客充电就是派遣代客服务人员代替车主为电动汽车充电的一种服务。本文研究了服务的路由调度问题。我们探讨了服务提供商的自营充电站和第三方充电站的充电选择。我们通过一个鲁棒优化框架来制定问题,以捕获第三方站点的不确定等待时间。设计了一种局部分支价格算法(PB&B)来有效地解决大规模的最优问题。具体来说,我们创新地提出了加速方法来加速我们在PB&B内扩展的鲁棒标记算法。通过案例分析,详细展示了不确定性的影响,并为企业投资是否签约第三方充电站提供投资建议。从业者注意:充电的不便已经引起了电动汽车的极大关注,而能量补充服务提供了一种超越基础设施扩建的有效方法。代客充电首先由蔚来汽车公司推出,随后一汽-大众和网达汽车也推出了代客充电服务,这是一个值得注意的尝试。代客服务人员的路线调度需要考虑站点分配决策,这就引入了另一个潜在的问题:代客服务提供商拥有的充电站数量不足。包括等待时间不确定的第三方充电站,使这个问题进一步复杂化。我们相信,我们的工作为代客充电服务提供商提供了一个有效的工具,可以处理两种类型充电站的路线调度,并分析充电站的投资价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing Scheduling for Valet-Charging Service With Self-Operating and Third-Party Charging Stations
Many electric vehicle (EV) companies have begun providing energy replenishment services to EV owners. Valet-charging is one such service where valet-staff are dispatched to substitute for EV owners in charging their EVs. This paper considers a routing scheduling problem for the service. We explore the charging options available at both the service provider’s self-operating charging stations and third-party charging stations. We formulate the problem via a robust optimization framework to capture the uncertain waiting time at the third-party stations. A Partial-Branch-and-Price algorithm (PB&B) is designed to solve the problem to optimal efficiently for large scales. Specifically, we innovatively proposed acceleration methods to speed up our extended robust labelling algorithm within the PB&B. We conduct a case study to show the effect of uncertainty in detail and provide investment suggestions for the firm’s investment on whether to contract a third-party charging station. Note to Practitioners—The inconvenience of charging has received significant attention for EVs, and energy replenishment services offer an effective approach beyond infrastructure expansion. Valet-charging, first introduced by NIO Inc., followed by FAW-Volkswagen and NETA AUTO, represents a notable attempt in this direction. Valet-staff routing scheduling needs to consider station assignment decisions, which introduces another potential issue: the number of charging stations owned by valet-charging service providers is insufficient. Including third-party charging stations with uncertain waiting times complicates this issue further. We believe our work develops an effective tool for valet-charging service providers to handle routing scheduling with both types of stations and analyze the investment value on charging stations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信