CN108491922A - Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm - Google Patents

Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm Download PDF

Info

Publication number
CN108491922A
CN108491922A CN201810234451.XA CN201810234451A CN108491922A CN 108491922 A CN108491922 A CN 108491922A CN 201810234451 A CN201810234451 A CN 201810234451A CN 108491922 A CN108491922 A CN 108491922A
Authority
CN
China
Prior art keywords
teaching
algorithm
individual
new
old
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.)
Pending
Application number
CN201810234451.XA
Other languages
Chinese (zh)
Inventor
董萍
吴华仪
吴光辉
刘明波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Heng Chuang Zhitong Information Technology Co Ltd
Guangzhou Micronet Zhiyuan Technology Co Ltd
South China University of Technology SCUT
Original Assignee
Guangzhou Heng Chuang Zhitong Information Technology Co Ltd
Guangzhou Micronet Zhiyuan Technology Co Ltd
South China University of Technology SCUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Heng Chuang Zhitong Information Technology Co Ltd, Guangzhou Micronet Zhiyuan Technology Co Ltd, South China University of Technology SCUT filed Critical Guangzhou Heng Chuang Zhitong Information Technology Co Ltd
Priority to CN201810234451.XA priority Critical patent/CN108491922A/en
Publication of CN108491922A publication Critical patent/CN108491922A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/004Artificial life, i.e. computing arrangements simulating life
    • G06N3/006Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06Energy or water supply

Landscapes

  • Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Biophysics (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Biomedical Technology (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses the active distribution network Intelligent Hybrid reconstructing methods based on teaching and particle cluster algorithm, using loss minimization as Optimization goal.Including:Random initializtion population;Calculate the fitness function of each particle;The position and speed of each particle is updated using particle cluster algorithm;Teaching algorithm is recycled to be updated the position of each particle;It seeks the fitness function of each population and excludes infeasible solution;The optimal solution and globally optimal solution for updating population, until reaching maximum iteration.This method needle is in connection by teaching algorithm and particle cluster algorithm, while retaining particle cluster algorithm global optimizing ability, the local optimal searching ability and speed of algorithm is enhanced, to realize algorithm in global and local optimizing ability.The present invention updates network structure by optimization algorithm iteration, plays the role of reducing network loss.

Description

Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm
Technical field
The present invention relates to the active distribution network Intelligent Hybrid reconstructing methods based on teaching and particle cluster algorithm.
Background technology
Power distribution network reconfiguration is exactly the assembled state by changing block switch, interconnection switch, to change network topology structure With the supply path of user.Current derivation algorithm can be divided into traditional mathematics algorithm, heuritic approach and intelligent algorithm Deng.Wherein, the calculating time of mathematical algorithm is long;Heuritic approach is influenced to compare by the original state and network size of network Greatly, differ and surely obtain optimal solution;Intelligent algorithm is not influenced by network initial state, but the convergence of some algorithms Speed is slow, is easily trapped into local optimum, to influence the efficiency and accuracy of power distribution network reconfiguration.
Particle cluster algorithm (Particle Swarm Optimization, PSO) and teaching algorithm (Teaching Learning Based optimization, TLBO) it is all based on the optimisation technique of swarm intelligence.Particle cluster algorithm utilizes bird The foraging behavior of group is by the information sharing of group, to seek the optimal solution in global space.It imparts knowledge to students on one classroom of algorithm simulation Interaction between student and the interaction and student of teacher mutually adjusts the optimal solution for seeking small range space between individual.
Invention content
It is an object of the invention to overcome the shortcomings of existing intelligent algorithm, a kind of combining with teaching algorithm and particle are proposed The hybrid algorithm of group's algorithm can be searched while retaining particle cluster algorithm ability of searching optimum using the part of teaching algorithm Suo Nengli improves the algorithm of convergence rate, to improve the efficiency and accuracy of power distribution network reconfiguration.
To achieve the above object, the technical solution adopted by the present invention is that:
Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm, which is characterized in that the method Including:
Step 1:The initial parameter of teaching algorithm and particle cluster algorithm, random initializtion population are set;
Step 2:Each particle is used and is searched for based on depth-first tree, topological analysis is carried out;
Step 3:The target function value for meeting irradiation structure constraint individual is calculated using object function, as fitness letter Number;
Step 4:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 5:Iteration is updated to population using particle cluster algorithm and teaching algorithm, checks network topology, and calculate The object function of individual;
Step 6:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 7:Step 5-6 is repeated until reaching maximum iteration;
Step 8:Export result.
Specifically, in step 3, to minimize network loss as object function:
Wherein, NbranchFor the quantity of network edge;IbFor the electric current of b branches;RbFor the resistance of b branches;kbFor opening for branch b Off status is worth and indicates that switch is closed for 1, is worth and indicates that switch disconnects for 0.
In steps of 5, the iterative formula of particle cluster algorithm is:
In formula,It is the speed of particle;It is the position of particle;It is individual optimal value array;It is global optimum Value;Nsw is the number of individuals of each iteration;c1And c2For accelerated factor;ρ is coefficient;r1And r2Respectively in (0,1) section with Machine number.
In steps of 5, the teaching algorithm is divided into teaching phase and study stage;Population is carried out more using teaching algorithm Newly the process of iteration is:
Teaching phase
In teaching phase, iteration, selects the individual of a target function value minimum as " old in group each time Teacher ", other individuals are close to its, and iterative step is as follows:
TF=round [1+ri]
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold, XnewNew generated for teaching phase Body; XoldFor original individual
In formula, TFIt is a factor, can use 1 or 2;For preferably individual;riFor for the random number in (0,1) section;Mi For the mean value of individual;
The study stage
In the study stage, individual improves itself by learning from each other, and iterative step is as follows:
For i=1:nsw
Randomly choose XjAnd i ≠ j
If f (Xi)<f(Xj)
XNew, i=Xold,i+ri(Xi-Xj)
Otherwise
XNew, i=Xold,i+ri(Xj–Xi)
end
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold;
In formula, riRandom number between being 0 to 1, XnewThe new individual generated for the study stage;XoldFor original individual. Compared with prior art, the present invention advantage is:
This method needle is in connection by teaching algorithm and particle cluster algorithm, is retaining particle cluster algorithm global optimizing ability Meanwhile the local optimal searching ability and speed of algorithm are enhanced, to realize algorithm in global and local optimizing ability.The present invention Network structure is updated by optimization algorithm iteration, plays the role of reducing network loss, to improve the efficiency of power distribution network reconfiguration and accurate Property.
Description of the drawings
Fig. 1 is the active distribution network Intelligent Hybrid reconstruct side provided in an embodiment of the present invention based on teaching and particle cluster algorithm The flow chart of method.
Specific implementation mode
Present disclosure is described in further details with reference to the accompanying drawings and detailed description.
Embodiment:
As shown in fig.1, for the active distribution network intelligence provided in an embodiment of the present invention based on teaching and particle cluster algorithm The flow chart of reconstructing method is mixed, this method specifically includes following steps:
Step 1:The initial parameter of teaching algorithm and particle cluster algorithm, random initializtion population are set;
Step 2:Each particle is used and is searched for based on depth-first tree, topological analysis is carried out;Wherein, which is Hope's Crow Fu Te raises " Depth-First-Search " of proposition with Robert's tower;
Step 3:The target function value that each individual is calculated using object function, as fitness function value;
To minimize network loss as object function:
Wherein, NbranchFor the quantity of network edge;IbFor the electric current of b branches;RbFor the resistance of b branches;kbFor opening for branch b Off status is worth and indicates that switch is closed for 1, is worth and indicates that switch disconnects for 0.
Certainly, object function will meet maximum current constraint, maximum voltage constraint, trend constraint and radiativity network simultaneously The constraint of structure.
Step 4:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 5:Individual is updated using particle cluster algorithm, checks network topology, and calculates the object function of individual; The step of particle cluster algorithm, is as follows:
In formula,It is the speed of particle;It is the position of particle;It is individual optimal value array;Be it is global most The figure of merit;Nsw is the number of individuals of each iteration, c1And c2For accelerated factor;In particle cluster algorithm, the position of particleAnd speed DegreeIt is a particle coding;ρ is coefficient, generally 1;r1And r2Random number respectively in (0,1) section.
Step 6:Using teaching algorithm individual is updated, check network topology, and calculate individual object function and Fitness function;
In algorithm of imparting knowledge to students, it is divided into teaching phase and study stage.Teaching algorithm iteration formula and iterative step are:
Teaching phase
In teaching phase, iteration, selects best (target function value is a minimum) individual to make in group each time For " teacher ", other individuals are close to its, and iterative step is as follows:
TF=round [1+ri]
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold
In formula, TFIt is a factor, can use 1 or 2.
The study stage
In the study stage, individual improves itself by learning from each other, and iterative step is as follows:
For i=1:nsw
Randomly choose XjAnd i ≠ j
If f (Xi)<f(Xj)
XNew, i=Xold,i+ri(Xi-Xj)
Otherwise
XNew, i=Xold,i+ri(Xj–Xi)
end
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold
In formula, riRandom number between being 0 to 1.
Wherein, it should be noted that the iteration sequence of two kinds of algorithms of step 5 and step 6 is commutative, that is to say, that step 5 There is no sequencings between the two with step 6.
Step 7:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 8:Step 5-7 is repeated until reaching maximum iteration;
Step 9:Export result.
It follows that this method needle will impart knowledge to students, algorithm and particle cluster algorithm are in connection, global retaining particle cluster algorithm While optimizing ability, the local optimal searching ability and speed of algorithm are enhanced, to realize algorithm in global and local optimizing energy Power.The present invention updates network structure by optimization algorithm iteration, plays the role of reducing network loss.
Above-described embodiment simply to illustrate that the present invention technical concepts and features, it is in the art the purpose is to be to allow Those of ordinary skill cans understand the content of the present invention and implement it accordingly, and it is not intended to limit the scope of the present invention.It is all It is the equivalent changes or modifications made according to the essence of the content of present invention, should all covers within the scope of the present invention.

Claims (5)

1. the active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm, which is characterized in that the method packet It includes:
Step 1:The initial parameter of teaching algorithm and particle cluster algorithm, random initializtion population are set;
Step 2:Each particle is used and is searched for based on depth-first tree, topological analysis is carried out;
Step 3:The target function value for meeting irradiation structure constraint individual is calculated using object function, as fitness function;
Step 4:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 5:Iteration is updated to population using particle cluster algorithm and teaching algorithm, checks network topology, and calculate individual Object function;
Step 6:The optimal solution P of the corresponding individual of updateiWith globally optimal solution Pg
Step 7:Step 5-6 is repeated until reaching maximum iteration;
Step 8:Export result.
2. the active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm as described in claim 1, feature It is,
In step 3, to minimize network loss as object function:
Wherein, NbranchFor the quantity of network edge;IbFor the electric current of b branches;RbFor the resistance of b branches;kbFor the switch shape of branch b State is worth and indicates that switch is closed for 1, is worth and indicates that switch disconnects for 0.
3. the active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm as described in claim 1, feature It is, in steps of 5, the iterative formula of particle cluster algorithm is:
In formula, Veli kIt is the speed of particle;Xi kIt is the position of particle;Pi kIt is individual optimal value array;Pg kIt is global optimum; Nsw is the number of individuals of each iteration;c1And c2For accelerated factor;ρ is coefficient;r1And r2It is respectively random in (0,1) section Number.
4. the active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm as described in claim 1, feature It is, in steps of 5, the teaching algorithm is divided into teaching phase and study stage;Population is updated using teaching algorithm The process of iteration is:
Teaching phase
In teaching phase, iteration each time, the individual for selecting a target function value minimum in group as " teacher ", His individual is close to its, and iterative step is as follows:
TF=round [1+ri]
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold, XnewThe new individual generated for teaching phase;Xold For original individual
In formula, TFIt is a factor, can use 1 or 2;For preferably individual;riFor for the random number in (0,1) section;MiIt is a The mean value of body;
The study stage
In the study stage, individual improves itself by learning from each other, and iterative step is as follows:
For i=1:nsw
Randomly choose XjAnd i ≠ j
If f (Xi)<f(Xj)
XNew, i=Xold,i+ri(Xi-Xj)
Otherwise
XNew, i=Xold,i+ri(Xj–Xi)
end
If f (Xnew)<f(Xold), use XnewInstead of Xold, no side Xnew=Xold;
In formula, riRandom number between being 0 to 1, XnewThe new individual generated for the study stage;XoldFor original individual.
5. the active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm as claimed in claim 2, feature Be, the object function to meet maximum current constraint, maximum voltage constraint, trend constraint and radiativity network structure pact Beam.
CN201810234451.XA 2018-03-21 2018-03-21 Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm Pending CN108491922A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810234451.XA CN108491922A (en) 2018-03-21 2018-03-21 Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810234451.XA CN108491922A (en) 2018-03-21 2018-03-21 Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm

Publications (1)

Publication Number Publication Date
CN108491922A true CN108491922A (en) 2018-09-04

Family

ID=63318904

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810234451.XA Pending CN108491922A (en) 2018-03-21 2018-03-21 Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm

Country Status (1)

Country Link
CN (1) CN108491922A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109685279A (en) * 2018-12-29 2019-04-26 广东电网有限责任公司清远英德供电局 A kind of Complicated Distribution Network PQM optimization method based on topology degradation
CN109754128A (en) * 2019-02-18 2019-05-14 东北电力大学 A kind of wind/light/storage/bavin micro-capacitance sensor Optimal Configuration Method of meter and meteorological wave characteristic difference typical scene
CN111598294A (en) * 2020-04-13 2020-08-28 国网江西省电力有限公司电力科学研究院 Active power distribution network reconstruction algorithm and device based on improved teaching optimization
CN111932012A (en) * 2020-08-12 2020-11-13 国网黑龙江省电力有限公司哈尔滨供电公司 Energy storage system-distributed power supply-capacitor comprehensive control reactive power optimization method
CN112803404A (en) * 2021-02-25 2021-05-14 国网河北省电力有限公司经济技术研究院 Self-healing reconstruction planning method and device for power distribution network and terminal
CN113033100A (en) * 2021-03-29 2021-06-25 重庆大学 Cloud manufacturing service combination method based on hybrid teaching optimization algorithm

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102799950A (en) * 2012-07-03 2012-11-28 大连海事大学 Ship power grid reconfiguration optimizing method based on particle swarm algorithm
CN104200276A (en) * 2014-07-14 2014-12-10 河海大学 Intelligent power distribution network reconstructing method based on characteristic load injection
CN105184383A (en) * 2015-07-15 2015-12-23 浙江工业大学 Urban mobile emergency power supply optimal scheduling method based on intelligent optimization method
CN105552892A (en) * 2015-12-28 2016-05-04 国网上海市电力公司 Distribution network reconfiguration method
US9336480B1 (en) * 2004-08-14 2016-05-10 Hrl Laboratories, Llc Self-aware swarms for optimization applications
CN105809265A (en) * 2014-12-29 2016-07-27 国家电网公司 Capacity configuration method of power distribution network flexible interconnection device comprising distributed renewable energy sources
CN106611231A (en) * 2016-01-08 2017-05-03 四川用联信息技术有限公司 Hybrid particle swarm tabu search algorithm for solving job-shop scheduling problem
CN106779254A (en) * 2017-03-13 2017-05-31 湖南城市学院 A kind of charging station planing method containing distributed power source

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9336480B1 (en) * 2004-08-14 2016-05-10 Hrl Laboratories, Llc Self-aware swarms for optimization applications
CN102799950A (en) * 2012-07-03 2012-11-28 大连海事大学 Ship power grid reconfiguration optimizing method based on particle swarm algorithm
CN104200276A (en) * 2014-07-14 2014-12-10 河海大学 Intelligent power distribution network reconstructing method based on characteristic load injection
CN105809265A (en) * 2014-12-29 2016-07-27 国家电网公司 Capacity configuration method of power distribution network flexible interconnection device comprising distributed renewable energy sources
CN105184383A (en) * 2015-07-15 2015-12-23 浙江工业大学 Urban mobile emergency power supply optimal scheduling method based on intelligent optimization method
CN105552892A (en) * 2015-12-28 2016-05-04 国网上海市电力公司 Distribution network reconfiguration method
CN106611231A (en) * 2016-01-08 2017-05-03 四川用联信息技术有限公司 Hybrid particle swarm tabu search algorithm for solving job-shop scheduling problem
CN106779254A (en) * 2017-03-13 2017-05-31 湖南城市学院 A kind of charging station planing method containing distributed power source

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
杨鹏: "融合简化粒子群的教与学优化算法", 《计算机科学》 *
梁俊文,等: "主动配电网分布式无功优化控制方法", 《电网技术》 *
肖丽,等: "一种结合自适应局部搜索的粒子群优化算法", 《计算机科学》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109685279A (en) * 2018-12-29 2019-04-26 广东电网有限责任公司清远英德供电局 A kind of Complicated Distribution Network PQM optimization method based on topology degradation
CN109685279B (en) * 2018-12-29 2021-04-02 广东电网有限责任公司清远英德供电局 Complex power distribution network PQM optimization method based on topology degradation
CN109754128A (en) * 2019-02-18 2019-05-14 东北电力大学 A kind of wind/light/storage/bavin micro-capacitance sensor Optimal Configuration Method of meter and meteorological wave characteristic difference typical scene
CN111598294A (en) * 2020-04-13 2020-08-28 国网江西省电力有限公司电力科学研究院 Active power distribution network reconstruction algorithm and device based on improved teaching optimization
CN111932012A (en) * 2020-08-12 2020-11-13 国网黑龙江省电力有限公司哈尔滨供电公司 Energy storage system-distributed power supply-capacitor comprehensive control reactive power optimization method
CN111932012B (en) * 2020-08-12 2023-07-28 国网黑龙江省电力有限公司哈尔滨供电公司 Energy storage system-distributed power supply-capacitor integrated control reactive power optimization method
CN112803404A (en) * 2021-02-25 2021-05-14 国网河北省电力有限公司经济技术研究院 Self-healing reconstruction planning method and device for power distribution network and terminal
CN112803404B (en) * 2021-02-25 2023-03-14 国网河北省电力有限公司经济技术研究院 Self-healing reconstruction planning method and device for power distribution network and terminal
CN113033100A (en) * 2021-03-29 2021-06-25 重庆大学 Cloud manufacturing service combination method based on hybrid teaching optimization algorithm

Similar Documents

Publication Publication Date Title
CN108491922A (en) Active distribution network Intelligent Hybrid reconstructing method based on teaching and particle cluster algorithm
CN110348048B (en) Power distribution network optimization reconstruction method based on consideration of heat island effect load prediction
CN104734153A (en) Method of reconstructing power distribution network containing distributed power supply
CN104200096B (en) Arrester grading ring optimization based on differential evolution algorithm and BP neural network
CN109932903A (en) The air-blower control Multipurpose Optimal Method of more parent optimization networks and genetic algorithm
CN106022463A (en) Personalized learning path optimization method based on improved particle swarm optimization algorithm
Abdelaziz Genetic algorithm-based power transmission expansion planning
CN105701568B (en) A kind of didactic distribution network status estimation adjustment location fast Optimization
CN111463778A (en) Active power distribution network optimization reconstruction method based on improved suburb optimization algorithm
CN106033887A (en) Power distribution network reconstruction method based on improved PSO-DE hybrid algorithm
CN110444022A (en) The construction method and device of traffic flow data analysis model
CN112149264A (en) Active power distribution network planning method based on improved Harris eagle optimization algorithm
CN108832615A (en) A kind of reconstruction method of power distribution network and system based on improvement binary particle swarm algorithm
Abdelaziz et al. Reconfiguration of distribution systems with distributed generators using Ant Colony Optimization and Harmony Search algorithms
CN108537369A (en) Improvement population algorithm for distribution network reconfiguration based on local search
Dong et al. Combination of genetic algorithm and ant colony algorithm for distribution network planning
CN112787331B (en) Deep reinforcement learning-based automatic power flow convergence adjusting method and system
Sheng et al. Quantum-behaved particle swarm optimization with novel adaptive strategies
Luo et al. Modified shuffled frog leaping algorithm based on new searching strategy
Zhang et al. Optimization of neural network based on genetic algorithm and BP
Ahmad et al. A novel adaptive learning path method
Xiao et al. MSAO: A multi-strategy boosted snow ablation optimizer for global optimization and real-world engineering applications
CN107609632A (en) Power distribution network reconfiguration Optimal Operation Analysis method and device
CN111525577B (en) Distant view 220kV power grid networking method and system based on neural network
CN114094574A (en) Power distribution network optimization reconstruction method based on non-cooperative game

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180904

RJ01 Rejection of invention patent application after publication