Computer-implemented method for determining an installation location for at least one charging column for electric vehicles, method for installing charging columns at at least one installation location, computing device, computer program and electronically readable data medium

Abstract

The invention relates to a computer-implemented method for determining an installation location for at least one charging column for electric vehicles in a covered geographical area (3), in particular an urban area, wherein an optimization problem (16) comprising a cost function to be optimized is formulated and is solved in an optimization process in order to determine the installation location, comprising the following steps: - providing geodetic data (12) that describe the positions of charging columns that have already been installed, the positions of locations of interest, the positions (1, 2, 10a, 10b, 10c) of end-user transformers of a power grid and land use, in particular with regard to the presence of parking areas, in the area (3), - determining candidate positions (6, 7, 9a, 9b, 9c) for the installation location from the geodetic data (12), - in a preparation process, deriving deterministic parameters from the geodetic data (12) that are incorporated into the cost function, alongside at least one unknown parameter not able to be deduced from the geodetic data (12), for the candidate positions (6, 7, 9a, 9b, 9c), and - defining the optimization problem (16) from the deterministic parameters and the at least one unknown parameter, - wherein a stochastic optimization method is applied in order to take the at least one unknown parameter into consideration.

Description

[0001] Description

[0002] Computer-implemented method for determining a location for at least one charging station for electric vehicles, method for setting up charging stations at at least one location, computing device, computer program and electronically readable data carrier

[0003] The invention relates to a computer-implemented method for determining a location for at least one charging station for electric vehicles in a covered spatial area, in particular an urban area, wherein an optimization problem with a cost function to be optimized is formulated and solved in an optimization process for determining the location. In addition, the invention relates to a method for installing charging stations at the at least one location, a computing device, a computer program, and an electronically readable data carrier.

[0004] Purely electric vehicles, such as passenger cars, buses, or vans, are increasingly being used as motor vehicles. These vehicles have a battery that can be charged at appropriate charging facilities. Publicly accessible and usable charging facilities are referred to as charging columns or charging stations. They are set up, for example, in public parking lots, and particularly at or near points of interest (POIs). POIs can include, for example, tourist attractions, restaurants, supermarkets and other shops, parks, and the like.

[0005] As the number of electric vehicles increases, so does the number of charging stations that need to be installed. A sufficient number of charging stations in an area is essential for the ongoing electrification of transport. Charging stations are provided by profit-oriented companies. In order to find suitable locations, it is important not only to estimate expected usage as accurately as possible, but also to assess the connection to the power grid from which the charging stations are fed. The charging stations are usually connected to end-user transformers, which are also known as low-voltage substations or secondary substations. End-user transformers are stations that transform from medium voltage to low voltage for end users.

[0006] For the technical problem described here, which is also known as EVCSAP (electric vehicle charging station allocation planning), approaches are already known in the state of the art to determine and use technically sensible installation locations for charging stations, which also represent a profit for the respective companies. Such known methods can, for example, include optimization processes that seek to maximize the respective monetary profits. For these optimization processes, an optimization problem (also: optimization program or optimization model) is put together which includes a cost function and boundary conditions and can, for example, be passed on to a solution algorithm (solver).

[0007] EP 4 184 421 A1 discloses a method for determining installation locations for charging stations for electric vehicles. Potential installation locations are first provided, after which the area in which the installation locations are to be determined is divided into several grid elements. On the basis of potential values ​​of the grid elements, which indicate how advantageous it is to place charging stations in the respective grid element, suitable grid elements are selected in a first selection step, and then the potential installation locations are weighted using a weighting for the grid elements. Installation locations selected in a second selection step can be used as a starting solution for subsequent mathematical optimization. A problem when selecting installation locations for charging stations is often knowledge of the possible connection to the power grid.For example, information regarding the use and connection of end-user transformers, as well as capacities at potential installation sites, especially information on how many charging stations can be connected, is useful. However, this information is typically only available to the electricity grid operator.

[0008] Uncertainty regarding the connection to the power grid can be a hurdle for the rapid additional distribution of charging stations in areas, especially urban areas. Transaction costs are also increased because the power grid operator must be involved at an early planning stage. These additional costs and effort lead to a reduction in the number of installation locations that are actually evaluated, which in turn can lead to suboptimal allocations due to limited solution space. Although optimization methods have already been proposed in the state of the art that do not take the connection to the power grid into account at all, these approaches also produce suboptimal allocations.

[0009] The invention is therefore based on the object of providing an improved possibility for finding suitable installation locations for charging stations in a spatial area, in particular one which reduces the effort and the necessary database.

[0010] This object is achieved according to the invention by a computer-implemented detection method, a positioning method, a computing device, a computer program, and an electronically readable data carrier according to the independent patent claims. Advantageous embodiments emerge from the subclaims.

[0011] A computer-implemented method according to the invention for determining a location for at least one charging station for electric vehicles in a covered spatial area, in particular an urban area, wherein an optimization problem with a cost function to be optimized is formulated and solved in an optimization process for determining the location, comprises the following steps:

[0012] - Providing geodetic data describing the positions of charging stations already installed, the positions of points of interest, the positions of end-user transformers of a power grid and the land use, in particular with regard to the presence of parking areas, in the area,

[0013] - Determination of candidate positions for the installation site from the geodetic data,

[0014] - in a preparatory process, deriving deterministic parameters from the geodetic data, which are included in the cost function in addition to at least one unknown parameter that cannot be derived from the geodetic data, for the candidate positions,

[0015] - Defining the optimization problem from the deterministic parameters and at least one unknown parameter,

[0016] - wherein a stochastic optimization method is applied to take into account the at least one unknown parameter.

[0017] A data-driven determination method for the installation locations of charging stations (determination method) is therefore proposed, which is based on readily available geodetic data. The geodetic data describe the locations of all objects relevant for the selection or the land use in the covered spatial area, which is preferably an urban area. These relevant locations include, in particular, parking areas, i.e., parking spaces that are primarily considered as locations for charging stations. In addition, the geodetic data describe existing charging stations and places of interest.

[0018] (POIs) that attract people, and thus electric vehicles, to reach these points of interest, thus particularly influencing localized demand. Also relevant to the fundamental physical and technical conditions on whose analysis the inventive approach is based are the end-user transformers, which serve as a connection point for charging stations to the power grid. The geodetic data can, for example, be retrieved from a geoinformation system and / or include official data, particularly with regard to existing charging stations.

[0019] The geodetic data (and, if applicable, at least one piece of background information) are now evaluated in further steps of the inventive determination method, initially to determine possible candidate positions for installation sites, thus defining at least part of the solution space. Parking areas are advantageously used as candidate positions, which will be discussed in more detail below.

[0020] Secondly, the geodetic data (and, if applicable, at least one piece of background information) are evaluated in order to define the optimization problem, in particular as an optimization model, in such a way that it represents the spatial area in a physically and technically reasonable way and thus forms a basis for being solved by a solution algorithm (solver) that outputs at least one optimal installation location as a result, thus ultimately determining the installation location (as the optimal solution). In this case, it is proposed to resolve at least some of the uncertainties, i.e. unknown information, using stochastic optimization, in particular within the framework of the definition of the optimization problem.

[0021] Therefore, deterministic parameters for the optimization problem, assumed to be known or determinable, are initially determined from the geodetic data. Pre-calculations can of course also be carried out for the other unknown parameters, assumed to be unknown and therefore considered stochastic, as will be discussed in more detail below. Both the deterministic and the unknown parameters define the optimization problem and are therefore included at least in the cost function. Since in most cases at least one boundary condition forms part of the optimization problem, the deterministic and / or the unknown parameters can of course also be included in the boundary conditions and define them.After defining (formulating) the optimization problem, it is then solved, in particular using a solution algorithm (solver) to determine the installation location as the candidate position for the optimal solution. In addition to the installation location, other variables can also be determined, such as the number of charging stations to be installed at the location, which the optimal solution then contains. The optimal solution, including the installation location, can be output.

[0022] In other words, at least one uncertainty in the technical representation of the situation to be assessed in the covered spatial area is addressed through stochastic optimization. This allows for an improved decision regarding installation locations in a spatial area without complete knowledge of the physical and technical conditions, particularly with regard to the connection to the power grid. This simplifies and improves the selection process and reduces effort and costs, particularly with regard to information gathering.

[0023] In an expedient, preferred embodiment of the present invention, a two-stage stochastic optimization is used. Specifically, it can be provided that a two-stage stochastic optimization method is used in which at least one candidate position is selected in the first stage and, in the second stage, if requirements by the power grid and / or requirements regarding vehicles to be charged cannot be met, a penalty term based in particular on the use of a backstop technology is used in the cost function. With regard to the first stage, it is expediently provided that, in addition to the candidate position, at least one further variable which describes the charging power that can be provided by the at least one charging station is selected in the first stage, wherein the further variable relates in particular to a number of charging stations.In particular, the first stage can involve the selection of a candidate location and the number of charging stations to be installed at that location as a potential solution. If it is then determined that the power grid cannot meet the requirement there, the second decision in the second stage preferentially concerns the use of a backstop technology, such as a diesel generator and / or a battery, to still meet the requirement. This can be taken into account by an appropriate penalty term in the cost function, as is generally known.

[0024] In this context, it can be particularly advantageous that, as part of the determination of the candidate positions and / or the preparation process, at least one restriction for at least one of the at least one further variable is determined and taken into account when defining the solution space and / or the optimization problem. For example, based on the size of a parking area, e.g., the number of available parking spaces (vehicle parking spaces), a restriction can be determined regarding the number of charging stations that can be placed there. This can also be taken into account as part of location-specific boundary conditions when selecting potential solutions.

[0025] As already mentioned, parking areas of a predetermined minimum size and / or those that meet another predetermined condition, in particular are assigned to locations of interest and / or have fewer than a predetermined number of, or no, charging stations already installed, are preferably selected as candidate positions. A predetermined minimum size can be present if the parking area comprises several parking spaces (i.e., parking spaces), in particular if a threshold for the number of parking spaces is exceeded.Within the scope of the invention it can be provided that at least one piece of background information, in particular relating to the use of electric motor vehicles or the use of the power grid, is used to determine the candidate positions and / or the deterministic parameters and / or that at least one simulation based on the geodetic data is carried out to determine at least some of the deterministic parameters. While it is fundamentally conceivable that, for example, with regard to visits to places of interest (POIs), actual statistics are available, for example from large providers operating several services, from which deterministic parameters, in particular relating to the need for charging power orcharging energy, it can also be useful in many cases to determine these deterministic parameters using a simulation that simulates the physical and technical conditions.

[0026] In particular, it can be provided that at least one simulation is selected from the group comprising

[0027] - a simulation of the traffic concerning electric vehicles and / or their charging states and / or stop times, in particular with regard to the places of interest, and

[0028] - a simulation of the utilisation of the electricity grid is carried out, in particular with regard to the time-dependent power available for charging electric vehicles.

[0029] Such simulations or simulation approaches are basically already known and are feasible ways of defining the optimization problem, particularly with regard to the demand and the available power for charging processes (available charging power), which ways can at least partially also be used within the scope of the present invention. For example, a simulation can relate to the determination of statistics on the locations of interest (POI statistics), for example to determine a number of arriving electric vehicles, their charge level on arrival and / or the length of stay. In other words, in this way the charging demand is linked to locations of interest, such as supermarkets, shops and / or restaurants. In concrete terms, an abstract simulation can be carried out, in particular without a traffic route network.Furthermore, it is conceivable to determine the available charging power, i.e., the load, of end-user transformers through simulation. Background information regarding other consumers, particularly in connection with land use based on geodetic data, can also be used.

[0030] As for other deterministic parameters, especially those that can be determined without simulations and / or background information, these can include, for example, walking distances and / or walking times from candidate positions to locations of interest. These ultimately describe how far charging customers, i.e., users of electric vehicles, would have to walk from the candidate position to the locations of interest they want to visit, and thus the attractiveness of the candidate position.

[0031] In exemplary embodiments, it is also conceivable, particularly based on the results of at least one of the simulations and the geodetic data, to determine load centers that can, for example, group together spatially adjacent POIs. A load column installed at a candidate position can supply at least one load center in whole or in part. Depending on the distance, a candidate position can also serve multiple load centers. In this way, modeling can be simplified and the effort required to solve the optimization problem reduced.

[0032] With regard to stochastic optimization, applicability to a large number of unknown parameters is conceivable. Specifically, for example, it can be provided that the at least one unknown parameter is selected from the group comprising

[0033] - vehicle parameters related to the electric vehicles, in particular the charging requirements, in particular the number of electric vehicles and / or the charge state of an energy storage device to be charged by means of the at least one charging station and / or the consumption of the electric vehicles and / or the equipment of the electric vehicles, in particular with regard to the energy storage device; and

[0034] - parameters related to the power supply of the at least one charging station from the power grid, in particular an end-user transformer to which the candidate position is connected, and / or a variable describing the load on the end-user transformers, in particular its temporal progression, and / or a power provided to the end-user transformers, are selected.

[0035] While it is fundamentally conceivable to address uncertainties regarding charging requirements through stochastic optimization, particularly preferred embodiments of the present invention provide that the at least one unknown parameter is a parameter related to the power supply from the power grid, in particular a parameter that describes an end-user transformer to which the candidate position is connected. This makes it possible to make a well-founded decision regarding optimal installation locations for charging stations without full knowledge of the power grid and its capacity at each location, as well as the connections to the power grid. In the case of unknown parameters that describe end-user transformers to which candidate positions are connected, the available energy capacity at possible future charging stations is particularly advantageously also described.In other words, in a particularly advantageous embodiment of the present invention, the connection to the power grid and consequently the available charging energy at candidate locations are used as the uncertain element. In this way, the additional information from the power grid operator discussed at the beginning is no longer required, thus saving effort, transaction costs, and, in particular, time. This also enables faster expansion of the charging infrastructure in the spatial area and thus creates a competitive advantage. Despite technical uncertainties, a robust, implementable, and, in particular, financially profitable solution is found.

[0036] As already mentioned, particularly advantageous embodiments provide that the optimization problem is defined on the basis of an optimization model which comprises a non-stochastic model component which can be determined directly from the deterministic parameters and a stochastic model component which is determined in a modeling process.In such an approach, a non-stochastic (deterministic) component is therefore directly defined by the deterministic parameters, while a stochastic component is determined in a modeling process in which, in particular, possible scenarios with regard to the at least one unknown parameter, for example connection scenarios in the case of unknown connections from candidate positions to end-user transformers, can be generated and can form a corresponding basis, in particular together with at least some of the deterministic parameters, for the stochastic component. In the modeling process, at least the geodetic data are evaluated, and in particular also background information and / or at least one deterministic parameter. In other words, generally speaking, a scenario generator can be used in the modeling process.If the generated scenarios are combined, the corresponding stochastic model component results. In this context, it can be particularly expedient to determine the scenarios in such a way that they are ultimately at least essentially similarly likely, in particular technically plausible, so that the same weighting can be assumed for each of the scenarios. In concrete terms, it can be provided that in the modeling process, in particular based on a multinomial distribution, sub-model scenarios (sub-model samples) are generated for different values ​​of the at least one unknown parameter, all candidate positions and the entire spatial area and are combined in a weighted manner to form the stochastic component.This can be achieved, as already indicated, by appropriately designing a scenario generator in such a way that a certain technical meaningfulness is given in each case and an equal weighting (average sample weighting) can be carried out.

[0037] When using connection parameters that describe an end-user transformer to which a respective candidate position is connected, as unknown parameters, a particularly preferred, concrete embodiment can provide that for generating the submodel scenarios, in particular as distribution parameters of the multinomial distribution,

[0038] - Distances from candidate positions to end-user transformers, and

[0039] - Connection information regarding the end-user transformations for other, neighboring candidate positions can be used. Such a scenario generator can, particularly when using the two distribution parameters mentioned, be described as a distance-related, two-dimensional charging station-with-end-user-transformer connection scenario generation with a neighborhood effect. In particular, the connection information can relate to the fact that neighboring candidate positions, especially parking areas, are highly likely to be connected to the same end-user transformer (neighborhood relationship). This is especially true if they are close enough to one another. Ultimately, assumptions are coordinated with one another, thus generating internally consistent sub-model scenarios.In a concrete implementation, for example, distance limits for connections to end-user transformers and / or for candidate positions to be connected to the same end-user transformer, and / or decay functions that describe nonlinearly decreasing probabilities with increasing distance, and the like, can be used. On such a basis, generally speaking, it is possible to generate technically reasonable sub-model scenarios, which can all be equally weighted, particularly for forming the stochastic portion of the optimization model, in particular with a weight of one divided by the number of generated sub-model scenarios. In other words, connection scenarios to the power grid that take uncertainty into account can be generated and used for the candidate positions and the spatial area.

[0040] The combination of the parts to the optimization problem can, for example, include adding deterministic terms of the cost function derived from the deterministic part and stochastic terms of the cost function derived from the stochastic part to form the latter.

[0041] With regard to the cost function, it can be provided that the cost function is formulated to maximize monetary return and / or to minimize monetary costs. Of course, other terms in the cost function are also possible, for example, with regard to maximizing available charging power and the like.

[0042] To solve the optimization problem, a sample average approximation method can preferably be used. This is a well-known, efficient solution algorithm (solver) for corresponding, particularly stochastic, optimization problems. For example, such a method is used by a commercial solver called CPLEX.

[0043] As is generally known and already mentioned, the optimization problem can also be formulated or defined here comprising at least one boundary condition, in particular one that is at least partially defined by deterministic and / or unknown parameters and / or determined as part of the model component. Boundary conditions can, for example, include restrictions on the initial investment for new charging stations, restrictions on the number of charging stations, minimum distances to existing charging stations, restrictions with regard to electric vehicles and their behavior, and the like. In particular, a first group of boundary conditions can restrict and / or regulate the allocation of charging stations to candidate positions and / or a second group of boundary conditions can describe the requirements as to how the optimization model should use backstop technologies to mitigate grid congestion.

[0044] In a concrete, summarizing example, two-stage stochastic mixed-integer programming can be used for the allocation problem within the scope of the invention, whereby the problem of uncertain, and therefore unknown, power grid information, in particular connection information, is solved by "average sample approximation" (of submodel scenarios).

[0045] In addition to the determination method, the invention also relates to a setup method, i.e. a method for setting up charging stations at at least one location within a spatial area, in particular an urban area, which is characterized in that the at least one location is determined by a determination method according to the invention. All statements regarding the determination method according to the invention can be transferred to the setup method according to the invention. As a result, the charging stations are installed at the determined locations. This results in the advantages already mentioned.

[0046] The invention also relates to a computing device having at least one processor and at least one storage means and configured to carry out the inventive determination method, i.e., the computer-implemented method for determining at least one installation location. The aforementioned explanations and advantages of the determination method also continue to apply to the computing device. In particular, the computing device can be a planning device for planning installation locations for charging stations.

[0047] The steps of the determination method according to the invention can be carried out by functional units of the computing device, which can be formed by hardware and / or software. Thus, the computing device can in particular comprise an interface for receiving geodetic data describing the positions of already installed charging stations, the positions of places of interest, the positions of end-user transformers of a power grid and the land use, in particular with regard to the presence of parking areas, in the area, a determination unit for determining candidate positions for the installation site from the geodetic data, a preparation unit for deriving deterministic parameters for the candidate positions from the geodetic data in a preparation process, wherein the deterministic parameters, in addition to at least one unknown parameter that cannot be derived from the geodetic data,into a cost function of an optimization problem, a definition unit for compiling the optimization problem with the cost function to be optimized (and in particular at least one boundary condition) from the deterministic parameters and the at least one unknown parameter, and an optimization unit for solving the optimization problem in an optimization process in order to determine the at least one installation location from the optimal solution, wherein the computing device is further designed to apply a stochastic optimization method to take the at least one unknown parameter into account. Further functional units can be provided for further conceivable steps, in particular the concrete implementation of the stochastic optimization. For example, the computing device can further comprise a modeling unit for determining the stochastic and deterministic parts of the optimization model,which may include a scenario generator as a subunit. In this case, the definition unit combines the stochastic and deterministic parts of the optimization model into the optimization model. It should be noted at this point that boundary conditions can, of course, also be defined in the corresponding parts.

[0048] A computer program according to the invention can be loaded directly into a storage means of a computing device and has program means which, when the computer program is executed, cause the computing device to carry out the steps of an inventive detection method. The computer program can be stored on an electronically readable data carrier according to the present invention, which thus comprises control information stored thereon which comprises at least one computer program according to the invention and, when used in a computing device, configures it to carry out an inventive detection method.

[0049] Further advantages and details of the present invention will become apparent from the following exemplary embodiments and from the drawings, which show:

[0050] Fig . 1 is a sketch illustrating uncertainty in connecting candidate positions to a power grid ,

[0051] Fig. 2 is a flow chart of an embodiment of the inventive investigation method,

[0052] Fig. 3 shows a possible, simplified submodel scenario, Fig. 4 shows a sketch to explain the data processing in the method according to the invention, and

[0053] Fig. 5 is a functional diagram of a computing device according to the invention.

[0054] The following explains an exemplary embodiment of the determination method according to the invention for determining optimal installation locations for charging stations in a covered spatial area, in this case an urban area, which uses stochastic optimization with regard to unknown parameters that describe the connection of candidate positions, in this case parking areas with a minimum number of parking spaces, to the power grid. The uncertainty specifically taken into account relates to the fact that it is not known to which end-user transformer, i.e. which secondary substation, a candidate position is connected. In other examples, for example, the load already present on the power grid or the like can be considered additionally or alternatively.

[0055] This is explained in more detail in Fig. 1. This shows schematically the positions 1, 2 of end-user transformers in a spatial area 3 as well as the assumed coverage areas 4, 5. For a first candidate position 6, which is quite close to position 2 and only in the coverage area 5, it is highly likely that this is connected to the end-user transformer at position 2. However, for candidate position 7, which is further away from both positions 1, 2 and lies in the intersection area of ​​the coverage areas 4, 5, there is an uncertainty. It is not known, and cannot be reliably deduced from the geodetic data, to which end-user transformer it is connected. In the determination method now described, this uncertainty is addressed by stochastic optimization.

[0056] Fig. 2 shows a flowchart of the exemplary embodiment. In a step S1, geodetic information is provided, for example, retrieved from a geoinformation system and / or a government agency database. Concrete conceivable sources include the OpenStreetMap database and comparable databases. The geodetic data describe the positions of already installed charging stations, the positions of points of interest, the positions 1, 2 of end-user transformers of a power grid, and the land use, particularly with regard to the presence of parking areas, in the covered spatial area 3. If available, additional useful background information can optionally be provided.

[0057] In a step S2, candidate positions 6, 7 are determined from the geodetic data. In this case, candidate positions 6, 7 are parking areas that exceed a certain size due to their land use. Other requirements can also be placed on parking areas that form candidate positions 6, 7, for example belonging to a location of interest. For candidate positions 6, 7, restrictions on the number of charging stations that can be installed are already determined at this point due to their size; these restrictions can be included as boundary conditions in the optimization problem or can restrict the solution space. It should be noted at this point that candidate solutions in this case concern not only the selection of a candidate position 6, 7, but also the selection of a number of charging stations to be installed.

[0058] It should be noted purely as a precaution that in typical applications, spatial areas 3 are considered which include a significantly larger number of end-user transformers and candidate positions 6 , 7 .

[0059] In a step S3, deterministic parameters of the spatial area 3, which are to be included in the formulation of the optimization problem, are determined in a preparatory process by evaluating the geodetic data (and, if available, the at least one piece of background information). In this case, both deterministic parameters that result directly from the geodetic data, for example, travel paths, in particular travel times, from the candidate positions 6, 7 to locations of interest and other expressions that do not involve variables, as well as deterministic parameters that require assumptions or more complex derivations, are determined.

[0060] In particular, two simulations are being conducted here. The first simulation concerns the current charging demand, i.e., the electric vehicles that need to be charged. In this case, statistics are calculated in an abstract manner, i.e., without a concrete traffic network, for the locations of interest. These statistics describe the number of arriving electric vehicles, the charging status upon arrival, and the length of stay.

[0061] The second simulation concerns the utilization of the power grid. Here, the amount of charging power and charging energy available at the various end-user transformers is determined, based on land use.

[0062] In particular, based on the results of at least the first simulation and the geodetic data, load centers can optionally also be determined within step S3. A load column installed at a candidate position can supply at least one load center in whole or in part. Depending on the distance, a candidate position can also serve several load centers. In this way, modeling can be simplified and the effort required to solve the optimization problem reduced.

[0063] Subsequently, in steps S4 and S5, components of an optimization model are determined to define the optimization problem. In step S4, a non-stochastic component of the optimization model is determined directly from the deterministic parameters, while in step S5, a stochastic component is determined using a scenario generator. In this case, submodel scenarios are created based on a multinomial distribution. These scenarios describe various connection possibilities of candidate positions 6, 7 with end-user transformers, which correspond to different values ​​for the unknown parameters.The distribution parameters used here are the distances between the end-user transformers and the candidate positions 6, 7, as well as connection information, according to which neighboring candidate positions 6, 7 are connected to the same end-user transformer with a high probability, in particular at least when a distance limit between them is undershot and / or according to a probability that decreases non-linearly according to a decay function. This results in internally consistent sub-model scenarios. Ultimately, a scenario is generated for connections between candidate positions 6, 7 and end-user transformers using the distance, for example taking into account the coverage areas 4, 5, and taking into account a neighborhood effect.

[0064] Fig. 3 shows, by way of example and in a simplified manner, such a submodel scenario 8 in the covered spatial area 3, thus ultimately a connection scenario. Shown are several candidate positions 9a, 9b and 9c, as well as positions 10a, 10b and 10c of end-user transformers. Connections are represented by double arrows 11. Due to the proximity effect, in this case the candidate positions 9a, 9b are both connected to the end-user transformer at position 10a. The candidate position 9c is connected to the end-user transformer at position 10b, as this is quite close. In other conceivable submodel scenarios that could be generated by the scenario generator, it would also be possible, for example, for the candidate positions 9a, 9b to be connected to the end-user transformer at position 10b and / or the candidate position 9c to be connected to the end-user transformer at position 10c.After the submodel scenarios 8 are all generated by the S scenario generator with at least essentially equal plausibility, they are all weighted equally for the stochastic part (average sample weighting).

[0065] It should be noted that in step S5, in addition to the geodetic data, deterministic parameters and / or background information can also be included in the generation of the submodel scenarios 8 or the determination of the stochastic component in other embodiments.

[0066] In both steps S4 and S5, components of the cost function and boundary conditions can be defined as examples. In step S6 (see Fig. 2), the two components from steps S4 and S5 are then combined to define the optimization problem. The cost function can be formulated by combining the cost functions of the components; the boundary conditions are used cumulatively. It should be noted at this point that the cost function relates to maximizing the monetary profit of the installing contractor.

[0067] In a step S7, the optimization problem is solved using a solution algorithm, here an example of a Sample Average Approximation algorithm. This means that the solution, comprising a candidate position 6, 7, 9a, 9b, 9c and a number of charging stations to be installed, is found that maximizes the cost function, i.e. the expected profit. The corresponding candidate position 6, 7, 9a, 9b, 9c of the optimal solution is then the determined installation location. The optimal solution can be output in a step S8. In this case, the entire determination process is computer-implemented.

[0068] In a method according to the invention for setting up charging stations, the number of charging stations is then installed at the determined installation location according to the optimal solution. Fig. 4 once again illustrates the sequence of the determination method. First, the geodetic data 12 are provided according to step S1. The arrow 13 illustrates the determination of the candidate positions 6, 7, 9a, 9b, 9c as well as the preparation process, steps S2 and S3. The determined deterministic parameters are now used to parameterize the non-stochastic part 14 (step S4). At least the geodetic data 12 are used to generate the stochastic part 15 by generating the submodel scenarios 8, which are entered accordingly, step S5.The components 14, 15 are then combined as an optimization model to form the optimization problem 16 (step S6), which is solved by the solution algorithm 17 (step S7), so that the optimal solution 18 with the installation location and the number of charging stations to be installed is obtained.

[0069] Finally, Fig. 5 shows the functional structure of a computing device 19 according to the invention, which is designed to carry out the determination method of Fig. 2. The computing device 19 has a storage means 20 and a processor (not shown in detail here), which defines various functional units for carrying out the method.

[0070] The geodetic data 12 can be obtained via an interface 21 according to step S 1 . In a determination unit

[0071] 22, the candidate positions 6, 7, 9a, 9b, 9c are determined according to step S2, while in a preparation unit

[0072] 23 the derivation of the deterministic parameters takes place according to step S3. In a modeling unit 24 the determination of the proportions 14 and 15 takes place according to steps S4 and S5, wherein the modeling unit 24 also comprises an S scenario generator 25 for generating the submodel scenarios 8. The computing device 19 further comprises a definition unit 26 for formulating the optimization problem 16 according to step S6 and an optimization unit 27 for carrying out the optimization process and thus solving the optimization problem 16 according to step S7. The optimization result, i.e. the optimal solution 18, comprising the installation location, can be output via a further interface 28.

[0073] Although the invention has been illustrated and described in detail by the preferred embodiment, the invention is not limited by the disclosed examples and other variations can be derived therefrom by those skilled in the art without departing from the scope of the invention.

[0074] Regardless of the grammatical gender of a particular term, persons with male, female or other gender identity are included.

Claims

Patent claims 1. A computer-implemented method for determining a location for at least one charging station for electric vehicles in a covered spatial area (3), in particular an urban area, wherein an optimization problem (16) is formulated with a cost function to be optimized and is solved in an optimization process for determining the location, comprising the following steps: - providing geodetic data (12) describing the positions of charging stations already installed, the positions of points of interest, the positions (1, 2, 10a, 10b, 10c) of end-user transformers of a power grid and the land use, in particular with regard to the presence of parking areas, in the area (3), - Determination of candidate positions (6, 7, 9a, 9b, 9c) for the installation site from the geodetic data (12), - in a preparatory process, deriving deterministic parameters from the geodetic data (12) which, in addition to at least one unknown parameter which cannot be derived from the geodetic data (12), are included in the cost function for the candidate positions (6, 7, 9a, 9b, 9c), and - defining the optimization problem (16) from the deterministic parameters and the at least one unknown parameter, - wherein a stochastic optimization method is applied to take into account the at least one unknown parameter.

2. Method according to claim 1, characterized in that a two-stage stochastic optimization method is used, in which in the first stage at least one candidate position (6, 7, 9a, 9b, 9c) is selected and in the second stage, in the event of non-fulfillment of requirements by the power grid and / or requirements with regard to vehicles to be charged, a Backstop technology based penalty term is used in the cost function.

3. Method according to claim 2, characterized in that in addition to the candidate position (6, 7, 9a, 9b, 9c) at least one further variable which describes the charging power that can be provided by the at least one charging station is selected in the first stage, wherein the further variable relates in particular to a number of charging stations.

4. Method according to claim 3, characterized in that in the context of the determination of the candidate positions (6, 7, 9a, 9b, 9c) and / or the preparation process, at least one restriction for at least one of the at least one further variable is determined and taken into account in the definition of the solution space and / or the optimization problem (16).

5. Method according to one of the preceding claims, characterized in that at least one piece of background information, in particular relating to the use of electric motor vehicles or relating to the use of the power grid, is used to determine the candidate positions (6, 7, 9a, 9b, 9c) and / or the deterministic parameters, and / or that at least one simulation based on the geodetic data (12) is carried out to determine at least some of the deterministic parameters.

6. The method according to claim 5, characterized in that at least one simulation is selected from the group comprising - a simulation of the traffic concerning electric vehicles and / or their charging states and / or residence times, in particular with regard to the places of interest, and - a simulation of the utilisation of the electricity grid is carried out, in particular with regard to the time-dependent power available for charging electric vehicles.

7. Method according to one of the preceding claims, characterized in that the at least one unknown parameter is a parameter related to the power supply from the power grid, in particular a parameter that describes an end-user transformer to which the candidate position (6, 7, 9a, 9b, 9c) is connected.

8. Method according to one of the preceding claims, characterized in that the optimization problem (16) is defined on the basis of an optimization model which comprises a non-stochastic model component (14) which can be determined directly from the deterministic parameters and a stochastic model component (15) which is determined in a modeling process.

9. The method according to claim 8, characterized in that in the modeling process, in particular based on a multinomial distribution, submodel scenarios (8) for different values of the at least one unknown parameter, all candidate positions (6, 7, 9a, 9b, 9c) and the entire spatial area (3) are generated and combined in a weighted manner to form the stochastic component (15).

10. The method according to claim 9, characterized in that when using parameters which define an end-user transformer to which a respective candidate position (6, 7, 9a, 9b, 9c) is connected, describe, as unknown parameters, for generating the submodel scenarios (8) , in particular as distribution parameters of the multinomial distribution, - Distances from candidate positions (6, 7, 9a, 9b, 9c) to end-user transformers, and - connection information regarding the end-user transformations for further, neighboring candidate positions (6, 7, 9a, 9b, 9c) are used.

11. Method according to one of the preceding claims, characterized in that the cost function is formulated to maximize a monetary return and / or to minimize the monetary costs and / or a sample average approximation method is used to solve the optimization problem (16) and / or the optimization problem (16) is formulated or defined comprising at least one boundary condition, in particular at least partially defined by deterministic and / or unknown parameters and / or determined as a component of the model components (14, 15).

12. Method for setting up charging stations at at least one location within a spatial area (3), in particular an urban area, characterized in that the at least one location is determined by a method according to one of the preceding claims.

13. Computing device (19) comprising at least one processor and at least one memory means (20) and designed to carry out a method according to one of claims 1 to 11.

14. A computer program which, when executed on a computing device (19), causes the device (19) to carry out the steps of a method according to one of claims 1 to 11.

15. An electronically readable data carrier on which a computer program according to claim 14 is stored.

Images