Charging pile layout method, device, equipment, medium and product
Optimizing the layout of electric vehicle charging piles through multiple cluster hybrid cross-particle swarm algorithms, solving the problems of low efficiency and high cost of charging pile layout in the existing technology, achieving more efficient charging pile layout and lower construction costs, and avoiding particles The group algorithm falls into the local optimal risk.
Patent Information
- Application Number
- CN202411048828.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-01
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-08-01
AI Technical Summary
In the construction of electric vehicle charging infrastructure, the layout efficiency of charging piles is low and costly, making it difficult to achieve a reasonable layout, resulting in low charging efficiency. The existing particle swarm optimization algorithm is easy to fall into local optimization and is difficult to explore. Keep a balance between utilization.
Using a variety of cluster hybrid cross particle swarm algorithm, the optimal charging pile layout scheme is determined through multiple iterations by obtaining charging pile data in the target area, including geographical location and distribution of electric vehicles. , use multiple groups and update strategies to prevent falling into local optimality, and improve search speed and efficiency.
The more reasonable layout of charging piles is achieved, the charging efficiency is improved, and the particle swarm algorithm is avoided from falling into local optimality in complex problems, which significantly improves the accuracy and efficiency of charging pile layout.
Smart Images

Figure CN119026733A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of charging facility construction, and in particular to a charging pile layout method, device, equipment, medium and product. Background Art
[0002] Energy crisis caused by fossil energy shortage and air pollution caused by excessive greenhouse gas emissions are becoming increasingly serious. New energy vehicles, especially electric vehicles, have begun to become the main development direction of the automotive industry. In order to promote the development of the electric vehicle industry, promoting the construction of electric vehicle charging infrastructure has become one of the important links in the system engineering of the electric vehicle industry.
[0003] At present, the construction of electric vehicle charging infrastructure is still mainly based on market demonstration, which lags far behind the development of electric vehicles. Related theoretical research has not yet received widespread attention from the academic community. How to reasonably layout electric vehicle charging stations so that they are convenient for electric vehicle chargers and save construction costs has become one of the key issues of urban planning departments, transportation departments and power supply companies. Summary of the invention
[0004] The purpose of this application is to provide a charging pile layout method, device, equipment, medium and product, which can accurately and efficiently realize the layout of charging piles, thereby improving charging efficiency.
[0005] To achieve the above objectives, this application provides the following solutions:
[0006] In a first aspect, the present application provides a charging pile layout method, comprising:
[0007] Acquire charging pile data of the target area; the charging pile data includes: the geographical location of the charging pile site and the tram data around the charging pile site; the tram data includes: the number and distribution of electric vehicles;
[0008] According to the charging pile data and objective function of the target area, a multi-swarm mixed cross particle swarm algorithm is used for multiple iterations to determine the optimal charging pile layout plan for the target area; the objective function is constructed based on investment cost, operating cost and maintenance cost; the optimal charging pile layout plan is the layout quantity and location of the charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
[0009] In a second aspect, the present application provides a charging pile layout device, comprising:
[0010] The data acquisition module is used to acquire charging pile data in the target area; the charging pile data includes: the geographical location of the charging pile site and the tram data around the charging pile site; the tram data includes: the number and distribution of electric vehicles.
[0011] The charging pile layout module is used to determine the optimal charging pile layout plan for the target area based on the charging pile data and the objective function of the target area, using a multi-swarm mixed crossover particle swarm algorithm for multiple iterations; the objective function is constructed based on investment cost, operation cost and maintenance cost; the optimal charging pile layout plan is the layout quantity and location of the charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
[0012] In a third aspect, the present application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-mentioned charging pile layout method.
[0013] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which implements the above-mentioned charging pile layout method when executed by a processor.
[0014] In a fifth aspect, the present application provides a computer program product, including a computer program, which implements the above-mentioned charging pile layout method when executed by a processor.
[0015] According to the specific embodiments provided in this application, this application discloses the following technical effects:
[0016] The present application provides a charging pile layout method, device, equipment, medium and product. According to the charging pile data and objective function of the target area, the optimal charging pile layout scheme of the target area is determined by multiple iterations using a multi-swarm hybrid crossover particle swarm algorithm (Multi-swarm Crossoverhybrid Strategy Particle Swarm Optimization, MCSPSO). The multi-swarm hybrid crossover particle swarm algorithm can effectively prevent the particle swarm algorithm from falling into local optimality in complex problems, and can effectively improve the particle swarm search speed, accelerate the finding of the optimal charging pile layout position, and realize a more reasonable layout of the charging piles. Therefore, the present application can accurately and efficiently realize the layout of the charging piles, thereby improving the charging efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0018] Figure 1 A schematic diagram of a flow chart of a charging pile layout method provided in one embodiment of the present application;
[0019] Figure 2 A diagram showing the overall implementation process of a charging pile layout method provided in another embodiment of the present application;
[0020] Figure 3 A schematic diagram of charging pile data provided in an embodiment of the present application;
[0021] Figure 4 A schematic diagram of a specific iterative process provided for an embodiment of the present application;
[0022] Figure 5 A coordinate diagram of an optimized charging pile layout provided in an embodiment of the present application;
[0023] Figure 6 A schematic diagram of functional modules of a charging pile layout device provided in another embodiment of the present application;
[0024] Figure 7 A schematic diagram of the structure of a computer device provided in one embodiment of the present application. DETAILED DESCRIPTION
[0025] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0026] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below with reference to the accompanying drawings and specific implementation methods.
[0027] At present, most of the spatial site selection and planning schemes for charging infrastructure are implemented using traditional particle swarm optimization (PSO) algorithms based on cost, existing power grids, etc. In reality, due to the large amount of data, the traditional particle swarm optimization algorithm is highly complex and difficult to solve the model.
[0028] Specifically, the uniqueness of the particle swarm optimization algorithm is that it retains both the global optimum and the known optimal position information of the particles during the search process. Both play an important role in the convergence speed of the algorithm, helping to avoid being trapped in the local optimum and accelerating the search for the global optimal solution. This feature makes the particle swarm optimization algorithm perform well in dealing with complex problems and become a popular optimization method in academic research and practical applications. However, similar to other metaheuristic algorithms inspired by nature, the particle swarm optimization algorithm has two main limitations: premature convergence and being trapped in the local minimum when solving complex multimodal problems. There are many factors that affect the convergence and performance of the particle swarm algorithm, such as group size, velocity clamping, position clamping, neighborhood topology, synchronous or asynchronous updates, and especially the choice of control parameters. In fact, a major issue in PSO performance control is the exploration / exploitation balance, because excessive exploration wastes computing resources, while excessive exploitation leads to local premature convergence. In practice, there is a trade-off between exploration ability and exploitation ability, and these two abilities should be well balanced to obtain good problem optimization performance. However, in a dynamic environment, it is difficult for the particle swarm algorithm to maintain a balance between exploration (global search) and exploitation (local search).
[0029] How to improve the convergence speed of particle swarm optimization and avoid premature convergence has become the most important research issue in particle swarm optimization. A lot of research has been done on this issue, and many PSO variants have been proposed. These algorithms balance local search capabilities and global search capabilities by adjusting parameters, modifying update rules, and designing new strategies during the evolution process, and have achieved certain improvements in the convergence of solutions. However, with the increasing complexity of optimization problems, current algorithms still cannot guarantee good solution diversity and efficiency in reality.
[0030] The improvement of particle swarm algorithm should be considered from the perspective of how to maintain population diversity while balancing global search ability and local development ability to prevent the particle swarm from falling into local optimum. However, a single improvement strategy cannot effectively deal with optimization problems of different natures. And there are literatures showing that multi-strategy particle swarm algorithm can well balance the exploration and mining capabilities of particles, and can effectively prevent the particle swarm algorithm from falling into local optimum in complex problems, thereby increasing the probability of the algorithm finding the optimal solution, and finally can be applied to specific charging pile models.
[0031] like Figure 1 As shown, this embodiment provides a charging pile layout method, which specifically includes:
[0032] Step 101, acquiring charging pile data of a target area; the charging pile data includes: the geographical location of the charging pile site and the electric vehicle data around the charging pile site; the electric vehicle data includes: the number and distribution of electric vehicles.
[0033] Step 102 , based on the charging pile data and the objective function of the target area, a multi-swarm hybrid crossover particle swarm algorithm is used to perform multiple iterations to determine the optimal charging pile layout plan for the target area.
[0034] Among them, the objective function is constructed based on investment cost, operating cost and maintenance cost; the optimal charging pile layout plan is the layout quantity of charging piles and the layout location of charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
[0035] In another exemplary embodiment of the present application, step 102 specifically includes:
[0036] (1) Randomly initialize a particle population; the particle population includes a plurality of particles; and one particle represents a charging pile layout scheme.
[0037] (2) Calculating the fitness value of each particle in the particle population according to the charging pile data of the target area and the objective function.
[0038] (3) Sort the fitness values of all particles in ascending order to form a fitness value sequence.
[0039] (4) The first m in the fitness value sequence 1 * The group of particles corresponding to N fitness values is the elite group S good , the mth in the fitness value sequence 1 *N fitness values to the mth 2 *The group of particles corresponding to N fitness values is regarded as the normal group S normal , the mth in the fitness value sequence 2 *The group of particles corresponding to N fitness values is the disadvantaged group S weak ; N represents the number of particles in the particle population; m 1 and m 2 are constants, m 1 ∈[0, 1], m 2 ∈[0, 1], m 1 <m 2 For example, N can be 100, m 1 The value can be 0.3, m 2 The value can be 0.7.
[0040] (5) Using different update strategies for the elite group, the ordinary group, and the disadvantaged group, respectively, to perform multiple iterative updates on the particle speed and position to determine the optimal charging pile layout plan for the target area; wherein different speeds and positions correspond to different charging pile layout plans, and the fitness value is calculated once each time the speed and position of the group are updated.
[0041] In another exemplary embodiment of the present application, for the current number of iterations, the elite group is respectively updated with the first update strategy, the second update strategy and the third update strategy to obtain three updated speeds and positions, and the one with the smallest fitness value is used as the updated speed and position of the elite group after the current number of iterations.
[0042] The calculation formula of the first update strategy is:
[0043]
[0044] Among them, X id (iter+1) represents the position of the current particle i in the elite group after the dimension d is updated; X id (iter) represents the position of the current particle i in the elite group before the dimension d is updated; rand represents a random value between [0, 1]; fitness i represents the fitness value of the current particle i in the elite group; Gbest represents the fitness value of the global optimal particle; ε is an infinitely small value to prevent it from being equal to 0. Among them, the first update strategy only updates the position, and the speed remains unchanged. The number of dimensions of the particle is determined according to the objective function.
[0045] The calculation formula of the second update strategy is:
[0046]
[0047] X id (iter+1)=X id (iter)+V id (iter+1);
[0048] Among them, V id (iter+1) represents the speed of the current particle i in the elite group after the update in dimension d; V id (iter) represents the velocity of the current particle i in the elite group before the dimension d is updated; ω, c 1 and c 2 Both represent the acceleration coefficient of the particle; Pbest id Represents the historical optimal coordinates of the current particle i in dimension d.
[0049] The calculation formula of the third update strategy is:
[0050] V id (iter+1)=ω·V id (iter)+ω·0.1·(ub-lb)·(randn(-1,1));
[0051] X id (iter+1)=X id (iter)+V id (iter+1);
[0052] Among them, ub represents the upper boundary of the objective function; lb represents the lower boundary of the objective function; randn(-1,1) represents a random value between [-1,1].
[0053] In another exemplary embodiment of the present application, for the current iteration number, the fourth update strategy is used to update the particle speed and position of the common group to obtain the updated speed and position of the common group for the current iteration number.
[0054] The calculation formula of the fourth update strategy is:
[0055] MBest(iter)=mean{Pbest 1 ,Pbest 2 ,...,Pbest K};
[0056] fit(CPbest(iter))<fit(X k );
[0057]
[0058] Among them, V kd (iter+1) represents the velocity of the current particle k in the general population after the dimension d is updated; V kd (iter) represents the velocity of the current particle k in the general population before the dimension d is updated; ω, c 1 and c 2 Both represent the acceleration coefficient of the particle; rand represents a random value between [0, 1]; Mbest d Represents the geometric center of all particles in the general population; CPbest d Indicates the position of the particle in the general population whose fitness value is better than the current particle k; X kd represents the position of the current particle k in dimension d in the general population; X k (iter+1) represents the position of the current particle k in the general population after all dimensions are updated; X k (iter) represents the position of the current particle k in the general population before all dimensions are updated; V k (iter+1) represents the velocity of the current particle k in the general population after all dimensions are updated; V k (iter) represents the velocity of the current particle k in the general population before all dimensions are updated; p kRepresents an intermediate variable; fitness k represents the fitness value of the current particle k in the common population; K represents the number of particles in the common population.
[0059] In another exemplary embodiment of the present application, for the current number of iterations, the fifth update strategy is used to update the particle speed and position of the disadvantaged group to obtain the updated speed and position of the disadvantaged group for the current number of iterations.
[0060] The calculation formula of the fifth update strategy is:
[0061] RPbest∈S good ;
[0062]
[0063] X nd (iter+1)=X nd (iter)+V nd (iter+1);
[0064] Among them, V nd (iter+1) represents the speed of the current particle n in the disadvantaged group after the dimension d is updated; V nd (iter) represents the speed of the current particle n in the disadvantaged group before the dimension d is updated; ω, c 1 and c 2 Both represent the acceleration coefficient of the particle; r 1 and r 2 Both represent random values between [0, 1]; RPbest d (iter) represents the historical best of random particles with a fitness value better than the current particle n; Gbest d (iter) represents the global optimum of all particles in the disadvantaged group; X nd (iter+1) represents the position of the current particle n in the disadvantaged group after the dimension d is updated; X nd (iter) represents the position of the current particle n in the disadvantaged group before the dimension d is updated; S good Represents an elite group.
[0065] In another exemplary embodiment of the present application, the expression of the objective function is:
[0066]
[0067] Where f represents the value of the objective function; N EVCS represents the total number of charging pile sites; T represents the number of charging piles arranged at the charging pile site; represents the investment cost; represents the operating cost of the ath charging station; represents the maintenance cost of the a-th charging station; t represents the number of the charging station; ε is an infinitely small value to prevent it from being equal to 0.
[0068] See also Figure 2 The overall implementation process of the charging pile layout method of the above embodiment can be described as follows:
[0069] Step 1: Obtain the geographical location of charging pile stations in a certain city area and the surrounding tram data through social surveys. Use these data to construct the final charging pile layout model, that is, the objective function. The specific expression will not be repeated here.
[0070] Step 2: Optimization is achieved based on multi-swarm mixed crossover particle swarm algorithm.
[0071] Sub-step 1: Randomly initialize the population position and speed, and obtain the particle fitness value according to the objective function. The fitness value of each particle corresponds to the cost of a charging pile layout, that is, the value of the objective function.
[0072] Sub-step 2: Sort and classify the particles according to their fitness values in sub-step 1.
[0073] The specific classification and sorting process is: select m between [0, 1] 1 , m 2 As an indicator of population separation, the population is then sorted in ascending order according to the fitness value. 1 *N particles belong to the "elite group" and are divided into elite groups; 1 * N and m 2 *N particles are divided into common groups; the index greater than m 2 *N particles are divided into inferior groups.
[0074] Sub-step 3: Based on the elite group in sub-step 2, the first, second, and third update strategies are used to update the speed and position, thereby updating the value of the objective function and obtaining the first result.
[0075] Based on the greedy strategy, the coordinate with the better final fitness value is selected from the above three update strategies as the position of the particle in the next iteration. By cross-selecting the above strategies, the current state of the elite particles can be better preserved, but there is a probability of jumping out of the local optimum through a certain degree of disturbance.
[0076] Based on the common group in sub-step 2, the fourth updating strategy is adopted to update the speed and position to obtain the second result.
[0077] In order to balance global search and local exploration, an adaptive position update mechanism is used in the second update strategy. The adaptive update strategy is embodied in:
[0078]
[0079] Based on the disadvantaged group in sub-step 2, the fifth updating strategy is adopted to update the speed and position, and the third result is obtained.
[0080] Finally, update the gbest of the particle and continue the above steps until the iteration ends. At this point, the algorithm is completed.
[0081] Step 3: Input the objective function of the charging pile layout model in step 1 into the algorithm system constructed in step 2. Finally, the location of each charging pile layout and the final number of charging pile layouts can be obtained from the optimal value of the objective function of the charging pile model.
[0082] The specific process is:
[0083] Sub-step 1: According to the specific demand coordinates, demand load, cost coefficient, region, and centralized charging station coordinates, the objective function of the charging pile is imported into the multi-population hybrid crossover particle swarm algorithm for continuous iteration.
[0084] Sub-step 2: Finally, when the update result reaches the maximum number of iterations or the iteration reaches the global optimum, the iteration is terminated to obtain the optimal result. When the particle swarm ends the iteration, the reasonable layout of the electric vehicle charging station is achieved.
[0085] The effectiveness of the multi-swarm mixed crossover particle swarm algorithm of this embodiment is verified below.
[0086] The charging pile layout method based on multi-swarm hybrid crossover particle swarm algorithm includes:
[0087] 1. Taking the minimum sum of the total cost (including investment, operation and maintenance costs) and network loss costs of charging stations during the planning period as the goal, the mathematical model for the optimal planning of electric vehicle charging stations was constructed by considering the relevant constraints.
[0088] The reasonable driving range of an electric vehicle is defined as the distance that the electric vehicle can travel when the power battery pack is discharged from the optimal discharge depth to the maximum discharge depth. The reasonable driving range of an electric vehicle under uniform speed is
[0089] Charging station service radius The actual distance D between two adjacent charging stations EVCS Should meet:
[0090]
[0091] According to the actual distance between two adjacent charging stations and the service radius of each charging station, the given preliminary site selection is screened to determine a reasonable charging station site planning scheme. At the same time, according to the Voronoi diagram widely used in geographic information systems, the charging service area of the charging station is divided to guide car owners to choose the appropriate charging station for charging according to the battery status.
[0092] 2. Determine the objective function of the charging station planning model.
[0093] 3. Figure 3 The specific service points of the charging stations are given, and the demand coordinates, demand load, cost coefficient, area and coordinates of the centralized charging stations are determined. The number of sites is determined to be 7, and the specific demand points are 34.
[0094] 4. The traditional particle swarm algorithm is prone to fall into local optimality when dealing with charging pile layout. To address this problem, a multi-swarm mixed crossover particle swarm algorithm is proposed.
[0095] In this specific embodiment, the particle swarm population is set to 20, the number of iterations is set to 500, and c 1 ,c 2 The acceleration coefficient ranges from (0.5, 2.5), and ω is set to 0.5 to 0.2. The specific iteration process is as follows: Figure 4 Finally, the coordinate diagram of the optimized charging pile layout can be obtained, as shown in Figure 5 shown.
[0096] Based on the same inventive concept, the embodiment of the present application also provides a charging pile layout device for implementing the above-mentioned charging pile layout method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above-mentioned method, so the specific limitations in one or more charging pile layout device embodiments provided below can refer to the limitations of the charging pile layout method above, and will not be repeated here.
[0097] In an exemplary embodiment, Figure 6 As shown, a charging pile layout device is provided, including:
[0098] The data acquisition module 601 is used to acquire charging pile data in the target area; the charging pile data includes: the geographical location of the charging pile site and the tram data around the charging pile site; the tram data includes: the number and distribution of electric vehicles.
[0099] The charging pile layout module 602 is used to determine the optimal charging pile layout plan for the target area based on the charging pile data and the objective function of the target area, using a multi-swarm mixed cross particle swarm algorithm for multiple iterations; the objective function is constructed based on investment cost, operating cost and maintenance cost; the optimal charging pile layout plan is the layout quantity and location of the charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
[0100] In an exemplary embodiment, a computer device is provided. The computer device may be a server or a terminal. The internal structure diagram thereof may be as follows: Figure 7 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store charging pile data in the target area. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a charging pile layout method is implemented.
[0101] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0102] In an exemplary embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program.
[0103] In an exemplary embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.
[0104] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.
[0105] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM may be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).
[0106] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, etc., but is not limited thereto.
[0107] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0108] This article uses specific examples to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application. At the same time, for those skilled in the art, according to the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.
Claims
1. A charging pile layout method, characterized in that: The charging pile layout method comprises: Acquire charging pile data of the target area; the charging pile data includes: the geographical location of the charging pile site and the tram data around the charging pile site; the tram data includes: the number and distribution of electric vehicles; According to the charging pile data and objective function of the target area, a multi-swarm mixed cross particle swarm algorithm is used for multiple iterations to determine the optimal charging pile layout plan for the target area; the objective function is constructed based on investment cost, operating cost and maintenance cost; the optimal charging pile layout plan is the layout quantity and location of the charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
2. The charging pile layout method according to claim 1, characterized in that: According to the charging pile data and objective function of the target area, a multi-swarm hybrid crossover particle swarm algorithm is used for multiple iterations to determine the optimal charging pile layout plan for the target area, including: Randomly initialize a particle population; the particle population includes a plurality of particles; one particle represents a charging pile layout scheme; Calculating the fitness value of each particle in the particle population according to the charging pile data of the target area and the objective function; Sort the fitness values of all particles in ascending order to form a fitness value sequence; The group consisting of particles corresponding to the first m1*N fitness values in the fitness value sequence is regarded as the elite group, the group consisting of particles corresponding to the fitness values from the m1*Nth to the m2*Nth fitness values in the fitness value sequence is regarded as the ordinary group, and the group consisting of particles corresponding to the fitness values after the m2*Nth fitness value in the fitness value sequence is regarded as the inferior group; N represents the number of particles in the particle population; m1∈[0,1], m2∈[0,1], m1<m2; Different update strategies are used for the elite group, the ordinary group and the disadvantaged group to perform multiple iterative updates on the particle speed and position to determine the optimal charging pile layout plan for the target area; different speeds and positions correspond to different charging pile layout plans, and the fitness value is calculated once each time the speed and position of the group are updated.
3. The charging pile layout method according to claim 2, characterized in that: For the current number of iterations, the first update strategy, the second update strategy and the third update strategy are respectively used to update the particle speed and position of the elite group, and three updated speeds and positions are obtained, and the one with the smallest fitness value is used as the speed and position of the elite group after the current number of iterations; The calculation formula of the first update strategy is: Among them, X id (iter+1) represents the position of the current particle i in the elite group after the dimension d is updated; X id (iter) represents the position of the current particle i in the elite group before the dimension d is updated; rand represents a random value between [0, 1]; fitness i represents the fitness value of the current particle i in the elite group; Gbest represents the fitness value of the global optimal particle; ε is an infinitely small value; The calculation formula of the second update strategy is: X id (iter+1)=X id (iter)+V id (iter+1); Among them, V id (iter+1) represents the speed of the current particle i in the elite group after the update in dimension d; V id (iter) represents the velocity of the current particle i in the elite group before the dimension d is updated; ω, c1 and c2 all represent the acceleration coefficients of the particle; Pbest id Represents the historical optimal coordinates of the current particle i in dimension d; The calculation formula of the third update strategy is: 5 id (iter+1)=ω·V id (path)+ω·0.1·(ub-lb)·(randn(-1,1)); X id (iter+1)=X id (iter)+V id (iter+1); Among them, ub represents the upper boundary of the objective function; lb represents the lower boundary of the objective function; randn(-1,1) represents a random value between [-1,1].
4. The charging pile layout method according to claim 2, characterized in that: For the current number of iterations, the fourth update strategy is used to update the particle speed and position of the common group to obtain the updated speed and position of the common group for the current number of iterations; The calculation formula of the fourth update strategy is: Among them, V kd (iter+1) represents the velocity of the current particle k in the general population after the dimension d is updated; V kd (iter) represents the velocity of the current particle k in the common population before the dimension d is updated; ω, c1 and c2 all represent the acceleration coefficients of the particle; rand represents a random value between [0, 1]; Mbest d Represents the geometric center of all particles in the general population; CPbest d Indicates the position of the particle in the general population whose fitness value is better than the current particle k; X kd represents the position of the current particle k in dimension d in the general population; X k (iter+1) represents the position of the current particle k in the general population after all dimensions are updated; X k (iter) represents the position of the current particle k in the general population before all dimensions are updated; V k (iter+1) represents the velocity of the current particle k in the general population after all dimensions are updated; V k (iter) represents the velocity of the current particle k in the general population before all dimensions are updated; p k Represents an intermediate variable; fitness k represents the fitness value of the current particle k in the common population; K represents the number of particles in the common population.
5. The charging pile layout method according to claim 2, characterized in that: For the current number of iterations, the fifth updating strategy is used to update the particle speed and position of the disadvantaged group to obtain the updated speed and position of the disadvantaged group after the current number of iterations; The calculation formula of the fifth update strategy is: X nd (iter+1)=X nd (iter)+V nd (iter+1); Among them, V nd (iter+1) represents the speed of the current particle n in the disadvantaged group after the dimension d is updated; V nd (iter) represents the velocity of the current particle n in the disadvantaged group before the dimension d is updated; ω, c1 and c2 represent the acceleration coefficients of the particles; r1 and r2 represent random values between [0, 1]; RPbest d (iter) represents the historical best of random particles with a fitness value better than the current particle n; Gbest d (iter) represents the global optimum of all particles in the disadvantaged group; X nd (iter+1) represents the position of the current particle n in the disadvantaged group after the dimension d is updated; X nd (iter) represents the position of the current particle n in the disadvantaged group before the dimension d is updated.
6. The charging pile layout method according to claim 1, characterized in that: The expression of the objective function is: Where f represents the value of the objective function; N EVCS represents the total number of charging pile sites; T represents the number of charging piles arranged at the charging pile site; represents the investment cost; represents the operating cost of the ath charging station; represents the maintenance cost of the ath charging pile station; t represents the number of the charging pile; ε is an infinitely small value.
7. A charging pile layout device, characterized in that: The charging pile layout device comprises: A data acquisition module is used to acquire charging pile data in a target area; the charging pile data includes: the geographical location of the charging pile site and the electric vehicle data around the charging pile site; the electric vehicle data includes: the number and distribution of electric vehicles; The charging pile layout module is used to determine the optimal charging pile layout plan for the target area based on the charging pile data and the objective function of the target area, using a multi-swarm mixed crossover particle swarm algorithm for multiple iterations; the objective function is constructed based on investment cost, operation cost and maintenance cost; the optimal charging pile layout plan is the layout quantity and location of the charging piles when the set standard is met; the set standard is the minimum fitness value calculated according to the objective function or the maximum number of iterations.
8. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the charging pile layout method according to any one of claims 1 to 6.
9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the charging pile layout method described in any one of claims 1 to 6 is implemented.
10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the charging pile layout method described in any one of claims 1 to 6 is implemented.
Citation Information
Patent Citations
Improved particle swarm algorithm for cogeneration economic emission scheduling
CN115630746A
Electric vehicle charging station double-view site selection method based on multi-target particle swarm optimization
CN115689237A
Electric vehicle charging pile planning method and system according to charging requirements
CN117077985A
Automobile charging station site selection method based on improved particle swarm optimization and related device
CN117495443A
Charging pile site selection method and system
CN117557069A
