CN112036654B - Photovoltaic power station and electric vehicle charging network planning method based on co-evolution - Google Patents
Photovoltaic power station and electric vehicle charging network planning method based on co-evolution Download PDFInfo
- Publication number
- CN112036654B CN112036654B CN202010927465.7A CN202010927465A CN112036654B CN 112036654 B CN112036654 B CN 112036654B CN 202010927465 A CN202010927465 A CN 202010927465A CN 112036654 B CN112036654 B CN 112036654B
- Authority
- CN
- China
- Prior art keywords
- photovoltaic power
- population
- construction
- electric vehicle
- power station
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000010276 construction Methods 0.000 claims abstract description 143
- 210000000349 chromosome Anatomy 0.000 claims abstract description 126
- 238000009826 distribution Methods 0.000 claims abstract description 80
- 230000035772 mutation Effects 0.000 claims abstract description 44
- 238000005457 optimization Methods 0.000 claims description 27
- 238000005206 flow analysis Methods 0.000 claims description 12
- 101150000810 BVES gene Proteins 0.000 claims description 10
- 101150025129 POP1 gene Proteins 0.000 claims description 10
- 101100273030 Schizosaccharomyces pombe (strain 972 / ATCC 24843) caf1 gene Proteins 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 8
- 230000002068 genetic effect Effects 0.000 claims description 6
- 238000004458 analytical method Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 238000004146 energy storage Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000010248 power generation Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000004513 sizing Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/08—Probabilistic or stochastic CAD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/04—Power grid distribution networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Biophysics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Human Resources & Organizations (AREA)
- Evolutionary Computation (AREA)
- Strategic Management (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Evolutionary Biology (AREA)
- Artificial Intelligence (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Bioinformatics & Computational Biology (AREA)
- General Health & Medical Sciences (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Public Health (AREA)
- Data Mining & Analysis (AREA)
- Water Supply & Treatment (AREA)
- Computer Hardware Design (AREA)
- Medical Informatics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Primary Health Care (AREA)
- Physiology (AREA)
- Genetics & Genomics (AREA)
- Biomedical Technology (AREA)
- Computational Linguistics (AREA)
- Geometry (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
Abstract
Description
技术领域technical field
本发明涉及电动车充电网络技术领域,具体涉及基于协同进化的光伏电站与电动汽车充电网络规划方法。The invention relates to the technical field of electric vehicle charging networks, in particular to a photovoltaic power station and an electric vehicle charging network planning method based on co-evolution.
背景技术Background technique
大力发展以光伏为代表的可再生能源发电和以电动汽车为代表的清洁能源交通工具是促进能源变革,实现可持续发展的重要途径之一。现有技术下,配电系统是分布式光伏并网和电动汽车充电的重要场所,显然,电动汽车充电网络和光伏电站将共同影响配电系统运行工况。对配电系统来说,不合理的光伏电站和电动汽车充电站布局将恶化运行工况,影响对用户的正常供电,具体表现为网损电量增加,节点电压偏差超标与线路潮流越限等。在此背景下,有必要对配电系统中的光伏电站和电动汽车充电网络进行协同规划,在确保配电系统运行工况满足技术要求的前提下,最小化配电系统运行成本。电动汽车充电站的充电负荷和光伏出力均具有随机特性,在这两大随机因素的共同作用下,配电系统运行工况呈现显著的随机特性,因此,光伏电站与电动汽车充电网络协同规划模型必然成为随机优化模型。综上,亟需提出考虑配电系统运行工况随机特性的光伏电站与电动汽车充电网络随机协同规划模型与对应的求解方法。Vigorously developing renewable energy power generation represented by photovoltaics and clean energy transportation represented by electric vehicles is one of the important ways to promote energy reform and achieve sustainable development. Under the existing technology, the power distribution system is an important place for distributed photovoltaic grid connection and electric vehicle charging. Obviously, the electric vehicle charging network and the photovoltaic power station will jointly affect the operating conditions of the power distribution system. For the power distribution system, unreasonable layout of photovoltaic power stations and electric vehicle charging stations will deteriorate the operating conditions and affect the normal power supply to users. The specific manifestations are the increase of power loss in the network, the excessive node voltage deviation and the line power flow exceeding the limit. In this context, it is necessary to coordinate the planning of the photovoltaic power station and the electric vehicle charging network in the power distribution system, so as to minimize the operating cost of the power distribution system on the premise of ensuring that the operating conditions of the power distribution system meet the technical requirements. Both the charging load and photovoltaic output of electric vehicle charging stations have random characteristics. Under the combined action of these two random factors, the operating conditions of the power distribution system exhibit significant random characteristics. Therefore, the collaborative planning model of photovoltaic power station and electric vehicle charging network It must be a stochastic optimization model. To sum up, it is urgent to propose a stochastic collaborative programming model and a corresponding solution method of photovoltaic power station and electric vehicle charging network considering the stochastic characteristics of power distribution system operating conditions.
文献一《Comprehensive optimization model for sizing and siting of DGunits,EV charging stations,and energy storage systems》(IEEE Transactions onSmart Grid,2018年,第9卷,第4期,第3871页至3882页)建立了用于同时优化配电系统中分布式光伏电站、电动汽车充电站与储能电站建设地址和容量的二阶锥优化模型,并采用GAMS软件进行求解。研究中,对分布式光伏电站出力与电动汽车充电负荷的时变特性进行了考虑,但未计及这二者的随机特性,有一定的局限性。在考虑包括光伏电站在内的分布式电源同时对配电网负荷和充电站进行供电的前提下,文献二《含分布式电源及电动汽车充电站的配电网多目标规划研究》(电网技术,2015年,第39卷,第2期,第450页至456页)建立了用于同时优化分布式电源和电动汽车充电站建设地址和容量的多目标优化模型,并采用多目标自由搜索算法给出了模型的Pareto解集。然而,该文献并未考虑分布式电源出力与电动汽车充电站充电负荷的随机特性,给出的规划结果具有一定的局限性。在考虑光伏电站出力与充电站充电负荷随机特性的基础上,文献三《含光伏分布式电源配电网的电动汽车充电站机会约束规划》(电力系统及其自动化学报,2017年,第29卷,第6期,第45页至52页)建立了用于分布式光伏电站和电动汽车充电站建设地址优化的随机规划模型,并采用蝙蝠算法求解模型。该文献对光伏电站出力与充电站充电负荷的随机特性考虑的不够充分,且主要侧重于对电动汽车充电站和光伏电站的建设地址进行优化,具有一定的局限性。
电动汽车充电网络和光伏电站将共同影响配电系统的运行工况,不合理的光伏电站和电动汽车网络布局将恶化配电系统运行工况,影响对用户的正常供电,具体表现为网损电量增加,节点电压偏差超标与线路潮流越限等。因此,有必要对配电系统中的光伏电站和电动汽车充电网络进行协同规划,在确保配电系统运行工况满足技术要求的前提下,最小化配电系统运行成本。然而,现有技术方法并未充分考虑分布式光伏电站出力与充电负荷的随机特性,具有一定的局限性。The electric vehicle charging network and the photovoltaic power station will jointly affect the operating conditions of the power distribution system. The unreasonable layout of the photovoltaic power station and the electric vehicle network will worsen the operating conditions of the power distribution system and affect the normal power supply to users. increase, the node voltage deviation exceeds the standard and the line power flow exceeds the limit. Therefore, it is necessary to coordinate the planning of the photovoltaic power station and the electric vehicle charging network in the power distribution system, so as to minimize the operating cost of the power distribution system under the premise of ensuring that the operating conditions of the power distribution system meet the technical requirements. However, the prior art method does not fully consider the random characteristics of the output and charging load of the distributed photovoltaic power station, and has certain limitations.
发明内容SUMMARY OF THE INVENTION
为了解决上述问题,本发明提供基于协同进化的光伏电站与电动汽车充电网络规划方法,对电动汽车充电站与光伏电站的建设位置和建设容量进行协同优化,在确保配电系统运行工况满足技术要求的前提下,最小化配电系统运行成本,为工程技术人员提供参考。In order to solve the above problems, the present invention provides a photovoltaic power station and electric vehicle charging network planning method based on co-evolution, which can coordinately optimize the construction location and construction capacity of the electric vehicle charging station and the photovoltaic power station, and ensure that the operating conditions of the power distribution system meet the technical requirements. Under the premise of requirements, minimize the operating cost of the power distribution system and provide reference for engineering and technical personnel.
为了实现以上目的,本发明采取的技术方案是:In order to realize the above purpose, the technical scheme that the present invention takes is:
基于协同进化的光伏电站与电动汽车充电网络规划方法,包括如下步骤:S10给定规划边界条件,所述规划边界条件包括:配电系统拓扑参数与规划典型日内的负荷,规划典型日内的充电负荷与光伏出力概率场景集,充电站候选地址总数,充电站建设总数与总建设容量,充电站建设类型与对应的建设容量,光伏电站候选地址总数,光伏电站建设总数与总建设容量,光伏电站建设类型与对应的建设容量,节点电压最大允许偏移百分数,节点电压越限与潮流越限置信度;S20使用所述规划边界条件建立光伏电站与电动汽车充电网络随机协同规划模型;以及S30设计分别用于表示光伏电站与电动汽车充电网络建设方案的染色体编码策略与对应的交叉、变异操作算子,采用协同进化算法求解光伏电站与电动汽车充电网络随机协同规划模型,给出光伏电站与电动汽车充电网络最优规划方案。The method for planning a photovoltaic power station and an electric vehicle charging network based on co-evolution includes the following steps: S10, a planning boundary condition is given, and the planning boundary conditions include: power distribution system topology parameters and planning load on a typical day, and planning a charging load on a typical day and PV output probability scenario set, total number of candidate addresses of charging stations, total number of charging station construction and total construction capacity, type of charging station construction and corresponding construction capacity, total number of candidate addresses of photovoltaic power stations, total number of photovoltaic power station constructions and total construction capacity, photovoltaic power station construction Type and corresponding construction capacity, the maximum allowable deviation percentage of node voltage, and the confidence level of node voltage over-limit and power flow over-limit; S20 uses the planning boundary conditions to establish a random collaborative planning model for photovoltaic power plants and electric vehicle charging networks; and S30 design respectively Chromosome coding strategy and corresponding crossover and mutation operators are used to represent the construction scheme of photovoltaic power station and electric vehicle charging network. Co-evolutionary algorithm is used to solve the stochastic collaborative planning model of photovoltaic power station and electric vehicle charging network, and the photovoltaic power station and electric vehicle are given. Optimal planning scheme of charging network.
进一步地,所述步骤S20包括:光伏电站与电动汽车充电网络随机协同规划模型的优化目标为减小配电系统规划典型日内的网损电量,如公式(1)所示,Further, the step S20 includes: the optimization goal of the stochastic collaborative planning model of the photovoltaic power station and the electric vehicle charging network is to reduce the grid loss power in a typical day of the power distribution system planning, as shown in formula (1),
其中,Floss为配电系统规划典型日内的网损电量期望;t为潮流分析时段索引,Tf为典型日内的潮流分析时段数;l为配电线路索引;Ωbr为配电线路索引集合;ΔPloss,l,t为配电线路l在潮流分析时段t的损耗功率,为随机变量;E(·)为对随机变量求期望的运算符;所述S20还包括确定约束以及机会约束,所述确定约束包括分别通过公式(2)~(5)获取的表示充电站建设总数机会约束、表示光伏电站建设总数机会约束、表示充电站总建设容量的机会约束以及表示光伏电站总建设容量的机会约束,所述机会约束包括分别通过公式(6)~(7)获得的表示节点电压偏移机会约束以及表示线路潮流越限机会约束,Among them, F loss is the expected power loss of the power distribution system in a typical day; t is the power flow analysis period index, T f is the number of power flow analysis periods in a typical day; l is the distribution line index; Ω br is the distribution line index set ; ΔP loss, l, t is the power loss of the distribution line l in the power flow analysis period t, which is a random variable; E( ) is an operator that seeks the expectation of the random variable; the S20 also includes a determination constraint and a chance constraint, The determination constraints include the opportunity constraints representing the total number of construction of charging stations, the opportunity constraints representing the total number of photovoltaic power station constructions, the opportunity constraints representing the total construction capacity of charging stations, and the opportunity constraints representing the total construction capacity of photovoltaic power stations, which are obtained through formulas (2) to (5). Opportunity constraints, the opportunity constraints include the node voltage offset opportunity constraints and the line power flow over-limit opportunity constraints obtained through formulas (6) to (7), respectively,
其中,Mch为充电站建设总数;Nch为充电站候选地址总数;i为候选地址索引;xi是表征是否在候选地址i建设充电站的0-1变量,为光伏电站与电动汽车充电网络随机协同规划模型中的0-1优化变量,取“1”表示在候选地址i建设充电站,取“0”表示不在候选地址i建设充电站,i=1,2,3,···,Nch;Among them, M ch is the total number of charging stations built; N ch is the total number of candidate addresses of charging stations; i is the index of candidate addresses; xi is a 0-1 variable indicating whether to build a charging station at candidate address i to charge photovoltaic power stations and electric vehicles The 0-1 optimization variable in the network random collaborative planning model, taking "1" means building a charging station at candidate address i, taking "0" means not building a charging station at candidate address i, i=1,2,3,... , Nch ;
其中,Mpv为光伏电站建设总数;Npv为光伏电站候选地址总数;j为候选地址索引;yj是表征是否在候选地址j建设充电站的0-1变量,为光伏电站与电动汽车充电网络随机协同规划模型中的0-1优化变量,取“1”表示在候选地址j建设光伏电站,取“0”表示不在候选地址j建设光伏电站,j=1,2,3,···,Npv;Among them, M pv is the total number of photovoltaic power stations constructed; N pv is the total number of candidate addresses of photovoltaic power stations; j is the index of candidate addresses; y j is a 0-1 variable that indicates whether to build a charging station at candidate address j, for charging photovoltaic power stations and electric vehicles The 0-1 optimization variable in the network stochastic collaborative planning model, taking "1" means building a photovoltaic power station at the candidate address j, taking "0" means not building a photovoltaic power station at the candidate address j, j=1,2,3,... ,N pv ;
其中,zi为候选地址i的充电站建设容量,将待建电动汽车充电站分为Qev类;Cch为充电站总建设容量;Among them, zi is the charging station construction capacity of candidate address i, and the electric vehicle charging stations to be built are divided into Q ev categories; C ch is the total construction capacity of charging stations;
其中,Wj为候选地址j的光伏电站建设容量,对光伏电站来说,待建光伏电站分为Qpv类;Cpv为光伏电站总建设容量;Among them, W j is the construction capacity of the photovoltaic power station at the candidate address j. For the photovoltaic power station, the photovoltaic power station to be built is divided into Q pv categories; C pv is the total construction capacity of the photovoltaic power station;
其中,Pr{·}表示括号中随机事件发生的概率;k是配电节点索引;Ωbus为配电节点索引集合;Uk为节点k的电压,为随机变量,概率分布特性由概率潮流分析结果给出;UN为配电系统额定电压;α%为节点最大电压允许偏移百分数;β1为电压越限置信度;Among them, P r {·} represents the probability of random events in parentheses; k is the distribution node index; Ω bus is the distribution node index set; U k is the voltage of node k, which is a random variable, and the probability distribution characteristics are determined by the probability power flow The analysis results are given; U N is the rated voltage of the power distribution system; α% is the maximum allowable deviation percentage of the node voltage; β 1 is the confidence level of the voltage exceeding the limit;
Pr{Il>Il,max}≤β2 l∈Ωbr (7)P r {I l >I l, max }≤β 2 l∈Ω br (7)
其中,Il为配电线路l中的负荷电流,为随机变量,概率分布特性由概率潮流分析结果给出;Il,max为配电线路l的最大允许电流;β2为潮流越限置信度。Among them, I l is the load current in the distribution line l, which is a random variable, and the probability distribution characteristics are given by the probabilistic power flow analysis results; I l,max is the maximum allowable current of the distribution line l; β 2 is the power flow over-limit confidence Spend.
进一步地,所述步骤S30包括如下步骤:S301设定遗传算法参数,所述遗传算法参数包括对光伏电站建设方案进行优化的种群规模Npop1、对电动汽车充电站建设方案进行优化的种群规模Npop2、交叉率Pc、变异率Pm以及协同进化的最大进化代数Gmax;S302初始化种群Ψev中的染色体,采用整数编码方案对种群Ψev中的染色体进行编码,其中,Ψev为用于充电网络建设方案优化的种群;S303初始化种群Ψpv中的染色体,采用整数编码方案对种群Ψpv中的染色体进行编码,其中,Ψpv用于光伏电站建设方案优化的种群;S304从种群Ψev与Ψpv中各随机挑选一条染色体,构建初始生态系统;S305进化代数索引g初始化为0,即令g=0;S306令g=g+1,开始进行第g代进化,种群Ψev中的染色体索引m与种群Ψpv中的染色体索引n均初始化为1,即令m=1,n=1;S307对种群Ψev中的第m条染色体进行解码,确定Mch个电动汽车充电站的建设位置,建设容量与总建设容量Ct-ev,对生态系统中表示光伏电站建设方案的染色体进行解码,确定Mev个光伏电站的建设位置,建设容量与总建设容量Ct-pv;采用场景概率法进行配电系统概率潮流计算,确定规划典型日内的网损电量期望Floss,各节点电压幅值与各线路潮流的概率分布特性,按公式(8)~(12)计算种群Ψev中的第m条染色体的适应度;Further, the step S30 includes the following steps: S301 sets genetic algorithm parameters, the genetic algorithm parameters include a population size N pop1 for optimizing the photovoltaic power station construction scheme, and a population size N for optimizing the electric vehicle charging station construction scheme. pop2 , crossover rate P c , mutation rate P m and the maximum evolutionary generation G max of co-evolution; S302 initializes the chromosomes in the population Ψ ev , and uses an integer coding scheme to encode the chromosomes in the population Ψ ev , where Ψ ev is the It is the population optimized for the charging network construction plan; S303 initializes the chromosomes in the population Ψ pv , and uses the integer coding scheme to encode the chromosomes in the population Ψ pv , where Ψ pv is used for the optimized population of the photovoltaic power station construction plan; S304 From the population Ψ One chromosome is randomly selected from each of ev and Ψ pv to construct the initial ecosystem; S305 , the evolutionary algebra index g is initialized to 0, that is, g=0; The chromosome index m and the chromosome index n in the population Ψ pv are both initialized to 1, that is, m=1, n=1; S307 decodes the mth chromosome in the population Ψ ev , and determines the construction of M ch electric vehicle charging stations Location, construction capacity and total construction capacity C t-ev , decode the chromosome representing the photovoltaic power plant construction plan in the ecosystem, and determine the construction positions, construction capacity and total construction capacity C t-pv of M ev photovoltaic power plants; use scenarios The probability method is used to calculate the probability power flow of the power distribution system, to determine the expected power loss F loss in a typical planned day, the probability distribution characteristics of the voltage amplitude of each node and the power flow of each line, and calculate the population Ψ ev according to formulas (8) to (12). The fitness of the mth chromosome;
Vfit-ev,m=Fmax-Floss-η1×Vp1-η2×Vp2-η3×Vp3-η4×Vp4 (8)V fit-ev,m =F max -F loss -η 1 ×V p1 -η 2 ×V p2 -η 3 ×V p3 -η 4 ×V p4 (8)
Vp1=|Cch-Ct-ev| (9)V p1 =|C ch -C t-ev | (9)
Vp2=|Cpv-Ct-pv| (10)V p2 =|C pv -C t-pv | (10)
其中,Fmax为预设正数,用以确保染色体适应度非负,算子表示取中较大的数,采用罚函数法分别处理公式(4)~(7)给出的约束,η1、η2、η3以及η4为罚系数;Vp1、Vp2、Vp3以及Vp4分别表示公式(4)~(7)给出约束的违背程度;S308判断是否计算完种群Ψev中所有染色体的适应度,即判断染色体索引m是否等于种群规模Npop2,若m<Npop2,则令m=m+1,并跳转至步骤S307,继续计算种群Ψev中下一条染色体的适应度;否则,继续执行步骤S309;S309从种群Ψev中挑选最优秀的染色体,替换生态系统中表示充电网络建设方案的染色体,更新生态系统;S310对种群Ψpv中的第n条染色体进行解码,确定Mev个光伏电站的建设位置,建设容量与总建设容量Ct-pv,对生态系统中表示充电网络建设方案的染色体进行解码,确定Mch个电动汽车充电站的建设位置,建设容量与总建设容量Ct-ev;在此基础上,采用场景概率法进行配电系统概率潮流计算,确定规划典型日内的网损电量期望Floss,各节点电压幅值与各线路潮流的概率分布特性,并按公式(13)计算种群Ψpv中的第n条染色体的适应度Vfit-pv,n,Among them, Fmax is a preset positive number to ensure that the chromosome fitness is non-negative, and the operator means to take For the larger number in , the penalty function method is used to deal with the constraints given by equations (4) to (7), respectively, η 1 , η 2 , η 3 and η 4 are penalty coefficients; V p1 , V p2 , V p3 and V p4 represents the degree of violation of the constraints given by formulas (4) to (7) respectively; S308 judges whether the fitness of all chromosomes in the population Ψ ev has been calculated, that is, judges whether the chromosome index m is equal to the population size N pop2 , if m<N pop2 , then let m=m+1, and jump to step S307, and continue to calculate the fitness of the next chromosome in the population Ψ ev ; otherwise, continue to perform step S309; S309 selects the best chromosome from the population Ψ ev and replaces the ecological The chromosome representing the charging network construction plan in the system, and the ecosystem is updated; S310 decodes the nth chromosome in the population Ψ pv to determine the construction positions of M ev photovoltaic power stations, the construction capacity and the total construction capacity C t-pv The chromosomes representing the charging network construction plan in the ecosystem are decoded to determine the construction locations of M ch electric vehicle charging stations, the construction capacity and the total construction capacity C t-ev ; Calculate the power flow, determine the expected power loss F loss in a typical planned day, the probability distribution characteristics of the voltage amplitude of each node and the power flow of each line, and calculate the fitness V fit of the nth chromosome in the population Ψ pv according to formula (13). -pv,n ,
Vfit-pv,n=Fmax-Floss-η1×Vp1-η2×Vp2-η3×Vp3-η4×Vp4 (13)V fit-pv,n =F max -F loss -η 1 ×V p1 -η 2 ×V p2 -η 3 ×V p3 -η 4 ×V p4 (13)
S311判断是否计算完种群Ψpv中所有染色体的适应度,即判断染色体索引n是否等于种群规模Npop1,若n<Npop1,则令n=n+1,并跳转至步骤S310,继续计算种群Ψpv中下一条染色体的适应度;否则,继续执行步骤S312;S312以适应度为依据,从种群Ψpv中挑选最优秀的染色体,替换生态系统中表示光伏电站建设方案的染色体,更新生态系统;S313判断是否到达最大进化代数,若g=Gmax,则继续执行步骤S314;否则,以适应度为依据,分别对种群Ψev与Ψpv进行复制、交叉与变异操作,更新这两个种群,并跳转至步骤S306;S314对生态系统中分别表示电动汽车充电网络建设方案与光伏电站建设方案的两条染色体进行解码,作为光伏电站与电动汽车充电网络随机协同规划模型的最优解输出,结束算法流程。S311 judges whether the fitness of all chromosomes in the population Ψ pv has been calculated, that is, judges whether the chromosome index n is equal to the population size N pop1 , if n<N pop1 , then set n=n+1, and jump to step S310 to continue the calculation The fitness of the next chromosome in the population Ψ pv ; otherwise, continue to step S312; S312 selects the best chromosome from the population Ψ pv based on the fitness, replaces the chromosome representing the photovoltaic power station construction plan in the ecosystem, and updates the ecosystem system; S313 judges whether the maximum evolutionary algebra is reached, if g=G max , then continue to perform step S314; otherwise, based on the fitness, the populations Ψ ev and Ψ pv are copied, crossed and mutated respectively, and the two are updated. population, and jump to step S306; S314 decodes the two chromosomes in the ecosystem representing the electric vehicle charging network construction scheme and the photovoltaic power station construction scheme respectively, as the optimal solution of the photovoltaic power station and the electric vehicle charging network stochastic collaborative planning model Output, end the algorithm flow.
进一步地,对种群Ψev来说,为确保交叉后的染色体满足公式(2)给出的等式约束,按如下步骤进行交叉操作:S41从种群Ψev中随机选取两条染色体作为待交叉染色体;S42反复随机生成待选交叉位Ncan1,其中,1<Ncan1<Nch,直至找到可行交叉位Ncr1;以及S43以交叉概率Pc交换两条待交叉染色体中第Ncr1个码位后的码串,完成交叉操作。Further, for the population Ψ ev , in order to ensure that the crossed chromosomes satisfy the equality constraints given by formula (2), the crossover operation is performed as follows: S41 randomly selects two chromosomes from the population Ψ ev as the chromosomes to be crossed. ; S42 repeatedly randomly generates the candidate crossover position N can1 , wherein 1<N can1 <N ch , until a feasible crossover position N cr1 is found; and S43 exchanges the N cr1 th code position in the two chromosomes to be crossed with the crossover probability P c After the code string, the crossover operation is completed.
进一步地,对种群Ψpv来说,为确保交叉后的染色体满足公式(3)给出的等式约束,按如下步骤进行交叉操作:S51从种群Ψpv中随机选取两条染色体作为待交叉染色体;S52反复随机生成待选交叉位Ncan2,其中,1<Ncan2<Npv,直至找到可行交叉位Ncr2;以及S53以交叉概率Pc交换两条待交叉染色体中第Ncr2个码位后的码串,完成交叉操作。Further, for the population Ψ pv , in order to ensure that the crossed chromosomes satisfy the equality constraints given by formula (3), the crossover operation is performed as follows: S51 randomly selects two chromosomes from the population Ψ pv as the chromosomes to be crossed. ; S52 repeatedly randomly generates the candidate crossover position N can2 , wherein 1<N can2 <N pv , until a feasible crossover position N cr2 is found; and S53 exchanges the N cr2 th code position in the two chromosomes to be crossed with the crossover probability P c After the code string, the crossover operation is completed.
进一步地,种群Ψev变异操作算子包括如下步骤:S61从种群Ψev中随机选取一条染色体作为待变异染色体;S62随机生成两个待变异码位Nmu1与Nmu2,其中,1<Nmu1<Nch,1<Nmu2<Nch,确保两个待变异码位的取值一个为“0”,一个为非“0”整数;以及S63以变异概率Pm同时对待变异位Nmu1与Nmu2进行变异操作,即取值为“0”的待变异位变异为不大于Qev的非“0”随机整数,取值非“0”的待变异位变异为“0”,完成变异操作。Further, the population Ψ ev mutation operation operator includes the following steps: S61 randomly selects a chromosome from the population Ψ ev as the chromosome to be mutated; S62 randomly generates two code positions to be mutated N mu1 and N mu2 , where 1<N mu1 <N ch , 1<N mu2 <N ch , to ensure that one of the values of the two code bits to be mutated is “0” and the other is an integer other than “0”; and S63 treats the mutated bits N mu1 and N mu1 simultaneously with the mutation probability P m N mu2 performs the mutation operation, that is, the bit to be mutated whose value is "0" is mutated into a non-"0" random integer not greater than Q ev , and the bit to be mutated whose value is not "0" is mutated to "0", and the mutation operation is completed. .
进一步地,种群Ψpv变异操作算子包括如下步骤:S71从种群Ψpv中随机选取一条染色体作为待变异染色体;S72随机生成两个待变异码位Nmu3与Nmu4,其中1<Nmu3<Npv,1<Nmu4<Npv,确保两个待变异码位的取值一个为“0”,一个为非“0”整数;以及S73以变异概率Pm同时对待变异位Nmu3与Nmu4进行变异操作,即取值为“0”的待变异位变异为不大于Qpv的非“0”随机整数,取值非“0”的待变异位变异为“0”,完成变异操作。Further, the population Ψ pv mutation operator includes the following steps: S71 randomly selects a chromosome from the population Ψ pv as the chromosome to be mutated; S72 randomly generates two code positions to be mutated N mu3 and N mu4 , where 1<N mu3 < N pv , 1<N mu4 <N pv , to ensure that the values of the two code bits to be mutated are one “0” and the other is an integer other than “0”; and S73 treats the mutated bits N mu3 and N simultaneously with the mutation probability P m Mu4 performs the mutation operation, that is, the mutated bit with a value of "0" is mutated into a non-"0" random integer not greater than Q pv , and the to-be-mutated bit with a value other than "0" is mutated to "0" to complete the mutation operation.
本发明的上述技术方案相比现有技术具有以下优点:The above-mentioned technical scheme of the present invention has the following advantages compared with the prior art:
(1)本发明的基于协同进化的光伏电站与电动汽车充电网络规划方法,在光伏电站/充电站建设数目和总建设总容量给定的情况下,对电动汽车充电站与光伏电站的建设位置和建设容量进行协同优化,在确保配电系统运行工况满足技术要求的前提下,最小化配电系统运行成本,为工程技术人员提供参考。(1) In the co-evolution-based photovoltaic power station and electric vehicle charging network planning method of the present invention, given the number of photovoltaic power stations/charging stations and the total construction capacity, the construction positions of the electric vehicle charging station and the photovoltaic power station are determined. Coordinate optimization with the construction capacity, minimize the operating cost of the power distribution system on the premise of ensuring that the operating conditions of the power distribution system meet the technical requirements, and provide a reference for engineers and technicians.
(2)本发明的基于协同进化的光伏电站与电动汽车充电网络规划方法,充电负荷与光伏发电出力均具有随机特性,将光伏电站与电动汽车充电网络协同规划规划问题建模为基于机会约束的随机优化模型,模型优化变量为:光伏电站接入位置与接入容量,电动汽车充电站接入位置与接入容量;优化目标为配电系统运行成本最小,具体表现为配电系统规划典型日内的网损电量期望最小;优化约束为:充电站建设数目与容量约束,光伏电站建设数目与容量约束,节点电压偏移机会约束与线路潮流越限机会约束。(2) In the co-evolution-based photovoltaic power station and electric vehicle charging network planning method of the present invention, both the charging load and photovoltaic power generation output have random characteristics, and the photovoltaic power station and electric vehicle charging network collaborative planning planning problem is modeled as a chance constraint-based Stochastic optimization model, the model optimization variables are: photovoltaic power station access location and access capacity, electric vehicle charging station access location and access capacity; the optimization goal is to minimize the operating cost of the power distribution system, which is embodied in the typical day of the power distribution system planning. The expected minimum power loss of the network; the optimization constraints are: the number and capacity constraints of charging stations, the constraints on the number and capacity of photovoltaic power stations, node voltage offset opportunity constraints and line power flow over-limit opportunities constraints.
(3)本发明的基于协同进化的光伏电站与电动汽车充电网络规划方法,采用两个种群分别表示光伏电站与电动汽车充电网络的建设方案,基于染色体适应度评价结果,借助复制、交叉与变异操作算子迭代更新两个种群与由种群最优染色体构成的生态系统,直至给出最终的光伏电站与电动汽车充电网络最优建设方案,为提高求解效率,分别设计了用于表示光伏电站与电动汽车充电网络最优建设方案的编码方案以及对应的交叉、变异操作算子。(3) The co-evolution-based photovoltaic power station and electric vehicle charging network planning method of the present invention adopts two populations to represent the construction scheme of photovoltaic power station and electric vehicle charging network respectively. The operation operator iteratively updates the two populations and the ecosystem composed of the optimal chromosomes of the population until the final optimal construction scheme of photovoltaic power station and electric vehicle charging network is given. The coding scheme of the optimal construction scheme of electric vehicle charging network and the corresponding crossover and mutation operators.
附图说明Description of drawings
下面结合附图,通过对本发明的具体实施方式详细描述,将使本发明的技术方案及其有益效果显而易见。The technical solutions of the present invention and its beneficial effects will be apparent through the detailed description of the specific embodiments of the present invention below in conjunction with the accompanying drawings.
图1所示为本发明一实施例的基于协同进化的光伏电站与电动汽车充电网络规划方法流程图;1 is a flowchart of a method for planning a photovoltaic power station and an electric vehicle charging network based on co-evolution according to an embodiment of the present invention;
图2所示为本发明一实施例的所述步骤S30的流程图;FIG. 2 is a flowchart of the step S30 according to an embodiment of the present invention;
图3所示为本发明一实施例的用于充电网络建设方案优化的种群Ψev交叉操作流程图;FIG. 3 shows a flow chart of the population Ψ ev crossover operation for optimizing the charging network construction scheme according to an embodiment of the present invention;
图4所示为本发明一实施例的用于光伏电站建设方案优化的种群Ψpv交叉操作流程图;FIG. 4 shows a flow chart of population Ψ pv crossover operation for optimization of photovoltaic power station construction scheme according to an embodiment of the present invention;
图5所示为本发明一实施例的用于充电网络建设方案优化的种群Ψev变异操作流程图;FIG. 5 is a flow chart of population Ψ ev mutation operation for optimization of charging network construction scheme according to an embodiment of the present invention;
图6所示为本发明一实施例的用于光伏电站建设方案优化的种群Ψpv变异操作流程图。FIG. 6 is a flow chart of population Ψ pv mutation operation for optimization of a photovoltaic power plant construction scheme according to an embodiment of the present invention.
具体实施方式Detailed ways
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域技术人员在没有作出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative efforts shall fall within the protection scope of the present invention.
本实施例提供了基于协同进化的光伏电站与电动汽车充电网络规划方法,如图1所示,包括如下步骤:S10给定规划边界条件。S20使用所述规划边界条件建立光伏电站与电动汽车充电网络随机协同规划模型。以及S30设计分别用于表示光伏电站与电动汽车充电网络建设方案的染色体编码策略与对应的交叉、变异操作算子,采用协同进化算法求解光伏电站与电动汽车充电网络随机协同规划模型,给出光伏电站与电动汽车充电网络最优规划方案。This embodiment provides a method for planning a photovoltaic power station and an electric vehicle charging network based on co-evolution, as shown in FIG. 1 , including the following steps: S10, a planning boundary condition is given. S20 uses the planning boundary conditions to establish a random collaborative planning model of the photovoltaic power station and the electric vehicle charging network. And S30 is designed to represent the chromosome coding strategy and the corresponding crossover and mutation operators of the photovoltaic power station and electric vehicle charging network construction scheme respectively. The co-evolutionary algorithm is used to solve the random collaborative planning model of the photovoltaic power station and the electric vehicle charging network, and the photovoltaic power station and the electric vehicle charging network are given. Optimal planning scheme for power station and electric vehicle charging network.
所述规划边界条件包括:配电系统拓扑参数与规划典型日内的负荷,规划典型日内的充电负荷与光伏出力概率场景集,充电站候选地址总数,充电站建设总数与总建设容量,充电站建设类型与对应的建设容量,光伏电站候选地址总数,光伏电站建设总数与总建设容量,光伏电站建设类型与对应的建设容量,节点电压最大允许偏移百分数,节点电压越限与潮流越限置信度。The planning boundary conditions include: distribution system topology parameters and planned loads in a typical day, a set of charging loads and photovoltaic output probability scenarios in a typical planned day, the total number of candidate addresses for charging stations, the total number of charging station constructions and the total construction capacity, and the construction of charging stations. Type and corresponding construction capacity, total number of candidate locations for photovoltaic power plants, total number and total construction capacity of photovoltaic power plants, construction type and corresponding construction capacity of photovoltaic power plants, maximum allowable deviation percentage of node voltage, and confidence level of node voltage over-limit and power flow over-limit .
所述步骤S20为应对配电系统运行工况的随机特性,光伏电站与电动汽车充电网络随机协同规划模型中的节点电压偏移约束与线路潮流越限约束建模为机会约束,The step S20 is to deal with the stochastic characteristics of the operating conditions of the power distribution system, and the node voltage offset constraints and the line power flow out-of-limit constraints in the photovoltaic power station and the electric vehicle charging network stochastic collaborative programming model are modeled as chance constraints,
所述步骤S20包括:光伏电站与电动汽车充电网络随机协同规划模型的优化目标为减小配电系统规划典型日内的网损电量,如公式(1)所示,The step S20 includes: the optimization goal of the stochastic collaborative planning model of the photovoltaic power station and the electric vehicle charging network is to reduce the grid loss power in a typical day of the power distribution system planning, as shown in formula (1),
其中,Floss为配电系统规划典型日内的网损电量期望;t为潮流分析时段索引,Tf为典型日内的潮流分析时段数;l为配电线路索引;Ωbr为配电线路索引集合;ΔPloss,l,t为配电线路l在潮流分析时段t的损耗功率,为随机变量,可通过概率潮流计算获得;E(·)为对随机变量求期望的运算符。网损成本是配电系统运行成本的重要组成部分之一,充电负荷和光伏出力具有随机特性,因此,配电系统规划典型日内的网损电量也是随机变量,在此背景下,光伏电站与电动汽车充电网络随机协同规划模型的优化目标为配电系统规划典型日内的网损电量期望最小。Among them, F loss is the expected power loss of the power distribution system in a typical day; t is the power flow analysis period index, T f is the number of power flow analysis periods in a typical day; l is the distribution line index; Ω br is the distribution line index set ;ΔP loss,l,t is the power loss of distribution line l in the power flow analysis period t, which is a random variable, which can be obtained by probabilistic power flow calculation; E(·) is the operator for the expectation of random variables. The cost of network loss is one of the important components of the operating cost of the power distribution system. The charging load and photovoltaic output have random characteristics. Therefore, the power loss of the power distribution system in a typical day is also a random variable. The optimization objective of the stochastic collaborative planning model for the vehicle charging network is to minimize the expected grid loss in a typical day of the distribution system planning.
所述S20还包括确定约束以及机会约束,所述确定约束包括分别通过公式(2)~(5)获取的表示充电站建设总数机会约束、表示光伏电站建设总数机会约束、表示充电站总建设容量的机会约束以及表示光伏电站总建设容量的机会约束,所述机会约束包括分别通过公式(6)~(7)获得的表示节点电压偏移机会约束以及表示线路潮流越限机会约束,The S20 further includes a determination constraint and an opportunity constraint, and the determination constraint includes the opportunity constraint representing the total number of construction of the charging station, the opportunity constraint representing the total number of photovoltaic power station construction, and the total construction capacity of the charging station obtained through formulas (2) to (5) respectively. and the opportunity constraint representing the total construction capacity of the photovoltaic power station, and the opportunity constraint includes the opportunity constraint representing the node voltage offset and the opportunity constraint representing the line power flow exceeding the limit obtained by formulas (6) to (7), respectively,
其中,Mch为充电站建设总数;Nch为充电站候选地址总数;i为候选地址索引;xi是表征是否在候选地址i建设充电站的0-1变量,为光伏电站与电动汽车充电网络随机协同规划模型中的0-1优化变量,取“1”表示在候选地址i建设充电站,取“0”表示不在候选地址i建设充电站,i=1,2,3,···,Nch;Among them, M ch is the total number of charging stations built; N ch is the total number of candidate addresses of charging stations; i is the index of candidate addresses; xi is a 0-1 variable indicating whether to build a charging station at candidate address i to charge photovoltaic power stations and electric vehicles The 0-1 optimization variable in the network random collaborative planning model, taking "1" means building a charging station at candidate address i, taking "0" means not building a charging station at candidate address i, i=1,2,3,... , Nch ;
其中,Mpv为光伏电站建设总数;Npv为光伏电站候选地址总数;j为候选地址索引;yj是表征是否在候选地址j建设充电站的0-1变量,为光伏电站与电动汽车充电网络随机协同规划模型中的0-1优化变量,取“1”表示在候选地址j建设光伏电站,取“0”表示不在候选地址j建设光伏电站,j=1,2,3,···,Npv;Among them, M pv is the total number of photovoltaic power stations constructed; N pv is the total number of candidate addresses of photovoltaic power stations; j is the index of candidate addresses; y j is a 0-1 variable that indicates whether to build a charging station at candidate address j, for charging photovoltaic power stations and electric vehicles The 0-1 optimization variable in the network stochastic collaborative planning model, taking "1" means building a photovoltaic power station at the candidate address j, taking "0" means not building a photovoltaic power station at the candidate address j, j=1,2,3,... ,N pv ;
其中,zi为候选地址i的充电站建设容量,将待建电动汽车充电站分为Qev类,光伏电站与电动汽车充电网络随机协同规划模型中,按容量不同,将待建充电站分为Qev类,也就是说,zi有Qev种不同取值,zi是光伏电站与电动汽车充电网络联合随机规划模型中的离散优化变量;Cch为充电站总建设容量,由待规划区域内的电动汽车数目,充电站建设成本和充电站建设拟投资总额等因素共同确定;Among them, zi is the construction capacity of the charging station at the candidate address i, and the electric vehicle charging stations to be built are divided into Q ev categories. In the random collaborative planning model of photovoltaic power station and electric vehicle charging network, the charging stations to be built are divided into For the Q ev class, that is to say, zi has different values of Q ev , zi is the discrete optimization variable in the joint stochastic programming model of the photovoltaic power station and the electric vehicle charging network; C ch is the total construction capacity of the charging station, which is determined by the The number of electric vehicles in the planning area, the cost of charging station construction and the total investment to be invested in charging station construction are jointly determined;
其中,Wj为候选地址j的光伏电站建设容量,光伏电站与电动汽车充电网络随机协同规划模型中,按容量不同,待建光伏电站分为Qpv类,也就是说,wj有Qpv种不同取值,此时,Wj是光伏电站与电动汽车充电网络联合随机规划模型中的离散优化变量;Cpv为光伏电站总建设容量,由光伏电站建设成本和光伏电站建设拟投资总额等因素共同确定。Among them, W j is the construction capacity of the photovoltaic power station at the candidate address j. In the stochastic collaborative planning model between the photovoltaic power station and the electric vehicle charging network, the photovoltaic power stations to be built are divided into Q pv categories according to different capacities, that is to say, w j has Q pv At this time, W j is the discrete optimization variable in the joint stochastic programming model of the photovoltaic power station and the electric vehicle charging network; C pv is the total construction capacity of the photovoltaic power station, which is determined by the construction cost of the photovoltaic power station and the total investment in the construction of the photovoltaic power station, etc. factors are determined together.
其中,Pr{·}表示括号中随机事件发生的概率;k是配电节点索引;Ωbus为配电节点索引集合;Uk为节点k的电压,为随机变量,概率分布特性由概率潮流分析结果给出;UN为配电系统额定电压;α%为节点最大电压允许偏移百分数;β1为电压越限置信度;Among them, P r {·} represents the probability of random events in parentheses; k is the distribution node index; Ω bus is the distribution node index set; U k is the voltage of node k, which is a random variable, and the probability distribution characteristics are determined by the probability power flow The analysis results are given; U N is the rated voltage of the power distribution system; α% is the maximum allowable deviation percentage of the node voltage; β 1 is the confidence level of the voltage exceeding the limit;
Pr{Il>Il,max}≤β2 l∈Ωbr (7)P r {I l >I l, max }≤β 2 l∈Ω br (7)
其中,Il为配电线路l中的负荷电流,为随机变量,概率分布特性由概率潮流分析结果给出;Il,max为配电线路l的最大允许电流;β2为潮流越限置信度。Among them, I l is the load current in the distribution line l, which is a random variable, and the probability distribution characteristics are given by the probabilistic power flow analysis results; I l,max is the maximum allowable current of the distribution line l; β 2 is the power flow over-limit confidence Spend.
光伏电站与电动汽车充电网络随机协同规划模型中的约束分别如公式(2)~(7)所示,其中,公式(2)~(5)为确定性约束。考虑到配电系统运行工况的随机特性,公式(6)~(7)给出的节点电压偏移约束与线路潮流越限约束为机会约束。The constraints in the stochastic collaborative programming model of the photovoltaic power station and the electric vehicle charging network are shown in formulas (2) to (7), where formulas (2) to (5) are deterministic constraints. Considering the random characteristics of the operating conditions of the power distribution system, the node voltage offset constraints and line power flow out-of-limit constraints given by equations (6) to (7) are chance constraints.
如图2所示,所述步骤S30包括如下步骤:S301设定遗传算法参数,所述遗传算法参数包括对光伏电站建设方案进行优化的种群规模Npop1、对电动汽车充电站建设方案进行优化的种群规模Npop2、交叉率Pc、变异率Pm以及协同进化的最大进化代数Gmax。As shown in FIG. 2 , the step S30 includes the following steps: S301 sets genetic algorithm parameters, and the genetic algorithm parameters include the population size N pop1 for optimizing the photovoltaic power station construction plan, and the population size N pop1 for optimizing the electric vehicle charging station construction plan. Population size N pop2 , crossover rate P c , mutation rate P m and maximum evolutionary generation G max of co-evolution.
S302初始化种群Ψev中的染色体,采用整数编码方案对种群Ψev中的染色体进行编码,其中,Ψev为用于充电网络建设方案优化的种群。根据光伏电站与电动汽车充电网络随机协同规划模型的特征,采用整数编码方案对种群Ψev中的染色体进行编码。每条染色体由Nch个码位组成,第i个码位表征第i个候选地址的充电站建设情况(i=1,2,3,···,Nch),取值为“0”,说明不在候选地址i建设充电站,取值为“q”,说明在候选地址i建设第q类充电站(q=1,2,3,···,Qev),对应的建设容量为Cev,q。为满足公式(2)给出的等式约束,染色体中,有且仅有Mch个码位取值为非“0”整数。因此,按如下方法初始化种群Ψev中的染色体:首先,将染色体所有码位赋值为“0”;接着,随机挑选Mch个码位,将赋值由“0”改为不大于Qev的随机整数。S302 initializes the chromosomes in the population Ψ ev , and uses an integer encoding scheme to encode the chromosomes in the population Ψ ev , where Ψ ev is the population for optimization of the charging network construction scheme. According to the characteristics of the stochastic cooperative planning model of photovoltaic power station and electric vehicle charging network, an integer coding scheme is used to encode the chromosomes in the population Ψ ev . Each chromosome is composed of N ch code points, the ith code point represents the construction of the charging station of the ith candidate address (i=1, 2, 3, ···, N ch ), and the value is "0" , indicating that no charging station will be built at candidate address i, and the value is "q", indicating that the q-type charging station (q=1,2,3,...,Q ev ) will be built at candidate address i, and the corresponding construction capacity is Cev,q . In order to satisfy the equality constraint given by formula (2), in the chromosome, there are and only M ch code points whose value is an integer other than "0". Therefore, the chromosomes in the population Ψ ev are initialized as follows: first, assign all code points of the chromosome to "0"; then, randomly select M ch code points, and change the assignment from "0" to a random value not greater than Q ev Integer.
S303初始化种群Ψpv中的染色体,采用整数编码方案对种群Ψpv中的染色体进行编码,其中,Ψpv用于光伏电站建设方案优化的种群。根据光伏电站与电动汽车充电网络随机协同规划模型的特征,采用整数编码方案对种群Ψpv中的染色体进行编码。每条染色体由Npv个码位组成,第j个码位表征第j个候选地址的光伏电站建设情况(j=1,2,3,···,Npv),取值为“0”,说明不在候选地址j建设光伏电站,取值为“m”,说明在候选地址j建设第m类光伏电站(m=1,2,3,···,Qpv),对应的建设容量为Cpv,m。为满足公式(3)给出的等式约束,染色体中,有且仅有Mpv个码位取值为非“0”整数。因此,按如下方法初始化种群Ψpv中的染色体:首先,将染色体所有码位赋值为“0”;接着,随机挑选Mpv个码位,将赋值由“0”改为不大于Qpv的随机整数。S303 initializes the chromosomes in the population Ψ pv , and uses an integer encoding scheme to encode the chromosomes in the population Ψ pv , where Ψ pv is used for the population optimized for the photovoltaic power station construction plan. According to the characteristics of the stochastic collaborative planning model of photovoltaic power station and electric vehicle charging network, an integer coding scheme is used to encode the chromosomes in the population Ψ pv . Each chromosome is composed of N pv code points, and the jth code point represents the photovoltaic power station construction status of the jth candidate address (j=1, 2, 3, ···, N pv ), and takes the value "0" , indicating that the photovoltaic power station is not to be built at the candidate address j, the value is “m”, indicating that the m-th type photovoltaic power station (m=1, 2, 3, . . . , Q pv ) is to be built at the candidate address j, and the corresponding construction capacity is C pv,m . In order to satisfy the equality constraint given by the formula (3), in the chromosome, there are and only M pv code points whose value is an integer other than "0". Therefore, the chromosomes in the population Ψ pv are initialized as follows: first, all code points of the chromosome are assigned as "0"; then, M pv code points are randomly selected, and the assignment is changed from "0" to a random value not greater than Q pv Integer.
S304从种群Ψev与Ψpv中各随机挑选一条染色体,构建初始生态系统。S304 randomly selects one chromosome from each of the populations Ψ ev and Ψ pv to construct an initial ecosystem.
S305进化代数索引g初始化为0,即令g=0。S305, the evolution algebra index g is initialized to 0, that is, g=0.
S306令g=g+1,开始进行第g代进化,种群Ψev中的染色体索引m与种群Ψpv中的染色体索引n均初始化为1,即令m=1,n=1。S306 sets g=g+1, and starts the g-th generation evolution. Both the chromosome index m in the population Ψ ev and the chromosome index n in the population Ψ pv are initialized to 1, that is, m=1, n=1.
S307对种群Ψev中的第m条染色体进行解码,确定Mch个电动汽车充电站的建设位置,建设容量与总建设容量Ct-ev,对生态系统中表示光伏电站建设方案的染色体进行解码,确定Mev个光伏电站的建设位置,建设容量与总建设容量Ct-pv;采用场景概率法进行配电系统概率潮流计算,确定规划典型日内的网损电量期望Floss,各节点电压幅值与各线路潮流的概率分布特性,按公式(8)~(12)计算种群Ψev中的第m条染色体的适应度Vfit-ev,m;S307 decodes the mth chromosome in the population Ψ ev , determines the construction positions of M ch electric vehicle charging stations, the construction capacity and the total construction capacity C t-ev , and decodes the chromosome representing the photovoltaic power station construction plan in the ecosystem , determine the construction locations of M ev photovoltaic power stations, the construction capacity and the total construction capacity C t-pv ; use the scenario probability method to calculate the probability power flow of the power distribution system, determine the expected power loss F loss in a typical planned day, and the voltage amplitude of each node value and the probability distribution characteristics of the power flow of each line, calculate the fitness V fit-ev,m of the mth chromosome in the population Ψ ev according to formulas (8) to (12);
Vfit-ev,m=Fmax-Floss-η1×Vp1-η2×Vp2-η3×Vp3-η4×Vp4 (8)V fit-ev,m =F max -F loss -η 1 ×V p1 -η 2 ×V p2 -η 3 ×V p3 -η 4 ×V p4 (8)
Vp1=|Cch-Ct-ev| (9)V p1 =|C ch -C t-ev | (9)
Vp2=|Cpv-Ct-pv| (10)V p2 =|C pv -C t-pv | (10)
其中,Fmax为事先给定的比较大的正数,用以确保染色体适应度非负,算子表示取中较大的数,采用罚函数法分别处理公式(4)~(7)给出的约束,η1、η2、η3以及η4为罚系数;Vp1、Vp2、Vp3以及Vp4分别表示公式(4)~(7)给出约束的违背程度,可分别通过公式(9)~(12)计算获得。Among them, Fmax is a relatively large positive number given in advance to ensure that the chromosome fitness is non-negative, and the operator means to take For the larger number in , the penalty function method is used to deal with the constraints given by equations (4) to (7), respectively, η 1 , η 2 , η 3 and η 4 are penalty coefficients; V p1 , V p2 , V p3 and V p4 respectively represents the degree of violation of the constraints given by formulas (4) to (7), which can be calculated and obtained by formulas (9) to (12).
S308判断是否计算完种群Ψev中所有染色体的适应度,即判断染色体索引m是否等于种群规模Npop2,若m<Npop2,则令m=m+1,并跳转至步骤S307,继续计算种群Ψev中下一条染色体的适应度;否则,继续执行步骤S309;S308 judges whether the fitness of all chromosomes in the population Ψ ev has been calculated, that is, judges whether the chromosome index m is equal to the population size N pop2 , if m<N pop2 , then set m=m+1, and jump to step S307 to continue the calculation The fitness of the next chromosome in the population Ψ ev ; otherwise, continue to step S309;
S309从种群Ψev中挑选最优秀的染色体,替换生态系统中表示充电网络建设方案的染色体,更新生态系统;S309 selects the best chromosome from the population Ψ ev , replaces the chromosome representing the charging network construction plan in the ecosystem, and updates the ecosystem;
S310对种群Ψpv中的第n条染色体进行解码,确定Mev个光伏电站的建设位置,建设容量与总建设容量Ct-pv,对生态系统中表示充电网络建设方案的染色体进行解码,确定Mch个电动汽车充电站的建设位置,建设容量与总建设容量Ct-ev;在此基础上,采用场景概率法进行配电系统概率潮流计算,确定规划典型日内的网损电量期望Floss,各节点电压幅值与各线路潮流的概率分布特性,并按公式(13)计算种群Ψpv中的第n条染色体的适应度Vfit-pv,n。S310 decodes the nth chromosome in the population Ψ pv , determines the construction positions of M ev photovoltaic power plants, the construction capacity and the total construction capacity C t-pv , decodes the chromosome representing the charging network construction plan in the ecosystem, and determines The construction locations of M ch electric vehicle charging stations, the construction capacity and the total construction capacity C t-ev ; on this basis, the probability flow calculation of the power distribution system is carried out by using the scenario probability method, and the expected power loss F loss in a typical planned day is determined , the probability distribution characteristics of the voltage amplitude of each node and the power flow of each line, and the fitness V fit-pv,n of the nth chromosome in the population Ψ pv is calculated according to formula (13).
Vfit-pv,n=Fmax-Floss-η1×Vp1-η2×Vp2-η3×Vp3-η4×Vp4 (13)V fit-pv,n =F max -F loss -η 1 ×V p1 -η 2 ×V p2 -η 3 ×V p3 -η 4 ×V p4 (13)
S311判断是否计算完种群Ψpv中所有染色体的适应度,即判断染色体索引n是否等于种群规模Npop1,若n<Npop1,则令n=n+1,并跳转至步骤S310,继续计算种群Ψpv中下一条染色体的适应度;否则,继续执行步骤S312。S311 judges whether the fitness of all chromosomes in the population Ψ pv has been calculated, that is, judges whether the chromosome index n is equal to the population size N pop1 , if n<N pop1 , then set n=n+1, and jump to step S310 to continue the calculation The fitness of the next chromosome in the population Ψ pv ; otherwise, continue to step S312.
S312以适应度为依据,从种群Ψpv中挑选最优秀的染色体,替换生态系统中表示光伏电站建设方案的染色体,更新生态系统;Based on fitness, S312 selects the best chromosome from the population Ψ pv , replaces the chromosome representing the photovoltaic power station construction plan in the ecosystem, and updates the ecosystem;
S313判断是否到达最大进化代数,即判断进化代数索引g是否等于最大进化代数Gmax。若g=Gmax,若g=Gmax,则继续执行步骤S314;否则,以适应度为依据,分别对种群Ψev与Ψpv进行复制、交叉与变异操作,更新这两个种群,并跳转至步骤S306;S313 judges whether the maximum evolutionary algebra is reached, that is, judges whether the evolutionary algebra index g is equal to the maximum evolutionary algebra G max . If g=G max , if g=G max , continue to execute step S314; otherwise, based on the fitness, perform replication, crossover and mutation operations on the populations Ψ ev and Ψ pv respectively, update the two populations, and jump Go to step S306;
为提高求解效率,根据光伏电站与电动汽车充电网络随机协同规划模型的特点,分别设计用于种群Ψev和种群Ψpv的交叉操作算子与变异操作算子,In order to improve the solution efficiency, according to the characteristics of the stochastic collaborative programming model of photovoltaic power station and electric vehicle charging network, the crossover operator and mutation operator for population Ψ ev and population Ψ pv are designed respectively,
对种群Ψev来说,为确保交叉后的染色体满足公式(2)给出的等式约束,如图3所示,按如下步骤进行交叉操作:For the population Ψ ev , in order to ensure that the crossed chromosomes satisfy the equality constraints given by formula (2), as shown in Figure 3, the crossover operation is performed as follows:
S41从种群Ψev中随机选取两条染色体作为待交叉染色体。S42反复随机生成待选交叉位Ncan1,其中,1<Ncan1<Nch,直至找到可行交叉位Ncr1。以及S43以交叉概率Pc交换两条待交叉染色体中第Ncr1个码位后的码串,完成交叉操作。S41 randomly selects two chromosomes from the population Ψ ev as the chromosomes to be crossed. S42 repeatedly randomly generates candidate cross bits N can1 , where 1<N can1 <N ch , until a feasible cross bit N cr1 is found. And S43 exchanges the code string after the N cr1 th code point in the two chromosomes to be crossed with the crossover probability P c to complete the crossover operation.
对种群Ψpv来说,为确保交叉后的染色体满足公式(3)给出的等式约束,如图4所示,按如下步骤进行交叉操作:For the population Ψ pv , in order to ensure that the crossed chromosomes satisfy the equality constraints given by formula (3), as shown in Figure 4, the crossover operation is performed as follows:
S51从种群Ψpv中随机选取两条染色体作为待交叉染色体。S52反复随机生成待选交叉位Ncan2,其中,1<Ncan2<Npv,直至找到可行交叉位Ncr2。以及S53以交叉概率Pc交换两条待交叉染色体中第Ncr2个码位后的码串,完成交叉操作。S51 randomly selects two chromosomes from the population Ψ pv as the chromosomes to be crossed. S52 repeatedly randomly generates candidate cross bits N can2 , where 1<N can2 <N pv , until a feasible cross bit N cr2 is found. And S53 exchanges the code string after the N cr2 code point in the two chromosomes to be crossed with the crossover probability P c to complete the crossover operation.
如图5所示,种群Ψev变异操作算子包括如下步骤:As shown in Figure 5, the population Ψ ev mutation operator includes the following steps:
S61从种群Ψev中随机选取一条染色体作为待变异染色体。S62随机生成两个待变异码位Nmu1与Nmu2,其中,1<Nmu1<Nch,1<Nmu2<Nch,确保两个待变异码位的取值一个为“0”,一个为非“0”整数。以及S63以变异概率Pm同时对待变异位Nmu1与Nmu2进行变异操作,即取值为“0”的待变异位变异为不大于Qev的非“0”随机整数,取值非“0”的待变异位变异为“0”,完成变异操作。S61 randomly selects a chromosome from the population Ψ ev as the chromosome to be mutated. S62 randomly generates two to-be-mutated code bits N mu1 and N mu2 , where 1<N mu1 <N ch , 1<N mu2 <N ch , to ensure that one of the two to-be-mutated code bits is "0" and the other is an integer other than "0". And S63 performs mutation operation on the mutation bits N mu1 and N mu2 at the same time with the mutation probability P m , that is, the mutation bit whose value is "0" is mutated into a non-"0" random integer not greater than Q ev , and the value is not "0" ” is mutated to “0” to complete the mutation operation.
如图6所示,种群Ψpv变异操作算子包括如下步骤:As shown in Figure 6, the population Ψ pv mutation operator includes the following steps:
S71从种群Ψpv中随机选取一条染色体作为待变异染色体。S72随机生成两个待变异码位Nmu3与Nmu4,其中1<Nmu3<Npv,1<Nmu4<Npv,确保两个待变异码位的取值一个为“0”,一个为非“0”整数。以及S73以变异概率Pm同时对待变异位Nmu3与Nmu4进行变异操作,即取值为“0”的待变异位变异为不大于Qpv的非“0”随机整数,取值非“0”的待变异位变异为“0”,完成变异操作。S314对生态系统中分别表示电动汽车充电网络建设方案与光伏电站建设方案的两条染色体进行解码,作为光伏电站与电动汽车充电网络随机协同规划模型的最优解输出,结束算法流程。S71 randomly selects a chromosome from the population Ψ pv as the chromosome to be mutated. S72 randomly generates two to-be-mutated code bits N mu3 and N mu4 , where 1<N mu3 <N pv , 1<N mu4 <N pv , to ensure that one of the two to-be-mutated code bits is "0" and the other is Integer other than "0". And S73 performs mutation operation on the mutation bits N mu3 and N mu4 at the same time with the mutation probability P m , that is, the mutation bit whose value is "0" is mutated into a non-"0" random integer not greater than Q pv , and the value is not "0" ” is mutated to “0” to complete the mutation operation. S314 decodes the two chromosomes in the ecosystem representing the electric vehicle charging network construction scheme and the photovoltaic power station construction scheme respectively, and outputs the optimal solution of the photovoltaic power station and the electric vehicle charging network stochastic collaborative planning model, and ends the algorithm process.
以上所述仅为本发明的示例性实施例,并非因此限制本发明专利保护范围,凡是利用本发明说明书及附图内容所作的等效结构或等效流程变换,或直接或间接运用在其他相关的技术领域,均同理包括在本发明的专利保护范围内。The above descriptions are only exemplary embodiments of the present invention, and are not intended to limit the scope of the patent protection of the present invention. Any equivalent structure or equivalent process transformation made by using the contents of the description and drawings of the present invention, or directly or indirectly applied to other related The technical field of the present invention is similarly included in the scope of patent protection of the present invention.
Claims (5)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010927465.7A CN112036654B (en) | 2020-09-07 | 2020-09-07 | Photovoltaic power station and electric vehicle charging network planning method based on co-evolution |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010927465.7A CN112036654B (en) | 2020-09-07 | 2020-09-07 | Photovoltaic power station and electric vehicle charging network planning method based on co-evolution |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112036654A CN112036654A (en) | 2020-12-04 |
CN112036654B true CN112036654B (en) | 2022-10-14 |
Family
ID=73584908
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010927465.7A Active CN112036654B (en) | 2020-09-07 | 2020-09-07 | Photovoltaic power station and electric vehicle charging network planning method based on co-evolution |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112036654B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117391311B (en) * | 2023-12-07 | 2024-03-08 | 国网湖北省电力有限公司经济技术研究院 | Charging station and distribution network collaborative planning method and device taking into account carbon emissions and uncertainty |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105488593A (en) * | 2015-12-07 | 2016-04-13 | 嘉兴国电通新能源科技有限公司 | Constant capacity distributed power generation optimal site selection and capacity allocation method based on genetic algorithm |
CN107392350B (en) * | 2017-06-08 | 2021-08-13 | 国网宁夏电力公司电力科学研究院 | Comprehensive optimization method for distribution network expansion planning with distributed energy and charging stations |
US11455438B2 (en) * | 2018-02-01 | 2022-09-27 | Toyota Motor Engineering & Manufacturing North America, Inc. | Methods for topology optimization using a membership variable |
CN111626492B (en) * | 2020-05-22 | 2022-07-08 | 国网江苏省电力有限公司苏州供电分公司 | A fuzzy multi-objective opportunistic constrained programming method for electric vehicle charging network |
-
2020
- 2020-09-07 CN CN202010927465.7A patent/CN112036654B/en active Active
Also Published As
Publication number | Publication date |
---|---|
CN112036654A (en) | 2020-12-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112132427B (en) | A multi-level planning method of power grid considering the access of multiple resources on the user side | |
Zhou et al. | Game-theoretical energy management for energy internet with big data-based renewable power forecasting | |
Basu | Economic environmental dispatch of fixed head hydrothermal power systems using nondominated sorting genetic algorithm-II | |
CN108306298B (en) | A design method of flexible multi-state switch connected to distribution network | |
Hua et al. | Carbon emission flow based energy routing strategy in energy Internet | |
CN105488593A (en) | Constant capacity distributed power generation optimal site selection and capacity allocation method based on genetic algorithm | |
CN112036655B (en) | Opportunity constraint-based photovoltaic power station and electric vehicle charging network planning method | |
CN114580725A (en) | Distributed photovoltaic wiring multi-objective optimization method and device based on genetic algorithm | |
CN105069700A (en) | Layered and partitioned power distribution network frame programming method | |
Abedinia et al. | Synergizing efficient optimal energy hub design for multiple smart energy system players and electric vehicles | |
CN107959307A (en) | A kind of DG Optimal Configuration Methods of meter and power distribution network operation risk cost | |
CN110854891B (en) | Pre-disaster resource allocation method and system for distribution network | |
Xiao et al. | Coordinated planning for fast charging stations and distribution networks based on an improved flow capture location model | |
CN111626492B (en) | A fuzzy multi-objective opportunistic constrained programming method for electric vehicle charging network | |
CN109888817B (en) | Location deployment and capacity planning methods for PV plants and data centers | |
CN112734041A (en) | Opportunity constraint planning method for electric vehicle charging network considering random charging load | |
CN112036654B (en) | Photovoltaic power station and electric vehicle charging network planning method based on co-evolution | |
CN106295885A (en) | Active distribution network based on active management pattern associating planing method | |
CN115912330A (en) | A two-stage chance-constrained optimization method and system for an active distribution network topology evolution model | |
CN115271195A (en) | Power system multi-objective energy storage optimization method based on improved genetic algorithm | |
CN108734349A (en) | Distributed generation resource addressing constant volume optimization method based on improved adaptive GA-IAGA and system | |
CN117439195A (en) | A power dispatching method and system based on artificial intelligence | |
CN111881626A (en) | Power distribution network planning method for promoting DG consumption | |
CN116169704A (en) | An optimization method for electric vehicle charging stations based on multi-type distributed resources | |
CN117060400A (en) | Urban power distribution network toughness recovery method, system, equipment and medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
EE01 | Entry into force of recordation of patent licensing contract | ||
EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20201204 Assignee: Nantong suluda Intelligent Manufacturing Technology Co.,Ltd. Assignor: NANTONG University Contract record no.: X2023980052244 Denomination of invention: Collaborative Evolution Based Planning Method for Photovoltaic Power Stations and Electric Vehicle Charging Networks Granted publication date: 20221014 License type: Common License Record date: 20231214 |
|
TR01 | Transfer of patent right | ||
TR01 | Transfer of patent right |
Effective date of registration: 20240827 Address after: 6-1, 6th Floor, Building H, Zhigu Science and Technology Complex, No. 186 Yangzijiang Middle Road, Yangzhou Economic and Technological Development Zone, Jiangsu Province, 225000 RMB Patentee after: Jiangsu Youbeijia Intelligent Technology Co.,Ltd. Country or region after: China Address before: 226019 Jiangsu city of Nantong province sik Road No. 9 Patentee before: NANTONG University Country or region before: China |