Li Zhang , Tingting Chen , Baozhen Yao , Bin Yu , Yunpeng Wang
{"title":"带移动充电车的电动汽车共享系统的路由和充电调度","authors":"Li Zhang , Tingting Chen , Baozhen Yao , Bin Yu , Yunpeng Wang","doi":"10.1016/j.omega.2024.103211","DOIUrl":null,"url":null,"abstract":"<div><div>Electric carsharing systems are expected to be an optional alternative to private vehicles for decreasing the urban traffic congestion and emissions. However, the temporal and spatial imbalance of the charging demand of shared electric vehicles adds to the managerial complexity of electric carsharing systems. This paper integrates mobile charging vehicles into the electric carsharing system to address this imbalance. Mobile charging vehicles can dwell at stations to provide elastic charging capacity, and thereby decrease both the waiting time of shared electric vehicles at busy stations and the investments in fixed charging piles at suburban stations. In this paper, a mixed integer linear programming formulation is proposed based on a time-space network, in which the routes of shared electric vehicles, charging schedules of shared electric vehicles, and routes of mobile charging vehicles are optimized simultaneously. Then, an algorithm based on Lagrangian relaxation is proposed. Specifically, the proposed formulation is decomposed into three independent subproblems. We propose three exact algorithms for these subproblems, and a tailored multistep repair algorithm is designed to generate feasible solutions. A case study in Hefei, China demonstrates the performance of the proposed algorithm and the effects of the number of SEVs, the number of MCVs, the number of fixed charging piles, trip component, battery capacity, and revenue on the operation of the electric carsharing system.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"131 ","pages":"Article 103211"},"PeriodicalIF":6.7000,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Routing and charging scheduling for the electric carsharing system with mobile charging vehicles\",\"authors\":\"Li Zhang , Tingting Chen , Baozhen Yao , Bin Yu , Yunpeng Wang\",\"doi\":\"10.1016/j.omega.2024.103211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Electric carsharing systems are expected to be an optional alternative to private vehicles for decreasing the urban traffic congestion and emissions. However, the temporal and spatial imbalance of the charging demand of shared electric vehicles adds to the managerial complexity of electric carsharing systems. This paper integrates mobile charging vehicles into the electric carsharing system to address this imbalance. Mobile charging vehicles can dwell at stations to provide elastic charging capacity, and thereby decrease both the waiting time of shared electric vehicles at busy stations and the investments in fixed charging piles at suburban stations. In this paper, a mixed integer linear programming formulation is proposed based on a time-space network, in which the routes of shared electric vehicles, charging schedules of shared electric vehicles, and routes of mobile charging vehicles are optimized simultaneously. Then, an algorithm based on Lagrangian relaxation is proposed. Specifically, the proposed formulation is decomposed into three independent subproblems. We propose three exact algorithms for these subproblems, and a tailored multistep repair algorithm is designed to generate feasible solutions. A case study in Hefei, China demonstrates the performance of the proposed algorithm and the effects of the number of SEVs, the number of MCVs, the number of fixed charging piles, trip component, battery capacity, and revenue on the operation of the electric carsharing system.</div></div>\",\"PeriodicalId\":19529,\"journal\":{\"name\":\"Omega-international Journal of Management Science\",\"volume\":\"131 \",\"pages\":\"Article 103211\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Omega-international Journal of Management Science\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305048324001750\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048324001750","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
摘要
电动汽车共享系统有望成为私家车的可选替代方案,以减少城市交通拥堵和废气排放。然而,共享电动汽车充电需求的时空不平衡增加了电动汽车共享系统管理的复杂性。本文将移动充电车纳入电动汽车共享系统,以解决这种不平衡问题。移动充电车可以在站点停留,提供弹性充电容量,从而减少共享电动汽车在繁忙站点的等待时间和在郊区站点固定充电桩的投资。本文提出了一种基于时空网络的混合整数线性规划方法,同时优化共享电动汽车的行驶路线、共享电动汽车的充电时间表和移动充电车的行驶路线。然后,提出了一种基于拉格朗日松弛的算法。具体来说,所提出的方案被分解为三个独立的子问题。我们针对这些子问题提出了三种精确算法,并设计了一种量身定制的多步修复算法来生成可行的解决方案。在中国合肥进行的案例研究展示了所提算法的性能,以及 SEV 数量、MCV 数量、固定充电桩数量、行程组件、电池容量和收入对电动汽车共享系统运行的影响。
Routing and charging scheduling for the electric carsharing system with mobile charging vehicles
Electric carsharing systems are expected to be an optional alternative to private vehicles for decreasing the urban traffic congestion and emissions. However, the temporal and spatial imbalance of the charging demand of shared electric vehicles adds to the managerial complexity of electric carsharing systems. This paper integrates mobile charging vehicles into the electric carsharing system to address this imbalance. Mobile charging vehicles can dwell at stations to provide elastic charging capacity, and thereby decrease both the waiting time of shared electric vehicles at busy stations and the investments in fixed charging piles at suburban stations. In this paper, a mixed integer linear programming formulation is proposed based on a time-space network, in which the routes of shared electric vehicles, charging schedules of shared electric vehicles, and routes of mobile charging vehicles are optimized simultaneously. Then, an algorithm based on Lagrangian relaxation is proposed. Specifically, the proposed formulation is decomposed into three independent subproblems. We propose three exact algorithms for these subproblems, and a tailored multistep repair algorithm is designed to generate feasible solutions. A case study in Hefei, China demonstrates the performance of the proposed algorithm and the effects of the number of SEVs, the number of MCVs, the number of fixed charging piles, trip component, battery capacity, and revenue on the operation of the electric carsharing system.
期刊介绍:
Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.