Multiple domination models for placement of electric vehicle charging stations in road networks
Electric and hybrid vehicles play an increasing role in the road transport networks. Despite their advantages, they have a relatively limited cruising range in comparison to traditional diesel/petrol vehicles, and require significant battery charging time. We propose to model the facility location problem of the placement of charging stations in road networks as a multiple domination problem on reachability graphs. This model takes into consideration natural assumptions such as a threshold for remaining battery load, and provides some minimal choice for a travel direction to recharge the battery. Experimental evaluation and simulations for the proposed facility location model are presented in the case of real road networks corresponding to the cities of Boston and Dublin.
keywords:Road networks, Electric vehicles, Facility location problem, -Domination, -Domination, Heuristic optimization
rmkRemark \newproofpfProof \newproofpotProof of Theorem LABEL:thm2
Due to increasing concerns about the environment, the resulting policies and advances in technology, zero and low emission electric and hybrid vehicles are playing an ever more important role in road transportation. Despite the advantages of electric vehicles, their relatively limited cruising range (in comparison to traditional diesel/petrol vehicles) and significant battery charging time often provide major challenges to their usage.
As a result, in order for electric vehicles to be viable, it is necessary to have a sufficient number of charging stations which are appropriately distributed throughout a road network. Given a particular road network layout, determining appropriate locations and capacities for such charging stations is a challenging multi-objective optimisation problem with many constraints. One of the key objectives is to minimise the length of detours from a desired route which are necessary for recharging. On the other hand, constraints in this optimisation problem include requiring the number of charging stations to be reasonably small, ensuring the distance between consecutively used stations does not exceed the cruising range of electric vehicles, and that the capacities of the charging stations be sufficient enough to avoid bottlenecks. In this article, we focus on the problem of optimising the placement of charging stations such that the length of detours necessary for recharging is minimised subject to the constraint that the number of charging stations is reasonably small.
In the existing literature (e.g., see FNS2015 ()), the problem of charging station placement is often modelled as a shortest-path vertex cover problem for graphs. In this model, a vehicle is assumed to begin with a fully charged battery and follow a shortest path from an initial point to a final destination without much deviation. However, in many cases this assumption is not going to be valid, and the model in question is not going to be suitable. For example, mail or groceries delivery drivers are usually concerned with navigating in a way prescribed by delivery options (in time and space), and are not particularly concerned about shortest paths issues when navigating a certain area. Also, traffic jams, road closures and other temporary or sudden obstacles (e.g., a snow storm in Canada) may significantly influence the originally intended shortest path for driving. As a result, it is more natural and plausible to assume that drivers will become concerned about their remaining cruising range and battery charge only after the battery level falls below a certain low threshold, implying the remaining distance they can travel is quite limited.
In this work we propose a novel model for the placement of charging stations in road networks which is based on computing multiple domination models for a reachability graph corresponding to the original road network. A reachability graph models the set of locations which are reachable from a given location, where a location is reachable if its distance from the location in question is below a certain threshold. The reachability graph appropriately models the situation where a driver becomes concerned about their low battery charge and wishes to make a detour to a recharging station which is reachable from their current location. By considering multiple domination models on the reachability graph, we can compute a set of charging stations locations such that each location in the network can be served from several charging stations. That is, multiple charging stations are reachable from each such location. The driver therefore has several charging stations options to select from and can in turn select the one which minimises the necessary detour.
The layout of this paper is as follows. In Section 2 we provide a concise overview of related work. The proposed facility location problem model is presented in Section 3. Section 4 describes the algorithms used to compute the reachability graph and multiple domination models for the road network, provides some analysis and explains heuristic adjustments for the algorithms. An experimental evaluation using real road networks corresponding to the cities of Boston and Dublin is presented in Section 5. Finally, in Section 6 we draw some conclusions and discuss possible future research directions.
2 Related work
There exist quite a large volume of recent literature related to electric vehicles and optimization in road networks focusing on different aspects of problem modelling and corresponding solution methods. For example, Poghosyan et al. PGHL2015 () discuss possible scenarios of distribution of loads in the power grids and their dependence on temporal, spatial, and behavioural charging patterns for electric vehicles.
Given a set of charging stations and their locations fixed in the network, the authors in SF2013 () propose a method for computing all locations which are reachable from a given initial location, assuming a specified number of battery recharges can be done. In this work, the locations of the charging stations are assumed to be fixed, and there is no attempt to optimize the placement of charging stations in the network.
In LLC2014 (), the authors consider a specific type of the general facility location problems called the electric vehicle charging station placement problem. In their work, they try to minimize construction costs for placement of charging stations in few pre-selected locations subject to a set of constraints. The problem is modelled by using mixed-integer linear programming (MILP) with some non-linear constraints. The authors show that the problem is NP-hard and propose several solution methods by reduction to MILP problems and using heuristics. An experimental evaluation is first done with randomly generated small-size synthetic instances using MATLAB and generic MILP solvers. Then the model and methods are evaluated in the case of possible scenarios of building charging stations in Hong Kong by considering pre-selected locations for potential construction of charging stations corresponding to different districts of the country. Notice that, in this model, the sites for potential construction of charging stations are pre-selected, and the average cruising distance of fully-charged electric vehicles is used to select the sites minimizing the total construction costs.
In FNS2015 (), the authors model the problem of placement of charging stations as a “shortest path” cover problem in a graph of the road network . One needs to find a smallest subset of vertices such that every minimal shortest path in that exceeds the electric vehicle battery capacity has a loading station placed in a vertex of the set . The problem is then modelled as a special type of the Hitting Set problem: the collection of subsets of to be hit by the charging stations corresponds to the minimal shortest paths in that exceed the battery capacity. An adaptation of the standard greedy approach provides an -approximation algorithm to solve this problem. The instance construction and representation are described as the main challenges with respect to using limited computational memory and time resources. As a result, using different representations and searching for minimal shortest paths turns out to be a quite complicated task and is involved with many details. Overall, the problem does not seem to scale well, and the heuristic improvements for the implementation would be very challenging to reproduce.
3 Reachability graph and multiple domination models
For simplicity, we consider a road network represented by a weighed undirected simple graph , where the set of vertices corresponds to road intersections and dead-ends, while the set of edges corresponds to road segments connecting these vertices. The weight on an edge is the length of the corresponding road segment (in meters). An example of this graph model for the road network of the city of Boston is illustrated in Figure 1.
Given a road network graph , we define its reachability graph as a simple (unweighted) graph with and edges if and only if the length of shortest path (distance) between the corresponding vertices and in is less than a specified reachability threshold of km, i.e. , where and are a shortest path and corresponding distance between and in , respectively. The reachability graph corresponding to the Boston road network of Figure 1 for km is illustrated in Figure 1. In this figure, red line segments are drawn between a given vertex and each of its neighboring vertices in . The reachability graph appropriately models the situation where a driver becomes concerned about their low battery and wishes to make a detour to a recharging station which is reachable from their current location.
Notice that the reachability threshold to construct a reachability graph should normally satisfy the following lower bound derived from the road network graph :
where is a set of all vertices adjacent to in , and . In other words, from any given point , it should be possible to reach at least one of the neighbouring locations using the remaining battery power (to eventually recharge the battery). This would imply the reachability graph has no isolates. Similarly, for better flexibility, more choice, and “safer” conditions for reaching possible recharging locations, one may impose the stronger lower bound for the threshold
This would mean it is possible to reach all the neighbouring locations from any given point using the remaining battery power. The lower bound (2) would imply the vertex degrees of are at least the corresponding vertex degrees of .
However, in the case of a small number of remote locations which are more difficult to reach in the network, it may be too demanding and expensive to satisfy the lower bound (2) or even (1) for the whole network. Therefore, when conditions of the lower bound (2) or (1) are not satisfied, the remote locations (“outliers” of the road network) should be treated separately. Thus, the “outliers” are considered in our models as well.
Having constructed a road network graph and a corresponding reachability graph , the problem of placing charging stations in the road network becomes a facility location problem which can be modelled on the graphs and as follows. In general, if is a graph of order , then is the set of vertices of , the degree of vertex is denoted by or , , the minimum and maximum vertex degrees of are denoted by and , respectively. The neighbourhood of a vertex in is denoted by . A subset is called a dominating set of if every vertex not in is adjacent to at least one vertex in . The minimum cardinality of a dominating set of is called the domination number of and denoted by . Dominating sets in graphs are natural general models for facility location problems in networks.
Given an integer , a set is called a -dominating set of if every vertex has at least neighbours in . The minimum cardinality of a -dominating set of is the -domination number . Clearly, , and when . Given a real number , , a set is called an -dominating set of if for every vertex , , i.e. has at least (i.e. ) neighbours in . The minimum cardinality of an -dominating set of is called the -domination number . It is easy to see that , and for . Also, when is sufficiently close to .
The - and -domination are two types of multiple domination in graphs. The concept of -domination differs from the -domination in that a vertex must be dominated by a certain percentage () of the vertices in its neighbourhood instead of a fixed number of its neighbours. Each of these two types of multiple domination can be used to model the situation when an electric vehicle driver starts to look for a conveniently located battery charging station and needs to have several options where to recharge the battery. In this paper, we focus on -domination, which means that in any location (vertex) of the network (graph) the driver can use one out of possible options, . Clearly, in the case , this model suggests that the vertices of degree less than are all included into the -dominating set or ignored (i.e. treated separately). Therefore, without loss of generality, we can assume .
The problems of finding exact values of and are known to be NP-complete LC2013 (); DHLM2000 (). Therefore, it is important to have efficient heuristic algorithms and methods to find small-size - and -dominating sets in graphs. Also, it is important to have good theoretical bounds for and to be able to estimate quality of a given solution set. The following two general upper bounds for the - and -domination numbers have been obtained in GPZ2009 (); GPZ2013 () by using a probabilistic method approach. These bounds generalize a classic upper bound for the domination number . Also, the probabilistic constructions used in the proofs of these bounds allow us to design randomized algorithms to find - and -dominating sets such that the expected order of the set of vertices returned by the algorithm satisfies the corresponding upper bound.
Putting and where , we have:
Theorem 1 (Gpz2013 ()).
For every graph with ,
For , we put and Then we have:
Theorem 2 (Gpz2009 ()).
For every graph ,
Clearly, given a reachability graph , increasing the reachability threshold can only extend the neighbourhoods of vertices in to obtain , , i.e. is a spanning subgraph of . Therefore, given a -dominating set in , one can infer some properties about this set in the reachability graph , where . Clearly, having and the set fixed, , and every vertex is dominated by at least vertices in . Then, as the reachability threshold increases, keeping the set fixed and considering as a parameter, the number can be eventually increased. When the reachability threshold is at least the diameter of the network graph , the reachability graph becomes a complete graph, and every vertex is dominated by all the vertices in , so that we can set .
If , one cannot infer any domination properties of the -dominating set of in the (spanning) reachability graph . However, as approaches , the set is going to start to behave like a -dominating set with respect to the reachability graph , and eventually the reachability threshold can be lowered. Some of the above properties are illustrated in the experimental results section of this paper.
4 Basic algorithms, heuristics, their implementation and complexity analysis
In this section, we describe the basic algorithmic ideas and routines to compute the reachability graphs and to find -dominating sets in the reachability graphs. They are developed from and based on the theoretical results described in AS1992 (); GPZ2013 () and our simulations and experiments with real road networks of Dublin and Boston. The -dominating sets in the reachability graphs are facility location points for charging stations in the corresponding road network.
4.1 Computing the reachability graph
The following procedure is used to compute the reachability graphs . First, the vertices of are copied into . Next, for each vertex in , we add an edge between and all the vertices in which are within the distance from in . Here the distance between two vertices of is measured as the length of a shortest path. This is accomplished by performing a modification of the breadth-first search from the source vertex in . Specifically, we employ Dijkstra’s algorithm, but terminate the search when all vertices within a network distance of have been found. In our simulations, the graph is sparse. Therefore, to minimize running time, we implemented Dijkstra’s algorithm using a binary heap based priority queue. This gives a running time of for each call of this algorithm BH15 (). This algorithm is called for each as the source vertex, giving a total running time of for computing the reachability graph.
4.2 Computing -dominating sets in reachability graphs
Algorithm 1 below is a randomized heuristic to compute a small-size -dominating set in and is an adjustment of the corresponding randomized algorithm from GPZ2013 (). It uses as an input a reachability graph and a positive integer , . Algorithm 1 returns a (minimal by inclusion) -dominating set in , which provides a set of locations for charging stations in such that, from any given point (vertex) in , a driver has at least different feasible options to reach a charging station when the remaining driving battery charge is enough for kilometers. In general, the order of the -dominating set in returned by Algorithm 1 satisfies the upper bound of Theorem 1 with a positive probability, i.e. the expectation of the order of satisfies the upper bound of Theorem 1.
The upper bound of Theorem 1 is known to be asymptotically best possible for general graphs on vertices in the case of -dominating sets (e.g., see A1990 ()). In general, it is currently one of the best bounds for and likely to be asymptotically best possible for arbitrary , . However, it turns out that the bound of Theorem 1 is not sharp enough in the case of particular reachability graphs of road networks for Boston and Dublin. As a result, randomized Algorithm 1 usually returns a non-minimal -dominating set of an unreasonably large size. Therefore, instead of using the minimum vertex degree of the reachability graphs to compute the probability and parameters and in Algorithm 1, we use in our experiments the average vertex degree of , i.e.
In general, using instead of in Algorithm 1 doesn’t guarantee obtaining a -dominating set satisfying the upper bound of Theorem 1. However, in the particular cases of road networks of Boston and Dublin, using in Algorithm 1 provides good computational results satisfying the upper bound of Theorem 1 as well. Notice that we have .
Our implementation of randomized Algorithm 1 is enhanced with some other heuristics as well, and we run it several times to obtain smaller size -dominating sets in .
In the experiments, we have compared the results obtained by using the randomized approach of Algorithm 1 with those returned by a simple recursive greedy method described in Algorithm 2.
Notice that, when , Algorithm 2 is a simple deterministic (greedy) approach derandomizing Algorithm 1 (e.g., see AS1992 ()). However, as already suggested by the results for in HH2008 (), it can be a marvellous task to derandomize Algorithm 1 or similar randomized algorithms in general. The results returned by Algorithm 2 have been used as a benchmark to run Algorithm 1 several times to obtain better results (all satisfying the upper bound of Theorem 1).
The original -dominating sets returned by Algorithms 1 and 2 are normally not minimal (by inclusion). Therefore, we have used a simple greedy procedure to reduce them to minimal -dominating sets and to check that the final -dominating sets are minimal. A pseudocode for this elimination of redundancy is presented in Algorithm 3.
4.3 Complexity analysis for the randomized algorithm
Computing the binomial coefficient in Algorithm 1 is normally done by using the dynamic programming and Pascal’s triangle, which has time complexity in this case. The minimum vertex degree of can be computed in linear time in the number of edges of . Notice that does not exceed . Therefore, computing probability can be done in time. It takes time to find the set , where is the number of vertices in . The numbers for each vertex can be computed separately or when finding the set . We need to keep track of them only while . Since we may need to browse through all the neighbours of vertices in , in total, it can take steps to calculate all the necessary ’s for all . Then the set can be also found in steps. Thus, in total, Algorithm 1 runs in time. Since we heuristically use the average vertex degree instead of the minimum vertex degree in our experiments with Algorithm 1, the complexity analysis of its implementation is slightly different, but can be easily derived from the analysis above.
It is possible to use simple heuristics when computing set in Algorithm 1. First, we can build set recursively, considering the undercovered vertices in one by one. Then, we may want to include the most undercovered vertices, i.e. vertices with the smallest intersection , into first, and update set gradually by including the new vertices from directly into to form . This would recursively update the numbers , make some of the undercovered vertices covered enough with at least neighbours in , and increase the coverage score for some (in comparison to ) to influence selection of the next vertex for in iteration. A heuristic “greedy extension” of procedure to find the sets is similar to Algorithm 2.
Finally, since the initial recursively obtained -dominating set may be not minimal, we try to exclude some vertices from . This is implemented by removing vertices from one by one and checking whether the -domination property still holds. A heuristic procedure to guarantee the minimality of the returned -dominating set is described in Algorithm 3.
5 Experimental evaluation
In this section, in order to evaluate the proposed methodology, we describe our experiments with multiple domination models and corresponding algorithms in the case of two road network graphs corresponding to the cities of Boston in the USA and Dublin in Ireland.
The two road networks in question are illustrated in Figures 1 and 2, respectively, and are obtained from OpenStreetMap Cor2013 (). The graph corresponding to Boston consists of vertices and edges. It is contained within a rectangular region of width km and height km. The graph corresponding to Dublin consists of vertices and edges. It is contained within a rectangular region of width km and height km. Notice that both road network graphs are either planar or “almost” planar: when considering them embedded in the plane as road maps, the edge crossings are only possible in the case of road bridges and tunnels. Moreover, these two graphs are sparse in terms of the number of edges , which satisfies the linear upper bound in terms of the number of vertices for planar graphs, , , as opposite to the general worst case quadratic upper bound , i.e. .
The most appropriate reachability threshold for the reachability graph is a function of a large number of parameters. This includes the number of electrical vehicles which require charging, the number of charging stations one is able to install, the number of charging options one wishes to offer, and the cost of installing a charging station. Determining this threshold would probably best be done by consultation with city planners. In this paper, we assume the most appropriate reachability threshold for both cities’ road networks and electrical vehicles is set to be km.
For each road network graph , we computed the corresponding reachability graph . These graphs are illustrated in Figures 1 and 2. The reachability graph corresponding to Boston contains vertices and edges (approx. ). The reachability graph corresponding to Dublin contains vertices and edges (approx. ). All -dominating sets are computed using these two reachability graphs.
5.2 Cardinality of -dominating sets
For each of the reachability graphs , one -dominating set was computed using the greedy algorithm, and ten -dominating sets were computed using the randomized algorithm for . Table 1 displays the cardinalities of the -dominating sets computed using the greedy algorithm and the cardinalities of the smallest -dominating sets computed using the randomized algorithm for each of the cities and each value of . In four out of the six cases, the randomized algorithm computed a smaller dominating set than the same multiplicity dominating set returned by the greedy algorithm. The two -dominating sets for the city of Boston are displayed in Figure 3. The two -dominating sets for the city of Dublin are displayed in Figure 4.
A visual inspection of Figures 3, 4, and others reveals that spatial locations of the elements in the dominating sets tend to be more spatially clustered when computed using the greedy algorithm. This can be attributed to the greedy nature of the approach: vertices of high degree in the corresponding reachability graphs tend to be spatially clustered, and the greedy algorithm will add these high degree vertices to the dominating set first. On the other hand, the randomized algorithm initially adds a random set of vertices to the future dominating set, and these vertices are likely to be spatially distributed in a uniform way.
5.3 Reachability of stations
Given a fixed -dominating set in a reachability graph corresponding to a road network graph , the number of elements in reachable from a given vertex in is a non-decreasing function of distance. To examine this phenomenon, we consider the smallest -dominating sets computed using the randomized algorithm for Boston and Dublin. These two sets contain and elements, respectively. The set corresponding to Boston is illustrated in Figure 3.
We computed the mean and standard deviation of the number of vertices in reachable from a vertex in as a function of distance. These values are displayed in Table 2. An analysis of this table reveals the following facts. Despite the fact that the dominating sets were computed for a reachability graph with the reachability threshold of km, the mean number of vertices in within a distance of km of a vertex in for each of the cities is . Furthermore, for both cities, the mean number of elements in within the distance of km from a vertex in is significantly larger than . This means more support and flexibility than only a priory guaranteed options for recharging electrical vehicles in many points of these road networks.
On the other hand, increasing the reachability threshold to some km and keeping the set of vertices fixed in should allow us to increase the minimum multiplicity of coverage of each vertex by the vertices in to have as a -dominating set with in . We have computed the minimum multiplicity of coverage by the same -dominating sets in the corresponding reachability graphs with the reachability threshold increasing to , and km. As shown in the corresponding columns of Table 2, this increase of the reachability threshold haven’t allowed us to increase the minimum number of options for the city of Boston, but have turned the -dominating set of into a -dominating set in for the city of Dublin. In other words, the drivers in Dublin are going to have at least options available within the distance of km for recharging the batteries when using the same -dominating set from .
5.4 Detour required
The number of options available for recharging electrical vehicles in a road network increases as a function of the multiplicity value in the corresponding -dominating set. In turn, this may reduce the length of detours required for recharging electrical vehicles. To quantify this phenomenon, we consider the situation where a driver of an electrical vehicle wishes to travel from a source location to a destination, but first needs to have their vehicle recharged. Therefore, the driver considers all charging stations within the distance of km from the source and charges their vehicle at a charging station which minimizes the detour. Here the detour is the difference between the distance from source to destination and the sum of distances from source to the charging station and from the charging station to destination.
To illustrate this, consider Figure 5 and the situation where the source and destination are represented by red dots in the left and upper right of the figure, respectively. Considering the smallest -dominating set computed using the randomized algorithm ( vertices, see Table 1 and Figure 3), there are five charging stations within the distance of km from the source. These five charging stations are represented by green dots in Figure 5. The route which minimizes the detour is represented by the blue line in the figure, and the detour in question is only meters.
For each of the cities of Boston and Dublin, we have selected two hundred random pairs of source and destination locations, and for each pair of the locations, the corresponding detour for recharging was calculated. Considering the smallest -dominating sets computed using the randomized algorithm for different values of , the corresponding mean and standard deviation of detours required for recharging are displayed in Table 3. As expected, for both cities, the mean and standard deviation values decrease as the multiplicity of domination parameter increases.
In this paper, we show analysis and good suitability of multiple domination models for decision problems related to efficient and effective placement of charging stations for electrical vehicles in the road networks. These results can serve as a first approximation to more complicated mathematical models with real road networks and their constraints. We plan to develop this research in the direction of more subtle road and transportation network models, for example, using digraphs and -domination models.
The experimental results with the road networks of Dublin and Boston indicate that sensitivity of the upper bound of Theorem 1, which is strong in general graphs, can be improved in particular cases. Therefore, we conjecture that more sensitive upper bounds similar to Theorem 1 can be obtained by considering the degree sequence of a graph and some other of its parameters and properties. In particular, it would be interesting to obtain a stronger version of Theorem 1 in the case of reachability graphs corresponding to planar or “almost” planar graphs derived from the spacial layouts of road networks.
- (1) N. Alon, J.H. Spencer, The Probabilistic Method, John Wiley & Sons Inc., New York, 1992.
- (2) N. Alon, Transversal numbers of uniform hypergraphs, Graphs Combin. 6 (1990), 1–4.
- (3) H. Bast, D. Delling, A. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, R. Werneck, Route planning in transportation networks, Algorithm Engineering: Selected Results and Surveys, Lecture Notes in Computer Science 9220, (2016), 19–80.
- (4) P. Corcoran, P. Mooney, M. Bertolotto, Analysing the growth of OpenStreetMap networks, Spatial Statistics 3 (2013), 21–32.
- (5) J.E. Dunbar, D.G. Hoffman, R.C. Laskar, L.R. Markus, -Domination, Discrete Math. 211 (2000), 11–26.
- (6) S. Funke, A. Nusser, S. Storandt, Placement of Loading Stations for Electric Vehicles: No Detours Necessary!, Journal of Artificial Intelligence Research 53 (2015), 633–658.
- (7) A. Gagarin, A. Poghosyan, V.E. Zverovich, Upper bounds for -domination parameters, Graphs Combin. 25 (2009), 513–520.
- (8) A. Gagarin, A. Poghosyan, V. Zverovich, Randomized algorithms and upper bounds for multiple domination in graphs and networks, Discrete Appl. Math. 161 (2013), 604–611.
- (9) J. Harant, M.A. Henning, A realization algorithm for double domination in graphs, Util. Math. 76 (2008), 11–24.
- (10) A.Y.S. Lam, Y.-W. Leung, X. Chu, Electric vehicle charging station placement: formulation, complexity, and solutions, IEEE Transactions on Smart Grid 5 (2014), 2846–2856.
- (11) J.K. Lan, G.J. Chang, Algorithmic aspects of the -domination problem in graphs, Discrete Appl. Math. 161 (2013), 1513–1520.
- (12) A. Poghosyan, D.V. Greetham, S. Haben, T. Lee, Long term individual load forecast under different electrical vehicles uptake scenarios, Applied Energy 157 (2015), 699–709.
S. Storandt, S. Funke,
Cruising with a Battery-Powered Vehicle and Not Getting Stranded,
In Proc. of the AAAI Conference on Artificial Intelligence, Vol. 3. (2012), 1628–1634.