{"title":"需求不确定性下城市电动汽车充电站选址的两阶段随机规划模型","authors":"S.A. MirHassani, A. Khaleghi, F. Hooshmand","doi":"10.1016/j.ejtl.2020.100025","DOIUrl":null,"url":null,"abstract":"<div><p>Due to the dangerous effects of fossil fuels, policymakers tend to substitute fossil-fuel-based vehicles with electric ones. Thus, the optimal design of a charging station network providing convenient access for the users is of great importance. This paper presents a two-stage stochastic programming model for the problem of locating charging stations in urban areas. Parking lots around the buildings which may be visited by people during the day are considered as potential locations for charger installation. The model determines the parking lots that should be equipped with chargers and the number as well as the type of chargers that must be placed in each parking lot considering the demand as an uncertain parameter. The proposed model is examined on the dataset of a midtown area, taken from the literature, and an efficient heuristic algorithm based on Benders decomposition is utilized to solve the model. The results indicate that the heuristic method can find a near-optimal solution (with the optimality gap of at most 0.05%) in a short time.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2020.100025","citationCount":"11","resultStr":"{\"title\":\"Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty\",\"authors\":\"S.A. MirHassani, A. Khaleghi, F. Hooshmand\",\"doi\":\"10.1016/j.ejtl.2020.100025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Due to the dangerous effects of fossil fuels, policymakers tend to substitute fossil-fuel-based vehicles with electric ones. Thus, the optimal design of a charging station network providing convenient access for the users is of great importance. This paper presents a two-stage stochastic programming model for the problem of locating charging stations in urban areas. Parking lots around the buildings which may be visited by people during the day are considered as potential locations for charger installation. The model determines the parking lots that should be equipped with chargers and the number as well as the type of chargers that must be placed in each parking lot considering the demand as an uncertain parameter. The proposed model is examined on the dataset of a midtown area, taken from the literature, and an efficient heuristic algorithm based on Benders decomposition is utilized to solve the model. The results indicate that the heuristic method can find a near-optimal solution (with the optimality gap of at most 0.05%) in a short time.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.ejtl.2020.100025\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437620301552\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437620301552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty
Due to the dangerous effects of fossil fuels, policymakers tend to substitute fossil-fuel-based vehicles with electric ones. Thus, the optimal design of a charging station network providing convenient access for the users is of great importance. This paper presents a two-stage stochastic programming model for the problem of locating charging stations in urban areas. Parking lots around the buildings which may be visited by people during the day are considered as potential locations for charger installation. The model determines the parking lots that should be equipped with chargers and the number as well as the type of chargers that must be placed in each parking lot considering the demand as an uncertain parameter. The proposed model is examined on the dataset of a midtown area, taken from the literature, and an efficient heuristic algorithm based on Benders decomposition is utilized to solve the model. The results indicate that the heuristic method can find a near-optimal solution (with the optimality gap of at most 0.05%) in a short time.
期刊介绍:
The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.