Charging Station Location Problem Research Articles

A Type-2 fuzzy hybrid preference optimization methodology for electric vehicle charging station location

This work focuses on a hybrid preference-based electric vehicle charging station location problem, which considers multiple optimization preferences of distribution network operators, charge station owners, and electric vehicle users. The problem is formulated by an uncertain mixed-integer programming model. Due to the multi-fold uncertainty of the charging process, the uncertain model parameters are expressed as Type-2 fuzzy variables (T2-FVs). The critical value-based type reduction method is adopted to handle the high computational complexity. The proposed uncertain model is converted to its equivalent deterministic chance-constrained programming model. The deterministic counterpart is solved by General Algebraic Modeling System (GAMS). At last, numerical simulations are performed to demonstrate the proposed location strategy as well as some sensitivity analyses. The results indicate that for any given parameters, the equivalent deterministic model follows the general form of mixed-integer programming one that can be easily solved by GAMS. The proposed methodology can effectively handle the multi-fold uncertainty of the charging process. Compared with crisp models, the proposed location strategy can provide more robust location decisions for electric vehicle charging stations (EVCSs). In addition, we also found that different interest groups have conflicting preferences for the locations of EVCSs, so considering multiple hybrid optimization preferences is necessary.

Robust Charging Network Planning for Metropolitan Taxi Fleets

We study the robust charging station location problem for a large-scale commercial taxi fleet. Vehicles within the fleet coordinate on charging operations but not on customer acquisition. We decide on a set of charging stations to open to ensure operational feasibility. To make this decision, we propose a novel solution method situated between the location routing problems with intraroute facilities and flow refueling location problems. Additionally, we introduce a problem variant that makes a station sizing decision. Using our exact approach, charging stations for a robust operation of citywide taxi fleets can be planned. We develop a deterministic core problem employing a cutting plane method for the strategic problem and a branch-and-price decomposition for the operational problem. We embed this problem into a robust solution framework based on adversarial sampling, which allows for planner-selectable risk tolerance. We solve instances derived from real-world data of the metropolitan area of Munich containing 1,000 vehicles and 60 potential charging station locations. Our investigation of the sensitivity of technological developments shows that increasing battery capacities shows a more favorable impact on vehicle feasibility of up to 10 percentage points compared with increasing charging speeds. Allowing for depot charging dominates both of these options. Finally, we show that allowing just 1% of operational infeasibility risk lowers infrastructure costs by 20%. Funding: This work was partially funded by the Deutsche Forschungsgemeinschaft [Project 277991500]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0207 .

Optimal en-route charging station locations for electric vehicles with heterogeneous range anxiety

This paper addresses a new optimal charging station location problem for intercity highway networks where electric vehicles are of heterogeneous driving ranges and usually need to be charged multiple times in their long-haul trips. Driving range heterogeneity can be measured in practice by sampling the driving population under a variety of physical, environmental and psychological conditions and is characterized in this study by a continuous distribution of some appropriate forms. The behavioral assumption underlying this problem is that all individual drivers choose their optimal route-and-charge choices if they can make a trip by driving an electric vehicle or cancel their trips or switch to other transportation modes if they cannot. By explicitly taking into account the impact of limited driving ranges on both route and trip/mode choices, we constructed a mixed integer linear programming model for formulating the charging station location problem, the goal of which is to maximize the networkwide travel efficiency and preference subject to a limited infrastructure investment budget. To tackle this integer programming model, we developed a branch-and-bound algorithm and a neighborhood search heuristic, in both of which a multi-criterion label-correcting algorithm is embedded for deriving the underlying route-and-charge flow pattern. For justifying the effectiveness and efficiency of the proposed algorithms, a synthetic network and two real-world networks are employed as numerical examples. The computational results obtained from the numerical analysis show that the heuristic is capable of obtaining optimal solutions in most test scenarios and is much more computationally efficient than the branch-and-bound algorithm, with a computing time that is only about one tenth of the latter.

Learning-based demand-supply-coupled charging station location problem for electric vehicle demand management

We present a learning-based, demand-supply-coupled optimization model for the charging station location problem (CSLP), aiming to integrate the concept of electric vehicle (EV) charging demand management into the planning of charging infrastructures. In stage one, a gradient boosting-based learning model is developed to predict the charging demand of a charging station based on 15 defined features. Next, in stage two, a demand–supply-coupled CSLP model is developed to optimize the total charging usage rates of both existing and newly selected charging stations. We design a gradient-based stochastic spatial search algorithm to solve the proposed model. A case study with 6-year charging event data from Kansas City Missouri is performed. Results show that the proposed method can generate satisfactory charging demand predictions, and can increase charging usage rates by 14%, outperforming two benchmark approaches. The results of this research are poised to guide agencies in identifying optimal locations for new charging stations.

Optimal planning and allocation of Plug-in Hybrid Electric Vehicles charging stations using a novel hybrid optimization technique.

India's expanding population has necessitated the development of alternate transportation methods with electric vehicles (EVs) being the most indigenous and need for the current scenario. The major hindrance is the undue influence on the power distribution system caused by incorrect charging station setup. Renewable Energy Sources (RES) have a lower environmental impact than the non-renewable sources of energy and due to which Plug-in Hybrid Electric Vehicles (PHEV) charging stations are installed in the highest-ranking buses to facilitate their effective placements. Based on meta-heuristic optimization, this study offers an effective PHEV charging stations allocation approach for RES applications. The primary objective of the developed system is to create a charging network at a reasonable cost while maintaining the operational features of the distribution network. These troublesare handled by applying meta-heuristic algorithms and optimum planning based on renewable energy systems to satisfy the outcomes of the variables. As a result, by adding charging station parameters, this research proposes to conceptualize the distribution of optimal charging stationsas multiple-objectives of the problem. Furthermore, the PHEV RES and charging station location problem is handled in this study by deploying a novel hybrid algorithm termed as Atom Search Woven Aquila Optimization Algorithm (AT-AQ) that includes the ideas of both Aquila Optimizer (AO) and Atom Search Optimization (ASO) Algorithms. In reality, Aquila Optimizer is a unique population-based optimization approach energized by Aquila's behaviour when seeking prey and it solves the problems of slow convergence and local optimum trapping. According to the findings of the experiments, the proposed model outperformed the other methods in terms of minimized cost function.

Mathematical program with equilibrium constraints approach with genetic algorithm for joint optimization of charging station location and discrete transport network design

ABSTRACT This paper focuses on the joint optimization of the charging station location problem (CSLP) and discrete network design problem (DNDP) in a transportation network. We present a variational inequality (VI) formulation to describe the user equilibrium (UE) state of gasoline vehicles (GVs) and electric vehicles (EVs). Based on the mixed-UE model, a mathematical program with equilibrium constraints (MPEC) model is formulated for integrating the decisions of deploying EV charging stations (EVCSs) and adding new links to minimize the total travel cost (TTC) of all vehicles. A modified genetic algorithm is developed to tackle the MPEC model with an adaptive path generation procedure to address the mixed-UE model. Finally, we conduct numerical experiments to identify the efficacy of the proposed models and algorithms. Specifically, we propose a two-step optimization model and explore a performance comparison between the joint and two-step optimization approaches, while the joint optimization exhibits superiority in minimizing the TTC.

Optimal Placement of Charging Stations in Road Networks: A Reinforcement Learning Approach with Attention Mechanism

With the aim of promoting energy conservation and emission reduction, electric vehicles (EVs) have gained significant attention as a strategic industry in many countries. However, the insufficiency of accessible charging infrastructure remains a challenge, hindering the widespread adoption of EVs. To address this issue, we propose a novel approach to optimize the placement of charging stations within a road network, known as the charging station location problem (CSLP). Our method considers multiple factors, including fairness in charging station distribution, benefits associated with their placement, and drivers’ discomfort. Fairness is quantified by the balance in charging station coverage across the network, while driver comfort is measured by the total time spent during the charging process. Then, the CSLP is formulated as a reinforcement learning problem, and we introduce a novel model called PPO-Attention. This model incorporates an attention layer into the Proximal Policy Optimization (PPO) algorithm, enhancing the algorithm’s capacity to identify and understand the intricate interdependencies between different nodes in the network. We have conducted extensive tests on urban road networks in Europe, North America, and Asia. The results demonstrate the superior performance of our approach compared to existing baseline algorithms. On average, our method achieves a profit increase of 258.04% and reduces waiting time by 73.40%, travel time by 18.46%, and charging time by 40.10%.

An Optimization Approach for A Biogas Supply Chain using Goal Programming and Mixed Integer Linear Programming

Environmental concerns prompt the world for a transition to renewable energy sources from fossil energy. Reducing the dependency on non-renewable sources of energy is prerequisite for the sustainable world and less environmental pollution. Biogas energy, which is one of the most important renewable energy sources, is produced by burning organic wastes and can be used in many different fields. In this study, a two-stage approach is undertaken to optimize a biogas supply chain design by incorporating of 30 districts in Izmir. In the first stage, the selection of the most suitable biogas plants is considered by the goal programming approach, which is of great importance to decide the optimal location with high energy potential. The most suitable sites for the biogas plants are obtained as Konak and Narlıdere districts. In the second stage, the location problem of the biogas vehicle charging stations (BVS) for biogas vehicles is handled considering the results of the first stage using mixed integer linear programming (MILP) approach. Computational results demonstrate that it would be more appropriate to establish BVS in 12 districts of İzmir. The model and solution approach are pioneering for supply chain problems and an efficient tool for renewable energy plans.

A facility location problem in a mixed duopoly on networks

This paper studied a facility location problem (FLP) between a public firm and a private firm on a network space. Diverse situations are presented, and the corresponding mathematical formulations are modeled by implementing the optimization approach. The relationships between the models are then analyzed mathematically, showing the existence of complementarity and dominance. Considering the increasing interest in electric vehicle (EV) charging stations and the relevance to our models, computational experiments for a charging station location problem (CSLP) follow this in order to validate the presented models and verify the analyses. The trade-off between the stakeholders’ objectives is demonstrated, providing policy implications for the public sector and managerial insights for private investors.

Optimal Layout of Electric Vehicle Charging Station Locations Considering Dynamic Charging Demand

This paper proposes an optimization method for electric vehicle charging station locations considering dynamic charging demand. Firstly, the driving characteristics and charging characteristics of the electric vehicle are obtained based on the driving trajectory of the electric vehicle, and the charging demand is predicted using a Monte Carlo simulation. Then a mathematical model with the goal of minimizing the overall cost is constructed, and the impact on carbon emissions is considered in the model. In order to better solve the location model, an improved whale optimization algorithm based on a hybrid strategy is proposed. Finally, the location problem of Shenzhen electric taxi charging stations is analyzed as an example. The results show that when the number of charging stations is set to 19, the comprehensive cost is the smallest and the energy saving and emission reduction effect is good. The improved whale optimization algorithm also has higher solution accuracy and convergence speed than other classical algorithms.

A stabilizing benders decomposition method for the accessibility-oriented charging station location problem

Electric vehicles are a promising selection to deal with climate change and energy crises. However, the development of electric vehicles is impeded by various barriers including shortened driving range, lack of charging facilities, and long recharging periods. Setting additional charging facilities is essential to construct an efficient charging network. Previous studies neglected accessibility-oriented indicators to locate charging stations. This study locates charging stations by maximizing the space-time-electricity accessibility of electric vehicle travelers. For the accessibility-oriented charging station location problem, we formulate a multi-commodity network flow model in the space-time-electricity network. Then, we reformulate this model into a two-stage integer program and develop a Benders decomposition method with stabilizing techniques. At each iteration, a relaxed Benders master problem (RMP) and a set of dual routing subproblems (DSPs) are solved. The RMP provides an ascending lower bound and a feasible charging station location scheme. These DSPs generate a set of Benders optimality cuts for RMP and a feasible solution to update the upper bound. All instances in three transportation networks are solved optimally, showing that the stabilizing techniques can significantly improve the performance of the standard Benders decomposition method.

Charging station location problem for maximizing the space-time-electricity accessibility: A Lagrangian relaxation-based decomposition scheme

The driving range of electric vehicles limits the accessibility of their users. Charging infrastructures such as charging stations are essential to improve the accessibility of electric vehicles. Existing charging station location studies neglected accessibility-based indicators in their optimization models. For the charging station location problem, this paper proposes a novel objective function that maximizes the space–time-electricity accessibility of electric vehicles. Then we formulate an integer-programming model in the space–time-electricity network. A Lagrangian relaxation-based decomposition scheme is developed to solve this problem. The constraints that couple flow with location variables are dualized to the objective function, resulting in a set of independent routing subproblems and a knapsack subproblem. At each iteration, a primal heuristic utilizes the result of the intermediate knapsack subproblem to generate a feasible solution and Lagrangian multipliers are updated by the subgradient optimization method. The numerical experiments are conducted on three networks, showing that the proposed method achieves good integrality gaps.

Optimal Placement and Sizing of Electric Vehicle Charging Infrastructure in a Grid-Tied DC Microgrid Using Modified TLBO Method

In this work, a DC microgrid consists of a solar photovoltaic, wind power system and fuel cells as sources interlinked with the utility grid. The appropriate sizing and positioning of electric vehicle charging stations (EVCSs) and renewable energy sources (RESs) are concurrently determined to curtail the negative impact of their placement on the distribution network’s operational parameters. The charging station location problem is presented in a multi-objective context comprising voltage stability, reliability, the power loss (VRP) index and cost as objective functions. RES and EVCS location and capacity are chosen as the objective variables. The objective functions are tested on modified IEEE 33 and 123-bus radial distribution systems. The minimum value of cost obtained is USD 2.0250 × 106 for the proposed case. The minimum value of the VRP index is obtained by innovative scheme 6, i.e., 9.6985 and 17.34 on 33-bus and 123-bus test systems, respectively. The EVCSs on medium- and large-scale networks are optimally placed at bus numbers 2, 19, 20; 16, 43, and 107. There is a substantial rise in the voltage profile and a decline in the VRP index with RESs’ optimal placement at bus numbers 2, 18, 30; 60, 72, and 102. The location and size of an EVCS and RESs are optimized by the modified teaching-learning-based optimization (TLBO) technique, and the results show the effectiveness of RESs in reducing the VRP index using the proposed algorithm.

Charging Stations Selection Using a Graph Convolutional Network from Geographic Grid

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.

Optimal location planning of electric bus charging stations with integrated photovoltaic and energy storage system

AbstractThis study presents a novel bus charging station planning problem considering integrated photovoltaic (PV) and energy storage systems (PESS) to smooth the carbon‐neutral transition of transportation. This paper illustrates a two‐stage stochastic programming model capturing the uncertainty of PV power outputs and designs a step‐wise solution approach in which a conventional charging station location problem is solved in the first step and an improved L‐shaped algorithm is developed in the second step to determine charging station locations with PESS. The numerical experiments indicate that the step‐wise solution approach can provide high‐quality solutions within acceptable computational time. A case study is performed using a real‐world transit network in Beijing, China, with 34 bus routes and 15 candidate bus charging stations. Compared with the benchmark model, both recharging cost and carbon emission are reduced considerably. This paper provides novel insights into the development of integrated transportation and renewable energy systems.

Optimal en-route charging station locations for electric vehicles: A new modeling perspective and a comparative evaluation of network-based and metanetwork-based approaches

In many regions across the world, the distribution density of electricity-charging stations is yet sufficient for taming the range anxiety concern of electric vehicle drivers. In such driving circumstances, making detours to find alternative charging opportunities is often an operational remedy to accomplish long-distance trips. To reduce the frequency and extra mileage of detouring, public charging infrastructures should be coordinately sited and constructed in a regional network. With the goal of minimizing the possible detour mileage, this paper describes an optimal charging station location problem for intercity highway networks and develops two approaches for modeling and solving it. Specifically, two mixed linear integer programming models are constructed in different network modeling paradigms: The first one is formed and solved on the basis of the original node-link network topology, with newly introduced integer variables such as path and subpath activation indicators to quantify the utilization status of paths and subpaths, respectively. The classic branch-and-bound algorithm encapsulating a bi-criteria label-correcting algorithm is designed for solving this network-based model. The other one is formulated and solved relying on the station-subpath metanetwork topology, as the result of a two-phase process that decomposes an individual routing and charging decision into two parts. The two phases are conducted on the node-link network and station-subpath metanetwork levels, respectively, where the first phase is done by solving a network-based, distance-constrained minimum-cost path problem, while the second phase collapses to a metanetwork-based, simple minimum-cost path problem. The findings we obtained through conducting this research are twofold: First, analytical and computational studies clearly identify the effectiveness of the two modeling and solution approaches, while the metanetwork-based approach exhibits its appealing computing advantage for solving problems of large size; second, the application of the solution approaches for a real-world network instance reveals how budget limit and distance limit impact the charging station locations, individual routing and charging decisions, and network cost and accessibility levels.

Electric Vehicle Charging Station Location Model considering Charging Choice Behavior and Range Anxiety

Electric vehicles (EVs) have the advantages of low pollution, low energy consumption, and high energy efficiency, so they are highly valued by governments, enterprises, and consumers. However, the promotion and use of electric vehicles is restricted to a certain extent because of their limited range. This paper selects electric vehicle intercity medium- and long-distance travel as the research object, and takes the classical flow-capturing location problem as the theoretical basis for the expressway network or national highway network. This paper also considers the driver’s charging choice behavior and range anxiety, studies the electric vehicle charging station location problem, establishes the charging station location model, and uses the Tabu search algorithm to solve the problem. Finally, the effectiveness of the model and algorithm is verified by empirical analysis. The results show that the charging station location model considering the driver’s charging choice behavior and range anxiety performs better.

A region-based model for optimizing charging station location problem of electric vehicles considering disruption - A case study

To reduce the negative impact of the conventional vehicles, governments and authorities try to provide facilities in order to encourage people to use electric vehicles. For this purpose, determining the location and the number of charging stations is of paramount importance. It becomes more challenging when some charging stations cannot provide service due to the disruption or breakdown. In this paper, a bi-objective mixed-integer linear mathematical model for a charging station location problem is developed and solved by Lagrangian relaxation method. Two different chargers that could be installed in the charging stations and budget constraint is considered in the model. To evaluate the applicability of the proposed model on real-world problems, a case study on Tehran is conducted. Based on computational experiments and numerical results, sensitivity analysis on key parameters of the problem is carried out and some helpful suggestions are presented for decision-makers.

A Fast Charging Station Location Problem: A Two-Phase Approach with Mathematical Program with Equilibrium Constraints Considering Charging Choice Behavior

A Fast Charging Station Location Problem: A Two-Phase Approach with Mathematical Program with Equilibrium Constraints Considering Charging Choice Behavior

A scenario-based stochastic programming approach for the public charging station location problem

This paper presents an integrated framework for the optimal planning of public charging stations for plug-in electric vehicles (PEVs) in urban areas. The framework consists of two main components: (i) an out-of-home charging demand model based on an activity-based travel demand model, and (ii) a public charging station location-allocation model using a scenario-based stochastic programming (SP) approach. In order to capture the dynamic charging behaviour of PEV users, a chi-squared automatic interaction detector (CHAID)-based mixed effects decision tree is induced from multi-day activity diaries. Moreover, because the stochastic error of the micro-simulation approach brings about uncertainty, we adopted a two-stage stochastic mixed-integer programming (TSMIP) model, which measures uncertainty by means of a finite set of scenarios obtained from the derived decision rules underlying PEV charging. The proposed approach is demonstrated for the City of Eindhoven, The Netherlands, and benefits of the stochastic solution are discussed.