Next Article in Journal
Application of the COHRV Conceptual Framework to Enhance Sustainable Manufacturing
Previous Article in Journal
Influence of Pipeline Leakage on the Ground Settlement around the Tunnel during Shield Tunneling
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Charging Stations Selection Using a Graph Convolutional Network from Geographic Grid

1
Hunan Key Laboratory of Geospatial Big Data Mining and Application, Hunan Normal University, Changsha 410081, China
2
School of Geographic Sciences, Hunan Normal University, Changsha 410081, China
3
State Grid Information & Communication Company of Hunan Electric Power Corporation, Changsha 410004, China
4
State Key Laboratory of LIESMARS, Wuhan University, Wuhan 430079, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Sustainability 2022, 14(24), 16797; https://doi.org/10.3390/su142416797
Submission received: 2 November 2022 / Revised: 8 December 2022 / Accepted: 12 December 2022 / Published: 14 December 2022

Abstract

:
Electric vehicles (EVs) have attracted considerable attention because of their clean and high-energy efficiency. Reasonably planning a charging station network has become a vital issue for the popularization of EVs. Current research on optimizing charging station networks focuses on the role of stations in a local scope. However, spatial features between charging stations are not considered. This paper proposes a charging station selection method based on the graph convolutional network (GCN) and establishes a charging station selection method considering traffic information and investment cost. The method uses the GCN to extract charging stations. The charging demand of each candidate station is calculated through the traffic flow information to optimize the location of charging stations. Finally, the cost of the charging station network is evaluated. A case study on charging station selection shows that the method can solve the EV charging station location problem.

1. Introduction

Using EVs can reduce the burning of fossil fuels, thus effectively reducing greenhouse gas emissions and easing environmental pressures. However, the development of EVs is constrained by energy technologies and support, including battery storage services [1,2] and charging service support [3,4,5,6]. The main reason is that charging station network planning is not justified. Current charging facilities significantly limit the convenience of the charging station network. The user’s charging demand involves a complete charging station network rather than a single one. Therefore, practical design of charging station networks is necessary to facilitate EVs.

1.1. Motivations and Related Work

Energy consumption by the transportation industry has increased greenhouse gas emissions, posing a significant challenge to environmental protection. Unlike fuel vehicles, EVs can reduce carbon dioxide emissions [7]. However, due to the limited number of charging stations, the lack of charging facilities has become an essential factor limiting EVs development [8]. Therefore, proper charging station planning will help promote more sustainable smart transportation.
In recent years, researchers have shown increased interest in properly selecting charging stations and links in networks. Location method is the primary means of facility location planning to meet its spatial distribution demand. The location planning of charging station facilities is usually considered from the perspective of demand [9,10,11,12,13,14] and economy [15,16]. Analyzing the charging demand in the region is an essential step in planning charging stations. Some studies allocate charging stations based on regional charging demand. These studies can be further divided into node-based methods and flow-based methods. The planning and location model based on traffic capture assumes that the demand is given in origin–destination (O–D) flow aiming to cover as many traffic flows as possible. According to the real-time traffic flow, the influence of human activities on the selection of charging stations is dynamically presented [17]. A two-tier optimization framework was constructed to optimize the configuration of fast charging station facilities with various realities, such as traffic flow as a critical factor [18,19,20,21]. Wang proposed a charging strategy suitable for intercity travel [22]. Depending on the flow rate or the location of the flow capture facility, it is more appropriate to deal with optimizing charging stations between distant regions. Node- or point-based demand models can be helpful if demand is concentrated, such as in urban areas. The size of stations installed to meet the slow charging needs of customers in a highly populated area is determined based on a maximum coverage model [23]. Hu constructed an analytical model for the carrying capacity of the charging demand of the charging station [24]. The article [25] verified the planning results of the designed charging station by dividing the research area into multiple regular grids and calculating the power demand in the grid area. Wang presented a four-step method for electric vehicle charging facility deployment [26]. The optimal planning of charging stations was investigated by analyzing users’ travel patterns [27], calculating regional heat values [24], and analyzing the charging demand of commuter EVs [28].
Additionally, the layout of the charging station is planned from an economic point of view to minimize the investment and charging costs. For example, charging duration and cost [22] are essential factors that influence the location of the charging station planning. Considering the cost of charging station construction, Dong and Li established the location and scale model [29]. Considering the ease of planning and maintenance costs, it is reasonable to assume that most cities will soon plan enough charging stations for users. Chen considered the EV length and charging duration to assign the correct number of cars to the stations in the demand area [30]. In [31], a multiobjective optimization model was proposed for layout of charging stations to address the profitability needs of charging station owners and operators. The article [32] evaluated regional segmentation at both macro and micro levels and analyzed the potential locations of charging stations in the region based on land use. Yang [33] built a stochastic simulation modeling framework by considering the charging station price and waiting time, which can allocate the capacity of the charging station in real time. The location and capacity models were established by using the improved particle swarm optimization algorithm [29]. The key challenges of rational planning of charging stations in real cities are as follows:
  • Describing users’ charging behaviors and habits.
  • Aggregating multisource geospatial data into reliable characteristic information of charging stations.
  • Providing the distribution of charging stations to users with on-demand needs.
We aim to plan reasonable charging stations by considering the charging demand of users, the temporal distribution of charging stations, and the road network. The key is to obtain the data of interest points and relevant data of existing charging stations and consider the rationality of the charging station service network from a spatial perspective. However, it is only sometimes obvious how to effectively integrate geographic resources to achieve rational deployment of charging stations because most charging station planning approaches mainly evaluate subjective metrics without using objective models to make judgments, including population density, traffic flow, construction cost, and latency cost. They only consider the regional supply–demand relationship but do not consider the geospatial correlation between nodes. The deep learning method can help reveal spatial correlations of geographical elements. In the age of big data, deep learning has also become a vital research direction [34], which can perform automatic feature learning on crowdsourced data to discover distributed feature representations of the data [35,36]. As a result, GCN-based classification studies have received much attention [20,37]. Ref. [38] proposed a GCN-based semisupervised classification method using social network data. However, this method mainly starts from the demand and does not consider the spatial correlation between regions. In summary, this paper will obtain the potential spatiotemporal features from space using the node classification method of GCN to plan an appropriate charging station location.

1.2. Our Approach

In this paper, we propose a GCN-based EV charging station planning approach that reliably aggregates geographic information from multiple sources and plans rational charging stations. The proposed method is designed to address the charging needs of EV users traveling to improve the convenience and accessibility of charging for drivers.
To better aggregate spatiotemporal feature information, this paper introduces the geospatial feature attribute to improve the rationality of the charging station network based on considering the charging demand and investment cost. It focuses on the connection between charging demand in a region and the spatiotemporal features of the geographic space. Specifically, the method uses the supervised classification of nodes to extract candidate sites for charging stations according to points of interest (POI), traffic information, and costs. The spatial information of each node is considered comprehensively so that reasonable charging stations can be planned in the real road network.
The main contributions of this paper are as follows:
  • Propose a hybrid charging stations selection method. The GCN is combined with traditional judgment methods to comprehensively evaluate the optimal layout of the charging station network.
  • Construct the graph structure tensor of the charging station network. We propose the graph structure module to obtain the potential spatiotemporal environment attributes to construct the graph structure tensor.
  • Optimize potential charging stations based on preliminary classification results. Demand analysis compares the EV charging station’s data in the grid with the actual station to screen out reasonable charging stations further.

2. Methodology

This paper presents a hybrid method for selecting EV charging stations. As shown in Figure 1, EV charging station planning includes data collection, candidate site extraction, and candidate site optimization. The candidate sites of charging stations are extracted based on the GCN node supervised classification. Candidate sites are evaluated by using traffic flow and construction cost to optimize further the location planning results of charging stations [39]. The results of the data collection stage will provide a well-prepared dataset for building the GCN algorithm. The extract candidate charging station phase includes constructing tensor, GCN-based node classification, and choosing candidate sites. The last stage optimizes the charging station and evaluates the cost of the charging station network. As a result, the EV charging infrastructure will be optimized and planned to meet the increasing number of EVs in the future.

2.1. Study Area and Data

The research selects some areas of Yuhua district, Furong district, and Tianxin district of Changsha City, Hunan Province, as the research area (as shown in Figure 2). Changsha is one of the major cities in Central China and is densely populated, covering many residential areas, shopping malls, cultural and educational places, etc. In 2021, Changsha had a population of 10.0479 million and a jurisdiction area of 11,816 square kilometers. Areas with high population densities tend to be areas with high demand for charging stations. Therefore, some urban characteristics in this area may affect the layout of EV charging facilities. By collecting and preprocessing the corresponding traffic data, POI data, and land price data in the study area, we can provide a fully prepared dataset for the construction of a deep learning algorithm.

2.1.1. Road Network

The road network is freely available through the OpenStreetMap platform, which is easy to access, has more diverse road types, and is more current. After obtaining the original road network, we modified the data and removed the wrong road network data to ensure the correctness of the road network data. Four primary types of roads were extracted in this study: trunk, primary, secondary, and tertiary.

2.1.2. Traffic Data

Traffic data are the real-time traffic situation data obtained through the Amap platform. We obtain the corresponding traffic flow by deduplication and cleaning the original traffic situation data.

2.1.3. POI Data

This study extracts POI as the characteristic of nodes because of its high accuracy, wide coverage, and real-time solidity.POI refers to all geographical objects that can be abstracted as points in geographical scenes in general, such as schools, shopping malls, parks, and other geographical entities. The characteristics can expose various socioeconomic phenomena and provide specific geographic references when classifying nodes. The POI dataset comes from Baidu Map, and each POI record has the name, level classification, address, and geographic coordinates of the POI. This study will extract the POI related to EV charging demand from the original POI.

2.1.4. Land Price Data

The land price data used in this paper are based on the benchmark land price. Urban benchmark land price refers to the average price of each price segment at a certain time point in a city, which is divided into land price regions according to the principles of similar use, land necklace, and land price within a certain region of the city.

2.2. Extracting Candidate Charging Stations

There is a classification and extraction model for EV charging stations. In order to preliminarily extract appropriate EV charging stations, important features of representative geographic regions, including POI, road networks, and construction maps, are extracted in this paper [40].

2.2.1. Constructing the Model Tensor

As shown in Figure 3, this study seeks to construct a graph structure which describes various complex data features and the relationship between structural features. The study area is first divided into regular grids and abstracted into nodes, and the adjacency relationship between nodes represents the proximity relationship between grids. As a complex data structure, the graph contains both attributes of node and attributes of edge. The attributes of nodes contain POIs and roads; the attributes of edges are the connection relationships between nodes. It can represent many feature structures with rich information, so it can be used to describe various complex data features and the relationship between structural features. Set the graph structure G = (V, E), where V = { v 1 , v 2 , v 3 , . . . , v n } denotes the set of nodes, n is the number of nodes, and E = { e 1 , e 2 , e 3 , . . . , e m } denotes the set of edges with e k = < v i , v j > E denotes an edge between v i and v j .
Since the input of GCN is the features of each node, the feature’s attributes associated with each node type need to be determined to better capture the spatial information. The layout of charging facilities is closely related to the traffic network conditions and the needs of users. Therefore, the distribution of POI and road network is used as the characteristic attribute of each node in this study (as shown in Figure 4).
To classify nodes, it is necessary to determine the characteristic attributes associated with each node type. There are eight POI attributes of node characteristics available, which are the number of gas stations, shopping malls, attractions, parking lots, industrial parks, business offices, residential communities, and government institutions; the road network attributes are the trunk, primary, secondary, and tertiary. Eight POI attributes of 400 nodes and four road network attributes were selected as input features to form a two-dimensional tensor of size 400 × 12 . The characteristics of the nodes in the network topology can be represented by an adjacency matrix A = a i , j R N × N , and a i , j is defined as shown in Equation (1).
a i , j = 1 , if   n u m p o i > 0 0 , else
where the a i , j denotes the input of matrix A at the i-th row and the j-th column, where the A i , j represents node characteristic matrix. The n u m p o i represents the number of each POI in each node. Considering the denseness of residential communities and business offices, it is assumed by experience that when POI is residential communities and n u m p o i is greater than 3, A i , j is equal to 1, otherwise it is equal to 0; when POI is a business office and n u m p o i is greater than 5, A i , j is equal to 1, otherwise it is equal to 0. Typically, the maximum numbers of residential communities and business offices in a grid are around 3 and 5, respectively.

2.2.2. GCN-Based Node Classification

This paper uses a GCN-based method to define graph convolution as the aggregation of feature information from neighbors according to the node supervised method [41]. Edge aggregates node information to generate a new feature representation. GCN is a graph-based neural network. By directly performing convolution-like operations on graphs, the problem that conventional depth learning methods cannot now process irregular graph data is solved [42]. The input of GCN is as follows: (1) an n × r dimensional input feature matrix X composed of the input feature vectors of all nodes in the graph, with n and r being the number of nodes and the dimensionality of the node input feature vectors, respectively; (2) the adjacency matrix of the graph generally represents the structural feature description of the graph, and the output feature matrix Z of GCN is obtained after the convolution layer of each graph in the middle of k. In the middle k graph convolution layers, the features of the nodes flow in the graph structure in the form of hidden features. The GCN is also a neural network layer that propagates from layer to layer in the following manner [42]:
H ( l + 1 ) = σ ( D ^ 1 2 A ^ D ^ 1 2 H ( l ) W ( l ) )
where H l + 1 and H l are the output and input matrices of layer l ( l = 1 , 2 , . . . , L ). The number of matrix rows is the number of nodes. The matrix columns are features of a node corresponding to the POI and road level. A ^ = A + I is the graph’s adjacency matrix after adding self-connected edges to the undirected graph G. Matrix A is the graph’s adjacency matrix, reflecting the presence or absence of connections between nodes. Matrix I is the unit matrix. D ^ is the degree matrix corresponding to A ^ . W l is a node-negotiable matrix. W l is a trainable parameter matrix that represents a linear transformation of the mapped feature space. σ denotes an activation function. The nodes contain different categories, and the labels of some of them are known, so we use the nodes with given labels for training based on the GCN model. The trained model is used to predict other nodes without labels.
With the topological information of the input graph and the node feature information, the GCN-based method will learn the potential connections between node features and finally obtain the type of each node. Steps of GCN-based node classification include data import and preprocessing, initializing the GCN structure and parameters, and training the GCN. First, the network topology, the characteristic attributes, and the classification labels of each node are imported. The processed data samples are randomly divided into training, validation, and test sets. The training and validation sets are used to determine the various hyperparameters and weights of the GCN. The test set is used to evaluate the performance of the GCN after the training is completed. Before starting to train the GCN, we need to set up the network structure and parameters of the GCN, including the number of graph convolution layers, optimizer, loss function, etc. Then, in training GCN, the edge set, point set, and each node feature of the graph are the first input to obtain the adjacency matrix A and node feature matrix X of the graph. The collection and standardization of node feature information are realized through multiple graph convolution and normalization operations. We extract and learn the features between nodes and output the classified label vector by the softmax layer. Each output vector corresponds to the classification label of the node. Finally, the observed and actual values are used to calculate all nodes’ total loss function values through the loss function. The weights of the GCN are updated using the backpropagation algorithm. The trained model is used to predict the classification of node types in the study area, and the classification label of each node is obtained.

2.2.3. Choosing Candidate Sites

In the study area, 400 grids were selected as candidate areas for constructing EV charging stations. These 400 candidate areas form a rectangular array of 20 rows and 20 columns. The acquired POIs and road networks were cleaned. The extracted regional road network and POI distribution features are taken as the node attributes of the graph. The distribution of the actual charging stations is used as the nodes’ label for the supervised classification of nodes. The candidate charging stations are preliminarily selected. The label of each node is divided into three categories: empty, sparse, and dense, according to the number of node charging piles. The label division basis is as follows:
L a b e l = e m p t y , if   n u m = 0 s p a r s e , if   1 n u m 30 d e n s e , if   n u m > 30
where L a b e l is the label of each node and n u m is the number of charging piles.

2.3. Optimal Location of EV Charge Stations

The location of the charging station is further optimized according to the preliminary extraction of the candidate sites of the charging station. Firstly, the charging demand is evaluated to merge the nodes based on the traffic flow information, which is used to optimize the location of charge stations. Then, the investment cost of the charging station network is evaluated.

2.3.1. Traffic Demand Assessment

The traffic flow of each node is obtained by using the traffic situation data corresponding to the roads at all levels. This study mainly focuses on the traffic situation data of trunk, primary, secondary, and tertiary urban roads. Based on the traffic situation data processing method proposed in [43], the corresponding traffic flow of roads at all levels under smooth, slow, and congested roads is obtained, as shown in Table 1. The obtained real-time traffic situation data are counted to obtain the average value of traffic flow in the same period. According to the traffic flow in each period, the hourly average traffic flow corresponding to each node is calculated. According to the data from the China Automobile Industry Association, the sales volume of new energy vehicles in China exceeded 3.5 million in 2021, and the market share increased to 13.4%. Therefore, the average daily flow of EVs is shown in the following formula:
Q = a q 24
where a represents the occupancy of EVs, and q represents the time average of traffic flow.
According to the study area’s traffic flow information, each node’s corresponding charging demand is analyzed. The demand of the charging point is related to the charging probability of the user. The calculation of the demand of the charging point is shown in Formulas (5) and (6). The method compares the charging demand with the node classification label to screen candidate sites. The node is deleted when the demand is consistent with the forecast label result or is lower than the labeling threshold. If the demand exceeds the labeling threshold, the nodes must be reserved for further optimization. When the demand for charging piles exceeds the threshold of the label, it indicates that more charging piles need to be built to meet their needs.
Z = Q P ÷ T e
where Z represents the demand for charging piles, Q represents the average daily EV flow, and P represents the user’s charging probability.
P = n t ÷ T e
where n represents the average daily charging times, and n assumes that the user charges once a day. The t refers to the duration of each charge. This study will set different charging duration for three different scenarios:
1.
When the construction of charging stations is all fast charging, the duration of each charging is set to 0.5 h.
2.
When the construction of the charging station is a mixture of fast and slow charging, the duration of each charge is set to be 2 h.
3.
If the construction of the charging station is slow, each charge’s duration is set to be 6 h.
After filtering and deleting nodes that do not need to build charging stations, the nodes are consolidated. The mathematical description is as follows:
p i j p i + p j
where p i j represents the number of charging points required by the merged nodes; p i represents the number of charging points required by node i; p j represents the number of charging points needed by node j. To reasonably merge the candidate nodes according to the demand, we assume that the maximum Manhattan distance the nodes can move is 1 km. When the demand of the merged nodes meets the above formula and the moving distance is less than the distance threshold, the node is the final charging station construction area.

2.3.2. Construction Cost Assessment

The optimized site is used to evaluate the cost of the charging station network. The network planning of the charging station should consider the traffic information within the service range and the cost of the charging station. Therefore, the investment cost of the charging station service network is as follows:
F = C 1 + C 2 + C 3
where F is the total cost of charging station planning; C 1 is the fixed construction cost of EV charging station converted to each year; C 2 is the operation and maintenance cost of the charging station; C 3 is the annual charge cost of the charging station.
1.
Annual construction cost of charging station
C 1 = r 0 ( 1 + r 0 ) n k ( 1 + r 0 ) n k 1 [ A r C A + M r C M + C j + e i ]
where the infrastructure of the EV charging station mainly includes a charger, battery maintenance equipment, charging monitoring, and safety monitoring equipment; distribution facilities mainly include a distribution cabinet, transformer, cable, active filter device, etc. The n k is the design service life of the charging station; the r 0 is the fund recovery rate; A r is the land area of charging station r, and the number of chargers installed in charging stations of different sizes is different, so the occupied area is also different, as shown in Table 2; C A is the unit price of land acquisition; M r is the number of chargers in the charging station; C M is the unit price of the charger; C j is the cost of distribution facilities; e i j refers to other auxiliary expenses under different scenarios.
2.
The operation and maintenance costs of the charging station
C 2 = μ C 1
where the costs mainly include equipment depreciation costs, overhaul and maintenance costs, wages, etc. As the cost values are not clear, it is considered to calculate the annual operation and maintenance cost as a percentage of the initial investment; the scale factor is u.
3.
Annual charge cost of charging station
C 3 = 365 C e T e [ T r ( C C u + C F e ) + M r ( C L + C W ) ]
where C e is the charging price; T e is the average effective working time of the charging station every day; T r is the number of transformers; M r is the number of chargers in the charging station; C C u is the copper loss converted to a single distribution transformer; C F e is the iron loss converted to a single distribution transformer; C L is the circuit loss converted to a single distribution transformer; C W is the charging loss converted to a single distribution transformer. The values of the relevant paramaters are given in Table 3; it mainly includes various parameters required in the cost calculation.

3. Case Study

In the case study, our goal is to optimize the layout of charging stations to support the planning and development of local charging facilities. The research first determines a group of candidate locations, then further optimizes charging stations’ selection in different scenarios. We implemented our algorithm in PyTorch and optimized it using the Adam algorithm. Processing was run on an Intel Core i5 computer running Windows with 16 GB RAM.

3.1. Data Preprocessing

Data preprocessing is used to extract node classification labels and analyze the charging demand of each node. It is necessary to preprocess the raw data before constructing the graph structure tensor. First, various POIs are extracted and their number distributions are counted. Secondly, the topology of the road network is checked, and the trunk, primary, secondary, and tertiary roads are extracted. The collected traffic data are real-time traffic data from 21 July 2021 to 27 July 2021, as one week is a complete description of the minimum period of people’s daily travel. The time interval for data sampling is 15 min. The average value of traffic flow in each period is obtained according to the data statistics. Then, the time average traffic flow corresponding to each node is calculated. In the experiment, we train the model by using complete batch processing during the training period. The maximum number of iterations is set to 300. The GCN learners in the method have 16 hidden neuron layers. In addition, the learning rate is set to 0.01, and the weight-decay rate is set to 5 × 10 4 .

3.2. Candidate Charging Stations

Based on the actual road network, this section preliminarily extracts the candidate sites of EV charging stations in the study area. The 400 grids are used as candidate nodes to quantify and analyze the interest points in the region. A unique ID is created for each node, and label extraction is carried out based on the GCN supervised classification model. After the dataset is run 85 times, we obtain the training loss and average classification accuracy of 400 nodes, as shown in Figure 5. Figure 5a shows the loss of the training set and the verification set, and Figure 5b shows the accuracy of the training set and the verification set. At this time, the loss of the training set and verification set approaches 0.3, the accuracies of the training set and verification set approach 0.7 and 0.6, respectively, and the accuracy of the test set reaches 0.57. Based on the GCN supervised classification training model, this study predicts the classification labels in the study area. In the label prediction results, the number of correctly predicted labels is 255, and the correct rate is 63.75%.
The predicted category labels are compared with the actual label values to filter out the nodes that need further optimization. The node will be deleted when the predicted label value is the same as the actual label. The demand for charging piles at each node is obtained according to the traffic flow information corresponding to each node. The node will be deleted when the predicted label value is consistent with the actual tag value. The remaining nodes need to be further optimized. According to the charging habits of EV users, we divide the research into three scenarios: the charging time is 0.5 h, the charging time is 2 h, and the charging time is 6 h.
Figure 6 shows the location distribution of candidate sites in three scenarios. It can be seen from the figure that when the distribution of charging demand is different, the number of charging facilities configured in the planning area of each charging station is also different. In the figure, the number of charging piles is divided into five levels: the number of charging piles is less than or equal to 8, and the level is 1; the number of charging points is greater than 8, the number of charging points is less than or equal to 15, and the grade is 2; the number of charging piles is greater than 15, the number of charging piles is less than or equal to 30, and the grade is 3; the number of charging piles is greater than 30, the number of charging piles is less than or equal to 45, and the grade is 4; the number of charging points is greater than 45, and the level is 5. In areas with dense POI and road network, it is more attractive for users to travel to generate greater charging demand. Different charging modes require a different number of planned charging stations. As shown in Figure 6a, when the charging mode is mainly fast charging, i.e., the average charging duration is 0.5 h, there are 270 nodes in total that need to be planned for the charging station; as shown in Figure 6b, when the charging mode is mainly fast charging, i.e., the average charging duration is 2 h, there are 273 nodes in total that need to be planned for the charging station; as shown in Figure 6c, when the charging mode is mainly fast charging, i.e., the average charging duration is 6 h, there are 309 nodes in total that need to be planned for the charging station. It can be seen that when the charging mode is mainly slow, the scope of construction is more extensive, and the number of charging stations is higher. In particular, some main roads are distributed within the black rectangle, which may be why the charging demand increases. More charging stations need to be built in this area. To sum up, the spatial distribution of the road network is an essential factor affecting the network planning of the charging station.

3.3. Optimal Location of EV Charge Stations

Candidate charging stations are obtained based on the GCN method and considering the extraction of traffic information constraints. After the nodes that need to be planned for the charging station are preliminarily extracted, the nodes are merged and optimized according to the demand of the charging pile. Therefore, the optimal charging stations under three different scenarios are obtained.
As shown in Figure 7a, there are 101 charging station nodes to be planned, of which the number of charging piles is 1031; as shown in Figure 7b, there are 115 charging station nodes to be planned, and the number of charging piles is 4295; as shown in Figure 7c, there are 100 charging station nodes to be planned, and the number of charging piles is 14,280. The construction costs corresponding to the three scenarios are, respectively, USD 7.2851 million, USD 13.3229 million, and USD 31.1220 million.
In Scenario I, fewer nodes are planned to charge stations and the scenario hasthe lowest investment and construction costs. The population near the urban business district is more mobile and needs to meet the fast charging demand of users. Users can be charged in the shortest time and save waiting time. For the planner, cost minimization is the ultimate goal. Therefore, this scenario is suitable for city center areas where demand is concentrated.
In Scenario II, the nodes requiring the most planning of charging stations are in the middle of the price range. A charging station network combining fast and slow charging would be more reasonable in mixed urban functional areas, such as commercial and residential intersection areas.
In Scenario III, the lowest number of nodes is needed to plan charging stations, but it has the highest investment and construction costs. Users in residential areas have more time for charging at night, and a scenario with a longer charging time can be considered for planning. For planners, the investment cost of this scenario is too high to be fully applicable.
The obtained optimal charging stations are compared with existing stations’ distribution to validate our proposed approach’s effectiveness. Figure 8 shows the distribution of charging stations in the study area with local enlargement (take Scenario I as an example). Yellow points indicate charging stations obtained by the proposed method, black points indicate existing charging stations, and purple area indicates the range of charging stations planned by the proposed method. When an optimal charging station is in the same purple area as an existing station, we treat them as the same charging station. The results are shown in Table 4, comparing the similarity probabilities for the charging stations planned by the proposed method and the existing ones. From the table, we can see that all three scenarios have a similarity probability of more than 60%, and Scenario III has a similarity probability of nearly 80% with the existing charging stations. This indicates that our proposed method is effective.
This section compares the proposed method with the conventional charging station locating and sizing method [44]. The method uses a grid partitioning method to partition the planning area and plan the charging stations considering the traffic density and capacity constraints, which require 75 charging stations to be built. Compared with our proposed method, the number of charging stations obtained based on locating and sizing methods is far from meeting the increasing demand for electric vehicle charging in the region year by year. Geographical connections between regions are essential in the deployment of charging stations. This approach considers the traffic flow but ignores the spatiotemporal correlation between charging stations, so it deviates somewhat from our proposed approach in optimizing charging station layout, and also has a large discrepancy with existing charging stations.

4. Discussion

In this section, we further discuss how to enrich our proposed research methodology to suit several practical factors in a real-world charging facility deployment setting.
First, the spatial distribution of charging stations under different scenarios is fully demonstrated. The experimental results show that the proposed method is feasible. Figure 7 shows the number of candidate charging stations and the spatial distribution, which provides the basis for optimal planning of charging stations. By integrating adjacent points of candidate charging stations, the economic scale of charging facilities is increased, and construction costs are directly reduced by saving on land use and other expenses.
Second, in practice, decisions on EV charging locations and infrastructure implementation require continuous and long-term planning efforts and changes in charging demand over time. Therefore, the establishment and improvement of charging infrastructure networks are particularly important. In contrast to the charging-demand-based charging station planning approach, this paper focuses more on the influence of spatial and temporal features on the distribution of charging infrastructure to build user-friendly charging station networks and enhance their convenience and accessibility.
Finally, we propose an approach for deploying charging stations that fully considers the connectivity between geographic spaces and can meet the demands of different users, and also considers investment/budgets. The results for charging station deployment are obtained using the proposed method. The actual total construction cost was estimated using these results. Here, we discuss how the budget constraints of building EV charging stations and the possibility of connecting to the grid can be combined with our proposed approach and its implications. We can incorporate budget constraints and charge loading capacity into our proposed approach in two steps. In the first step, the total construction cost is estimated using the proposed method to obtain the deployment results of charging stations, irrespective of budget constraints. In the second step, the number of charging stations can be constrained by the charging capacity to adjust the construction cost. It is important to note that, regardless of the budget, too many charging facilities may burden the grid; with limited budgets, the deployed charging facilities may not meet the charging demand and may lead to a poor charging service experience.

5. Conclusions

This paper proposes a charging station selection method using GCN from the geographic grid to facilitate EV drivers to charge their vehicles. The method aims to address the charging demand of EV users. It proposes three charging station planning scenarios for different charging behaviors of users, taking into account spatial and temporal geographic features to provide a convenient and efficient charging station network for users. Experimental results show that the proposed charging station placement method can offer an effective network space optimization scheme for various scenarios.

Author Contributions

Conceptualization, J.Q. (Jian Qin) and T.W.; data curation, J.Q. (Jing Qiu); formal analysis, J.Q. (Jing Qiu) and T.W.; funding acquisition, T.W. and L.X.; investigation, J.Q. (Jianxin Qin) and J.Q. (Jing Qiu); methodology, J.Q. (Jianxin Qin), J.Q. (Jing Qiu), Y.C., T.W., and L.X.; resources, J.Q. (Jianxin Qin); writing—original draft, J.Q. (Jing Qiu), T.W., Y.C. and L.X.; writing—review and editing, J.Q. (Jianxin Qin), J.Q. (Jing Qiu), Y.C., T.W. and L.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported in part by the National Natural Science Foundation of China under Grant 41771474, and in part by the Open Research Fund of State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, under Grant 19I05.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

This work was funded by the State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing (State Key Lab-LIESMARS). The authors thank anonymous reviewers for their constructive comments, which helped improve the article.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
GCNGraph convolutional network
EVElectric vehicle
POIPoint of interest
CBDCentral business district

References

  1. Duan, X.; Hu, Z.; Song, Y. Bidding Strategies in Energy and Reserve Markets for an Aggregator of Multiple EV Fast Charging Stations with Battery Storage. IEEE Trans. Intell. Transp. Syst. 2020, 22, 471–482. [Google Scholar] [CrossRef]
  2. Rezaee Jordehi, A.; Javadi, M.S.; Catalão, J.P.S. Optimal placement of battery swap stations in microgrids with micro pumped hydro storage systems, photovoltaic, wind and geothermal distributed generators. Int. J. Electr. Power Energy Syst. 2021, 125, 106483. [Google Scholar] [CrossRef]
  3. Lee, Z.J.; Pang, J.; Low, S.H. Pricing EV charging service with demand charge. Electr. Power Syst. Res. 2020, 189, 106694. [Google Scholar] [CrossRef]
  4. Qian, T.; Shao, C.; Li, X.; Wang, X.; Shahidehpour, M. Enhanced Coordinated Operations of Electric Power and Transportation Networks via EV Charging Services. IEEE Trans. Smart Grid 2020, 11, 3019–3030. [Google Scholar] [CrossRef]
  5. Das, H.S.; Rahman, M.M.; Li, S.; Tan, C.W. Electric vehicles standards, charging infrastructure, and impact on grid integration: A technological review. Renew. Sustain. Energy Rev. 2020, 120, 109618. [Google Scholar] [CrossRef]
  6. Wolbertus, R.; Kroesen, M.; Hoed, R.; Chorus, C.G. Policy effects on charging behaviour of electric vehicle owners and on purchase intentions of prospective owners: Natural and stated choice experiments. Transp. Res. Part D Transp. Environ. 2018, 62, 283–297. [Google Scholar] [CrossRef] [Green Version]
  7. Long, J.; Wang, Y.; Wei, X.; Ding, Z.; Qi, Q.; Xie, F.; Qian, Z.; Huang, W. Entity-Centric Fully Connected GCN for Relation Classification. Appl. Sci. 2021, 11, 1377. [Google Scholar] [CrossRef]
  8. Sun, X.H.; Yamamoto, T.; Morikawa, T. Fast-charging station choice behavior among battery electric vehicle users. Transp. Res. Part D 2016, 46, 26–39. [Google Scholar] [CrossRef]
  9. Xiang, Y.; Liu, J.; Li, R.; Li, F.; Gu, C.; Tang, S. Economic planning of electric vehicle charging stations considering traffic constraints and load profile templates. Appl. Energy 2016, 178, 647–659. [Google Scholar] [CrossRef] [Green Version]
  10. Wang, H.; Zhao, D.; Cai, Y.; Meng, Q.; Ong, G.P. Taxi trajectory data based fast-charging facility planning for urban electric taxi systems. Appl. Energy 2021, 286, 116515. [Google Scholar] [CrossRef]
  11. Xu, M.; Meng, Q.; Mannering, F. Optimal deployment of charging stations considering path deviation and nonlinear elastic demand. Transp. Res. Part B Methodol. 2020, 135, 120–142. [Google Scholar] [CrossRef]
  12. Andrenacci, N.; Ragona, R.; Valenti, G. A demand-side approach to the optimal deployment of electric vehicle charging stations in metropolitan areas. Appl. Energy 2016, 182, 39–46. [Google Scholar] [CrossRef]
  13. Wei, T.; Qlab, D.; Zf, D.; Slse, D.; Bzab, C.; Xcab, C. Optimizing the locations of electric taxi charging stations: A spatial–temporal demand coverage approach. Transp. Res. Part C Emerg. Technol. 2016, 65, 172–189. [Google Scholar]
  14. Wang, X.; Shahidehpour, M.; Jiang, C.; Li, Z. Coordinated Planning Strategy for Electric Vehicle Charging Stations and Coupled Traffic-Electric Networks. IEEE Trans. Power Syst. 2018, 34, 268–279. [Google Scholar] [CrossRef]
  15. Liu, Y.; Cheng, Q.; Gan, Y.; Wang, Y.; Li, Z.; Zhao, J. Multi-objective optimization of energy consumption in crude oil pipeline transportation system operation based on exergy loss analysis. Neurocomputing 2019, 332, 100–110. [Google Scholar] [CrossRef]
  16. Zhang, H.; Hu, Z.; Xu, Z.; Song, Y. An Integrated Planning Framework for Different Types of PEV Charging Facilities in Urban Area. IEEE Trans. Smart Grid 2017, 7, 2273–2284. [Google Scholar] [CrossRef]
  17. Yin, X.; Zhao, X. Planning of electric vehicle charging station based on real time traffic flow. In Proceedings of the 2016 IEEE Vehicle Power and Propulsion Conference (VPPC), Hangzhou, China, 17–20 October 2016; pp. 1–4. [Google Scholar] [CrossRef]
  18. Tran, C.Q.; Keyvan-Ekbatani, M.; Ngoduy, D.; Watling, D. Stochasticity and environmental cost inclusion for electric vehicles fast-charging facility deployment. Transp. Res. Part E Logist. Transp. Rev. 2021, 154, 102460. [Google Scholar] [CrossRef]
  19. Zhao, Y.; Guo, Y.; Guo, Q.; Zhang, H.; Sun, H. Deployment of the Electric Vehicle Charging Station Considering Existing Competitors. IEEE Trans. Smart Grid 2020, 11, 4236–4248. [Google Scholar] [CrossRef]
  20. Dabiri, S.; Markovi, N.; Heaslip, K.; Reddy, C.K. A deep convolutional neural network based approach for vehicle classification using large-scale GPS trajectory data. Transp. Res. Part C Emerg. Technol. 2020, 116, 102644. [Google Scholar] [CrossRef]
  21. Dong, H.; Wang, L.; Wei, X.; Xu, Y.; Zeng, M. Capacity planning and pricing design of charging station considering the uncertainty of user behavior. Int. J. Electr. Power Energy Syst. 2021, 125, 106521. [Google Scholar] [CrossRef]
  22. Wang, Y.; Bi, J.; Guan, W.; Lu, C.; Xie, D. Optimal charging strategy for intercity travels of battery electric vehicles. Transp. Res. Part D Transp. Environ. 2021, 96, 102870. [Google Scholar] [CrossRef]
  23. Frade, I.; Ribeiro, A.; Gonçalves, G.; Antunes, A.P. Optimal location of charging stations for electric vehicles in a neighborhood in Lisbon, Portugal. Transp. Res. Rec. 2011, 2252, 91–98. [Google Scholar] [CrossRef] [Green Version]
  24. Hu, H.; Ni, S.; Zhang, L. Analysis of the carrying capacity of charging station based on regional charging demand. In Proceedings of the 2020 7th International Conference on Information Science and Control Engineering (ICISCE), Changsha, China, 18–20 December 2020; pp. 1688–1691. [Google Scholar] [CrossRef]
  25. Quddus, M.A.; Kabli, M.; Marufuzzaman, M. Modeling electric vehicle charging station expansion with an integration of renewable energy and Vehicle-to-Grid sources. Transp. Res. 2019, 128, 251–279. [Google Scholar] [CrossRef]
  26. Wang, H.; Zhao, D.; Meng, Q.; Ong, G.P.; Lee, D.H. A four-step method for electric-vehicle charging facility deployment in a dense city: An empirical study in Singapore. Transp. Res. Part A Policy Pract. 2019, 119, 224–237. [Google Scholar] [CrossRef]
  27. Bai, X.; Wang, Z.; Zou, L.; Liu, H.; Sun, Q.; Alsaadi, F.E. Electric vehicle charging station planning with dynamic prediction of elastic charging demand: A hybrid particle swarm optimization algorithm. Complex Intell. Syst. 2022, 8, 1035–1046. [Google Scholar] [CrossRef]
  28. Luo, Q.; Tian, W.; Jia, H. Location and Capacity Model of Charging Station for Electric Vehicles Based on Commuting Demand. IEEJ Trans. Electr. Electron. Eng. 2020, 15, 1089–1099. [Google Scholar] [CrossRef]
  29. Dong, Y.; Li, L. Charging station planning considering the total cost of construction of users and charging stations. IOP Conf. Ser. Mater. Sci. Eng. 2019, 592, 012136. [Google Scholar] [CrossRef]
  30. Chen, H.; Wang, X.; Su, Y. Location Planning of Charging Stations Considering the Total Cost of Charging Stations and Users. In Proceedings of the 2020 35th Youth Academic Annual Conference of Chinese Association of Automation (YAC), Zhanjiang, China, 16–18 October 2020; pp. 717–721. [Google Scholar] [CrossRef]
  31. Stojkovic, J. Multi-objective optimal charging control of electric vehicles in pv charging station. In Proceedings of the 2019 16th International Conference on the European Energy Market (EEM), Ljubljana, Slovenia, 18–20 September 2019; pp. 1–5. [Google Scholar] [CrossRef]
  32. Csiszar, C.; Csonka, B.; Foldes, D.; Wirth, E.; Lovas, T. Urban public charging station locating method for electric vehicles based on land use approach. J. Transp. Geogr. 2019, 74, 173–180. [Google Scholar] [CrossRef]
  33. Yang, D.; Sarma, N.J.; Hyland, M.F.; Jayakrishnan, R. Dynamic modeling and real-time management of a system of EV fast-charging stations. Transp. Res. Part C Emerg. Technol. 2021, 128, 103186. [Google Scholar] [CrossRef]
  34. Peng, Y.X.; Zhu, W.W.; Zhao, Y.; Xu, C.S.; Huang, Q.M.; Lu, H.Q.; Zheng, Q.H.; Huang, T.J.; Gao, W. Cross-media analysis and reasoning: Advances and directions. Front. Inf. Technol. Electron. Eng. 2017, 18, 44–57. [Google Scholar] [CrossRef] [Green Version]
  35. Wang, Y.; Cao, J.; Tao, H. Graph convolutional network with multi-similarity attribute matrices fusion for node classification. Neural Comput. Applic 2021. [Google Scholar] [CrossRef]
  36. Tang, J.; Liang, J.; Liu, F.; Hao, J.; Wang, Y. Multi-community passenger demand prediction at region level based on spatio-temporal graph convolutional network. Transp. Res. Part C Emerg. Technol. 2021, 124, 102951. [Google Scholar] [CrossRef]
  37. Wang, J.; Liang, J.; Cui, J.; Liang, J. Semi-supervised learning with mixed-order graph convolutional networks. Inf. Sci. 2021, 573, 171–181. [Google Scholar] [CrossRef]
  38. Lei, F.; Liu, X.; Jiang, J.; Liao, L.; Cai, J.; Zhao, H. Graph convolutional networks with higher-order pooling for semisupervised node classification. Concurr. Comput. Pract. Exp. 2022, 34, e5695. [Google Scholar] [CrossRef]
  39. Csiszár, C.; Csonka, B.; Földes, D.; Wirth, E.; Lovas, T. Location optimisation method for fast-charging stations along national roads. J. Transp. Geogr. 2020, 88, 102833. [Google Scholar] [CrossRef]
  40. Gong, L.; Fu, Y.; Li, Z. Integrated planning of BEV public fast-charging stations. Electr. J. 2016, 29, 62–77. [Google Scholar] [CrossRef]
  41. Jain, A.; Zamir, A.R.; Savarese, S.; Saxena, A. Structural-rnn: Deep learning on spatio-temporal graphs. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, NV, USA, 27–30 June 2016; pp. 5308–5317. [Google Scholar] [CrossRef]
  42. Kipf, T.N.; Welling, M. Semi-supervised classification with graph convolutional networks. arXiv 2016, arXiv:1609.02907. [Google Scholar]
  43. Liu, M. Research on Spatiotemporal Evolution and Driving Mechanism of Traffic Flow in Changchun. Master’s Thesis, Northeast Normal University, Changchun, China, 2020. [Google Scholar]
  44. Ge, S.; Liang, F.; Hong, L. The planning of electric vehicle charging station based on Grid partition method. In Proceedings of the 2011 International Conference on Electrical and Control Engineering, Yichang, China, 16–18 September 2011; pp. 2726–2730. [Google Scholar] [CrossRef]
Figure 1. The pipeline for deciding charging stations using graph convolutional networks.
Figure 1. The pipeline for deciding charging stations using graph convolutional networks.
Sustainability 14 16797 g001
Figure 2. The administrative units of Changsha City and study area.
Figure 2. The administrative units of Changsha City and study area.
Sustainability 14 16797 g002
Figure 3. Network topology diagram.
Figure 3. Network topology diagram.
Sustainability 14 16797 g003
Figure 4. The distribution of POI and road network.
Figure 4. The distribution of POI and road network.
Sustainability 14 16797 g004
Figure 5. The training and verification results of the GCN model.
Figure 5. The training and verification results of the GCN model.
Sustainability 14 16797 g005
Figure 6. Candidate charging stations in three scenarios.
Figure 6. Candidate charging stations in three scenarios.
Sustainability 14 16797 g006
Figure 7. (a) Optimal charging station with 0.5 h charging time; (b) optimal charging station with 2 h charging time; and (c) optimal charging station with 6 h charging time.
Figure 7. (a) Optimal charging station with 0.5 h charging time; (b) optimal charging station with 2 h charging time; and (c) optimal charging station with 6 h charging time.
Sustainability 14 16797 g007
Figure 8. Distribution of charging stations.
Figure 8. Distribution of charging stations.
Sustainability 14 16797 g008
Table 1. Statistical table of maximum flow of urban roads under different road conditions.
Table 1. Statistical table of maximum flow of urban roads under different road conditions.
Road ClassFree SpeedMaximum Flow
SmoothSlow DownCongestion
180163623401076
26512781901861
35510731609646
4459131317430
Table 2. Average floor area of charger.
Table 2. Average floor area of charger.
Number of ChargersAverage Floor Area
3023
1522.5
820
Table 3. The values of the relevant parameters.
Table 3. The values of the relevant parameters.
ParameterValueParameterValue
C M USD 27,780 e 1 j USD 111,120
C j USD 266,688 e 2 j USD 83,340
C e USD 0.11112/kwh e 3 j USD 55,560
C C u / C F e USD 0.005556/kwh n k 20
C L / C W USD 0.006945/kwh μ 3%
T e 20 (h) r 0 0.12
T r 2
Table 4. Comparison of planned charging stations and existing charging stations.
Table 4. Comparison of planned charging stations and existing charging stations.
ScenariosNumber of Charging StationsProbability of Similarity to Existing Charging Stations
Scenario I10167.3%
Scenario II11560.9%
Scenario III10077%
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Qin, J.; Qiu, J.; Chen, Y.; Wu, T.; Xiang, L. Charging Stations Selection Using a Graph Convolutional Network from Geographic Grid. Sustainability 2022, 14, 16797. https://doi.org/10.3390/su142416797

AMA Style

Qin J, Qiu J, Chen Y, Wu T, Xiang L. Charging Stations Selection Using a Graph Convolutional Network from Geographic Grid. Sustainability. 2022; 14(24):16797. https://doi.org/10.3390/su142416797

Chicago/Turabian Style

Qin, Jianxin, Jing Qiu, Yating Chen, Tao Wu, and Longgang Xiang. 2022. "Charging Stations Selection Using a Graph Convolutional Network from Geographic Grid" Sustainability 14, no. 24: 16797. https://doi.org/10.3390/su142416797

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop