{"title":"柔性服务操作下的电动汽车充电调度","authors":"Patrick S. Klein, Maximilian Schiffer","doi":"10.1287/trsc.2022.0272","DOIUrl":null,"url":null,"abstract":"Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"42 1","pages":"0"},"PeriodicalIF":4.4000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Electric Vehicle Charge Scheduling with Flexible Service Operations\",\"authors\":\"Patrick S. Klein, Maximilian Schiffer\",\"doi\":\"10.1287/trsc.2022.0272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .\",\"PeriodicalId\":51202,\"journal\":{\"name\":\"Transportation Science\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2023-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2022.0272\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2022.0272","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Electric Vehicle Charge Scheduling with Flexible Service Operations
Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .
期刊介绍:
Transportation Science, published quarterly by INFORMS, is the flagship journal of the Transportation Science and Logistics Society of INFORMS. As the foremost scientific journal in the cross-disciplinary operational research field of transportation analysis, Transportation Science publishes high-quality original contributions and surveys on phenomena associated with all modes of transportation, present and prospective, including mainly all levels of planning, design, economic, operational, and social aspects. Transportation Science focuses primarily on fundamental theories, coupled with observational and experimental studies of transportation and logistics phenomena and processes, mathematical models, advanced methodologies and novel applications in transportation and logistics systems analysis, planning and design. The journal covers a broad range of topics that include vehicular and human traffic flow theories, models and their application to traffic operations and management, strategic, tactical, and operational planning of transportation and logistics systems; performance analysis methods and system design and optimization; theories and analysis methods for network and spatial activity interaction, equilibrium and dynamics; economics of transportation system supply and evaluation; methodologies for analysis of transportation user behavior and the demand for transportation and logistics services.
Transportation Science is international in scope, with editors from nations around the globe. The editorial board reflects the diverse interdisciplinary interests of the transportation science and logistics community, with members that hold primary affiliations in engineering (civil, industrial, and aeronautical), physics, economics, applied mathematics, and business.