论文来源:

Multi-objective Modified Grey Wolf Optimizer for ..._百度学术 http://xueshu.baidu.com/s?wd=Multi-Objective+Modified+Grey+Wolf+Optimizer+for+Optimal+Power+Flow&rsv_bp=0&tn=SE_baiduxueshu_c1gjeupa&rsv_spt=3&ie=utf-8&f=8&rsv_sug2=1&sc_f_para=sc_tasktype%3D%7BfirstSimpleSearch%7D

关于OPF的介绍的链接---东南大学

【图文】六、最优潮流汇总._百度文库 https://wenku.baidu.com/view/dafe8d4749d7c1c708a1284ac850ad02de8007ea.html

1. Optimal Power Flow:

https://baike.baidu.com/item/%E6%9C%80%E4%BC%98%E6%BD%AE%E6%B5%81/11003211?fr=aladdin

最优潮流 [1]  (Optimal Power Flow,OPF)是指当系统的结构参数和负荷情况都已给定时,调节可利用的控制变量(如发电机输出功率、可调变压器抽头等)来找到能满足所有运行约束条件的,并使系统的某一性能指标(如发电成本或网络损耗)达到最优值下的潮流分布。优潮流是一个典型的非线性优化问题,且由于约束的复杂性使得其训一算复杂,难度较大。虽然人们已经提出了许多种方法,并且在部分场合有所应用,但是要大规模实用化,满足电力系统的运行要求还有不少问题要解决。

潮流计算: 确定电网的电压和功率分布

实际电网中往往只知道负荷功率和供电节点的电压,怎样确定各点电压和功率??

2.OPF问题表述: 论文中和PPT中的,并不是电气 工程专业,所有有些纠结那个定义更好, 而且后续的内容只是看懂了一些参数设置的界限以及定义

下载了文档:      是真的不懂在干啥

3.GWO 算法 改进:

文中作者的论点是  灰狼算法中a是约束整个勘探阶段的,它的值也不应当是一个单纯的随机数,故而在文中提出了 这种概念:

但是我觉 的GWO算法在思想上的根据等级确定了三个最好的,三个最好的会同时的分布在不同的方向吗? 每个根据Agent中的三个最优的最为每一次的 更新方向,感觉没有依据可言啊。 三头狼都在一个方向上则均值也是在哪一个方向,没有更多的 多样性啊,觉的在使用的时候是不适合多目标的,而且很容易陷入局部最优,  我自是这么想,没有code 没有 依据

4. 多目标 优化句子

(1) Pareto Optimization is used to make a decision in a multiobjective problem, in which case there are no solution for enhancement any objective without sacrificing the others[33,34].
(2)In order to efficiently and effectively obtain the solution, the search for the best solution is executed in two stages. The
first stage, is to find a set of non-dominated solutions, and the second stage, is to obtain the best compromise solution

(3) 

(4)  dominance comparison strategy adopted for updating the archive: 1) In case the new solution obtained is
infeasible or dominated by other members in the population, the solution will not be saved into the repository. 2) If a
nondominated member in the population cannot be dominated by any solution in the current repository, the solution will be
saved into the repository. 3) Any dominated solution in the current repository by this nondominated member will be
removed from the repository.

最佳折中方案的模糊决策

(1)归一化:The fuzzy method has been implemented to normalize the objective functions which are not in the same range.
(2)MOAlgorithms utilizing the aforementioned objective functions, which does not give a single optimal solution, but rather a set of Pareto optimal solutions that cannot improve one objective without being unfair to the rest of objectives.

(3)  However, the requirement of the practical applications is to chose just one solution called best compromise solution (Utopia solution) which satisfy various optimization goals.

5. 多目标GWO算法-----学习的地方,学习人家如何的去表述

1. Representation of Solution.
                    a) Read the original data of power system and the control parameters of MOGWO shown in Table I.
                    b) Each search agents, are coded by real number and takes its positions (as a trial solution vector) to compose                                  OPF control variables as in Eq.(5)

  2. Initialization

The first search agent takes its positions randomly using sets of uniform random number distribution ranging within  the
range of the boundaries as in the following equation: 

3.  Start the improvision . set  iteration = 0

4.  Power Flow solution 

During iterations, for each wolf, the full Newton-Raphson (NR) power flow analysis is performed to evaluate the objective
function .

5. Non-dominate solutions based on Pareto strategy

a) Calculate the value of objective functions using Eqs. (26,27) based on the results of the NR power flow calculations.
             b) The Pareto method as in Eqs.(37,38) is applied to obtain all non-dominated solutions which are stored in the Paret                     set repository.
 6. Best compromise solution based Fuzzy Decision-Making.
             a) Utilize Eq. (39) to convert each objective function value into corresponding fuzzy membership function values.
             b) Choose the weight factor ߱௜ for all non-dominated solutions and sort μ୩ in Eq.(40) from the largest to the smallest.
           The best compromise solution is that having the highest cardinal priority ranking.
 7. Update the contents of the Pareto-set in each iteration.
           That is done by inserting all the currently non-dominated positions into the repository. Any dominated positions from the
repository are eliminated in the process.
8. Save the first three best the global solutions obtained so far from the pareto-set.
9. In line with “winner-take-all” rule for the leader's wolf[39],

alpha wolves take the best global compromise solution with highest rank, while beta and delta wolves will take the
second and third one.

10. Encircling prey: grey wolves encircle prey during the hunt using Eqs.(29-32, 36)
11. Hunting: oblige the omegas search agents to update their values according to the position of the leaders search
agents using Eqs.(33-35).
12. Verify the boundary limits.
If there are any violations in the inequality constraints, then the position of the responsible wolf will be fixed using Eq.(28).
13. Stop the process: If the maximum number of iterations is satisfied then go to Step 14, else go back to step 4.
14. Attacking prey: The hunting process of grey wolves will be stopped when the prey stops. Then the final Pareto-optimal
set from the repository is available.

6. 图表实验:

自己觉得有借鉴的:

[33] S. M. Mazhari, H. Monsef, R. Romero, “A Multi-Objective Distribution System Expansion Planning Incorporating Customer Choices on Reliability”, IEEE Trans. Power Syst., vol. 31, no. 2, pp. 1330–1340, 2016.DOI: 10.1109/TPWRS.2015.2430278
[34] Paterakis et al., “Multi-objective reconfiguration of radial distribution systems using reliability indices”, IEEE Trans. Power Syst., vol. 31, no. 2, pp. 1048–1062, 2016. DOI: 10.1109/TPWRS.2015.2425801

论文:Multi-Objective Modified Grey Wolf Optimizer for Optimal Power Flow-最优潮流相关推荐

  1. 灰狼优化算法(Grey Wolf Optimizer, GWO)

    灰狼优化算法(Grey Wolf Optimizer, GWO) 由澳大利亚格里菲斯大学(Griffith University)研究学者 Seyedali Mirjalili 于 2014 年提出, ...

  2. 灰狼优化算法(Grey Wolf Optimizer,GWO)

    灰狼优化算法(Grey Wolf Optimizer,GWO) 一.算法灵感 二.算法介绍 2.1 初始化 2.2 搜寻猎物(探索阶段) 2.3 开发阶段 2.3.1 围捕猎物 2.3.2 攻击猎物 ...

  3. (源码)群体智能优化算法之灰狼优化(Grey Wolf Optimizer,GWO)

    获取更多资讯,赶快关注上面的公众号吧! 文章目录 第三十三章 灰狼优化(Grey Wolf Optimizer,GWO) 启发 数学模型和算法 社会等级 包围捕食 狩猎 攻击猎物(利用) 搜索猎物(探 ...

  4. 2018-3-25论文(Grey Wolf Optimizer )以及(The Whale Optimizer Algorithm)笔记一 -----作者网站+两论文摘要比对比

    论文来源: Seyedali Mirjalili http://www.alimirjalili.com/Projects.html 这两篇论文都是该作者发的分别是2016(WOA鲸鱼优化算法)和20 ...

  5. 2018-3-25论文(Grey Wolf Optimizer)自然界狼群的生活等级

    文章来源: 狼的社会等级_论文_百度文库 https://wenku.baidu.com/view/0cef5ae0551810a6f52486ee.html?rec_flag=default& ...

  6. 2018-3-24论文(Grey Wolf Optimizer)note1----------No Free Lunch Theorem

    就像我们中小学学习函数的时候,老师总会给我们说一句: "一定要把定义域写上,不写不给分,不写定义域谁知道是那种情况" 类比到算法中也是如此,也就是今天的NFL理论: <机器学 ...

  7. A Modified Particle Swarm Optimizer

    1. 改进的PSO算法 如果要了解这篇期刊,得首先了解Particle swarm optimization(粒子群优化算法),参见博客:Particle Swarm Optimization.而本篇 ...

  8. 改进的大猩猩部队优化算法(Modified Gorilla Troops Optimizer,MGTO)(原文作者)

    改进的大猩猩部队优化算法(Modified Gorilla Troops Optimizer,MGTO)(原文作者) 一.算法灵感 二.算法介绍 2. 1 初始化 2. 2 探索阶段 2. 3 开发阶 ...

  9. 论文阅读:RAFT: Recurrent All-Pairs Field Transforms for Optical Flow

    文章目录 1. 论文总述 2. RAFT结构被传统算法所启发 3. RAFT的三个重大创新点 4. 光流算法需要解决的难点 5. 传统光流算法简介及缺点 6. Fast DIS 有可能存在的问题 7. ...

最新文章

  1. linux启动数据库orl,linux5.4下oracle问题
  2. html5--3.2 input元素(1)
  3. Binding(三):资源和ValueConverter
  4. guid会重复吗_知网查重会查重表格吗
  5. 解决6410 WINCE6 应用层调用SetSystemPowerState api关机无效的问题
  6. 如何快速查找下载java项目所需jar包
  7. oracle 空值的排序问题 (转载),sqlserver、oracle数据库排序空值null问题解决办法
  8. 马斯克:不要把员工变成“螺丝钉”
  9. MC新手入门(十三)------ 添加游戏角色
  10. Java内存模型 - 同步八种操作
  11. gogs 把用户加入团队
  12. 【黑马程序员西安中心】一个内向青年的转变
  13. android 根据基站测距,无线测距基站
  14. clustream java_数据流聚类算法
  15. excel数据分类与自动填充
  16. 蓝牙耳机什么牌子好?安卓蓝牙耳机性价比推荐
  17. Interpolator插值器
  18. 3. Python控制结构
  19. warning:iteration 7 invokes undefined behavior
  20. 生日提醒神器,拯救你的七秒金鱼记忆。

热门文章

  1. Java -- JDBC 学习--批量处理
  2. 【GoLang】深入理解slice len cap什么算法? 参数传递有啥蹊跷?
  3. linux系统中指定端口连接数限制
  4. 给博客增加了一个主题Nautica02Liquid
  5. CV05-ResNet笔记
  6. 是什么限制了区块链技术的应用?
  7. PAT(甲级)2018年冬季考试 7-4 Heap Paths(非递归与递归解法)
  8. (C++)除基取余法:将十进制数转化为Q进制数
  9. (C++)1031 查验身份证 3难点+3注意点
  10. php的遍历方法,PHP数组遍历方法总结