登录
首页 » matlab » 6_MultDGPlacOptimizationImperiCompAlgo

6_MultDGPlacOptimizationImperiCompAlgo

于 2020-11-23 发布 文件大小:65KB
0 207
下载积分: 1 下载次数: 89
我要下载

代码说明：

  Multiple DG Placement optimization in 33-bus and 69-bus distribution power systems in 2 different bus using Imperialistic Competition algorithm

文件列表：

Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\AssimilateColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\BenchmarkFunction.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\BFPF69.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\BWFW33.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\CreateInitialEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\DisplayEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\GenerateNewCountry.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\hs_err_pid6316.log
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\ImperialisticCompetition.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\ImperialisticCompetition.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\Main_ImperialistCompetitveAlgorithm.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\Main_ImperialistCompetitveAlgorithm.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\myrandint.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\plants.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\plants.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\PossesEmpire.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\RandInt.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\RevolveColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1\UniteSimilarEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\AssimilateColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\BenchmarkFunction.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\BFPF69.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\BWFWS69.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\CreateInitialEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\DisplayEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\GenerateNewCountry.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\ImperialisticCompetition.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\ImperialisticCompetition.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\Main_ImperialistCompetitveAlgorithm.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\Main_ImperialistCompetitveAlgorithm.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\myrandint.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\plants.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\plants.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\PossesEmpire.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\RandInt.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\RevolveColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1\UniteSimilarEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\AssimilateColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\BenchmarkFunction.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\BFPF69.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\BWFWS69.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\CreateInitialEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\DisplayEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\GenerateNewCountry.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\ImperialisticCompetition.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\ImperialisticCompetition.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\Main_ImperialistCompetitveAlgorithm.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\Main_ImperialistCompetitveAlgorithm.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\myrandint.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\plants.asv
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\plants.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\PossesEmpire.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\RandInt.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\RevolveColonies.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5\UniteSimilarEmpires.m
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\33bus-2DG-1
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm\69bus-2DG-1.5
Multiple_DG_Placement_optimization_Imperialistic_Competition_algorithm

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • Henon
    用来画荷农吸引子 离散系统的相轨迹图 二维系统(Farmers used to draw charge attractor the phase trajectories of discrete two-dimensional systems)
    2010-11-10 10:51:30下载
    积分：1
  • Gry_UKF
    UKF仿真例子，对于初学着很实用，是个很好的学习例子(UKF simulation example, very useful for the beginner, is a good example of learning)
    2014-12-15 12:26:15下载
    积分：1
  • pac
    Matlab Toolbox for Estimating Phase-Amplitude Coupling
    2021-01-22 14:48:41下载
    积分：1
  • -wavefront
    波前曲扭和幅度变化对阵列测向中相干源分辨的影响(Twisted and curved wavefront amplitude variation to distinguish the impact of coherent source direction finding in an array)
    2013-12-26 12:54:01下载
    积分：1
  • InterferogramPhaseShift
    说明：  干涉仪相位分析程序，可用来提取干涉条纹移动的相位信息(interferometer phase analysis program that can be used to extract the interference fringes mobile phase information)
    2006-02-27 16:22:11下载
    积分：1
  • filter_prj
    微带天线滤波器设计 北邮微波电子学实验内容ADS 个人想法非答案 (Microstrip antenna filter design BUPT microwave electronics experimental content ADS non-answer personal thoughts)
    2014-02-17 15:16:06下载
    积分：1
  • GA---matlab
    通过matlab来实现遗传算法，利用遗传算法程序和遗传算法工具箱来实现该功能，具体应用效果很好(Matlab achieved through the genetic algorithm, the procedure using the genetic algorithm and genetic algorithm toolbox to achieve the function of specific application of effective)
    2009-04-11 15:41:28下载
    积分：1
  • 层次分析法matlab程序及说明书
    说明：  层次分析法matlab程序及说明书，是指将与决策总是有关的元素分解成目标、准则、方案等层次，在此基础之上进行定性和定量分析的决策方法。(Analytic hierarchy process (AHP) matlab program and specification is a decision-making method that decomposes the elements related to decision-making into objectives, criteria, schemes and other levels, and carries out qualitative and quantitative analysis on this basis.)
    2020-10-17 14:43:43下载
    积分：1
  • ford-max-flow
    解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。(Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.)
    2013-08-23 23:18:43下载
    积分：1
  • fwdgnssreports
    You well get all details about project and microcontroller
    2014-11-08 13:37:24下载
    积分：1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！