{"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}
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.
期刊介绍:
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.