登录
首页 » matlab » NSGA214jdian

NSGA214jdian

于 2020-06-01 发布
0 304
下载积分: 1 下载次数: 3

代码说明:

说明:  考虑环境因素的多目标优化方法,采用传统的遗传算法,同时考虑环境和经济性,考虑帕累托策略。(The multi-objective optimization method considering the environmental factors, using the traditional genetic algorithm, while considering the environment and economy, considering the Pareto strategy.)

文件列表:

NSGA214jdian\0.33.fig, 1693 , 2016-04-08
NSGA214jdian\1.txt, 132 , 2016-04-08
NSGA214jdian\118.fig, 11849 , 2016-04-08
NSGA214jdian\14(1).fig, 12487 , 2016-04-08
NSGA214jdian\14.fig, 14047 , 2016-04-08
NSGA214jdian\30.fig, 10509 , 2016-04-08
NSGA214jdian\57.fig, 10788 , 2016-04-08
NSGA214jdian\add_userfcn.m, 4580 , 2016-04-08
NSGA214jdian\bpmpd_qp.m, 7090 , 2016-04-08
NSGA214jdian\bustypes.m, 1922 , 2016-04-08
NSGA214jdian\case118.asv, 32646 , 2016-04-08
NSGA214jdian\case118.m, 32640 , 2016-04-08
NSGA214jdian\case14.asv, 4528 , 2016-04-08
NSGA214jdian\case14.m, 4640 , 2016-04-08
NSGA214jdian\case2383wp.m, 340801 , 2016-04-08
NSGA214jdian\case24_ieee_rts.m, 8714 , 2016-04-08
NSGA214jdian\case2736sp.m, 717643 , 2016-04-08
NSGA214jdian\case2737sop.m, 715227 , 2016-04-08
NSGA214jdian\case2746wop.m, 732905 , 2016-04-08
NSGA214jdian\case2746wp.m, 736281 , 2016-04-08
NSGA214jdian\case30.asv, 5127 , 2016-04-08
NSGA214jdian\case30.m, 5664 , 2016-04-08
NSGA214jdian\case300.m, 68088 , 2016-04-08
NSGA214jdian\case30a.m, 5664 , 2016-04-08
NSGA214jdian\case30pwl.m, 4514 , 2016-04-08
NSGA214jdian\case30Q.m, 4547 , 2016-04-08
NSGA214jdian\case39.m, 9726 , 2016-04-08
NSGA214jdian\case4gs.m, 1340 , 2016-04-08
NSGA214jdian\case57.m, 13228 , 2016-04-08
NSGA214jdian\case6ww.m, 2042 , 2016-04-08
NSGA214jdian\case9.m, 1930 , 2016-04-08
NSGA214jdian\case9Q.m, 2022 , 2016-04-08
NSGA214jdian\caseformat.m, 6790 , 2016-04-08
NSGA214jdian\casejy.asv, 35351 , 2016-04-08
NSGA214jdian\casejy.m, 33315 , 2016-04-08
NSGA214jdian\casejy1.m, 33263 , 2016-04-08
NSGA214jdian\casejy2.asv, 33319 , 2016-04-08
NSGA214jdian\casejy2.m, 33319 , 2016-04-08
NSGA214jdian\casejy3.m, 33444 , 2016-04-08
NSGA214jdian\casejy4.m, 33305 , 2016-04-08
NSGA214jdian\casejyxd.asv, 33582 , 2016-04-08
NSGA214jdian\casejyxd.m, 33582 , 2016-04-08
NSGA214jdian\casejyxd2.asv, 33506 , 2016-04-08
NSGA214jdian\casejyxd2.m, 33499 , 2016-04-08
NSGA214jdian\casejyxd3.m, 33256 , 2016-04-08
NSGA214jdian\casejyxd4.m, 33627 , 2016-04-08
NSGA214jdian\casejyxd5.m, 33509 , 2016-04-08
NSGA214jdian\casejyxd6.m, 33509 , 2016-04-08
NSGA214jdian\casejyxd7.m, 33550 , 2016-04-08
NSGA214jdian\case_ieee30.m, 7780 , 2016-04-08
NSGA214jdian\case_ieee30a.m, 7789 , 2016-04-08
NSGA214jdian\cdf2matp.m, 10480 , 2016-04-08
NSGA214jdian\compare_case.m, 5495 , 2016-04-08
NSGA214jdian\competition.m, 1314 , 2016-04-08
NSGA214jdian\consfmin.m, 6601 , 2016-04-08
NSGA214jdian\copf_solver.m, 9578 , 2016-04-08
NSGA214jdian\costfmin.m, 6107 , 2016-04-08
NSGA214jdian\cpso.asv, 4175 , 2016-04-08
NSGA214jdian\cpso.m, 5310 , 2016-04-08
NSGA214jdian\cpso14.asv, 2196 , 2016-04-08
NSGA214jdian\cpso14.m, 2195 , 2016-04-08
NSGA214jdian\Crisscross.m, 721 , 2016-04-08
NSGA214jdian\CSOJILU.mat, 2062 , 2016-04-08
NSGA214jdian\CSO_PSO_mbest_gbest.asv, 2773 , 2016-04-08
NSGA214jdian\CSO_PSO_mbest_gbest.m, 2761 , 2016-04-08
NSGA214jdian\d2AIbr_dV2.m, 1840 , 2016-04-08
NSGA214jdian\d2ASbr_dV2.m, 1860 , 2016-04-08
NSGA214jdian\d2Ibr_dV2.m, 1180 , 2016-04-08
NSGA214jdian\d2Sbr_dV2.m, 1547 , 2016-04-08
NSGA214jdian\d2Sbus_dV2.m, 1338 , 2016-04-08
NSGA214jdian\dAbr_dV.m, 2092 , 2016-04-08
NSGA214jdian\dcopf.m, 518 , 2016-04-08
NSGA214jdian\dcopf_solver.m, 10311 , 2016-04-08
NSGA214jdian\dcpf.m, 998 , 2016-04-08
NSGA214jdian\define_constants.m, 1942 , 2016-04-08
NSGA214jdian\dianya118.asv, 3725 , 2016-04-08
NSGA214jdian\dianya118.m, 2838 , 2016-04-08
NSGA214jdian\dIbr_dV.m, 1861 , 2016-04-08
NSGA214jdian\dSbr_dV.m, 4191 , 2016-04-08
NSGA214jdian\dSbus_dV.m, 2243 , 2016-04-08
NSGA214jdian\EMJILU.mat, 1645 , 2016-04-08
NSGA214jdian\evaluate_objective.asv, 1125 , 2016-04-08
NSGA214jdian\evaluate_objective.m, 1125 , 2016-04-08
NSGA214jdian\ext2int.m, 13734 , 2016-04-08
NSGA214jdian\f.m, 371 , 2016-04-08
NSGA214jdian\f1.asv, 171 , 2016-04-08
NSGA214jdian\f1.m, 119 , 2016-04-08
NSGA214jdian\f10.m, 189 , 2016-04-08
NSGA214jdian\f11.m, 180 , 2016-04-08
NSGA214jdian\f12.m, 272 , 2016-04-08
NSGA214jdian\f13.m, 123 , 2016-04-08
NSGA214jdian\f14a.fig, 12555 , 2016-04-08
NSGA214jdian\f2.m, 136 , 2016-04-08
NSGA214jdian\f3.m, 131 , 2016-04-08
NSGA214jdian\f4.m, 224 , 2016-04-08
NSGA214jdian\f5.m, 55 , 2016-04-08
NSGA214jdian\f6.m, 163 , 2016-04-08
NSGA214jdian\f7.m, 107 , 2016-04-08
NSGA214jdian\f8.m, 188 , 2016-04-08
NSGA214jdian\f9.m, 134 , 2016-04-08

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 8-compressione-jpeg
    code compression jpeg
    2012-05-02 20:41:29下载
    积分:1
  • Mutual-Image-Registration-2D
    这是一个2D图像互信息配准的程序,其中图像已经导入到matlab中,并形成mat文件,对于学习互信息配准有很大的帮助(2_D image registration based on mutual information )
    2010-11-01 22:05:19下载
    积分:1
  • 3
    说明:  复杂背景下目标的快速提取和目标的跟踪研究。(Follow-up study of the complex context of rapid extraction of goals and objectives.)
    2012-05-27 21:22:19下载
    积分:1
  • jiangcaiyang
    做数据处理,比如做智能诊断样本创建的时候, 如果采集信息有限,但数据量又很大, 可以选择将原始信号就行降采样,来获得更多更可靠的样本(Good collection of information is limited, but the amount of data is so big occasion)
    2013-09-03 15:16:23下载
    积分:1
  • white_noise_data
    白色噪声的生成数据,自己编写,可以直接使用(The white noise generated data, write your own, you can directly use)
    2009-11-28 21:39:18下载
    积分:1
  • code
    code for calculating zernike moments
    2012-05-08 15:20:42下载
    积分:1
  • sedumi
    利用matlab的sedumi工具完成锥优化求解(Use tools to complete the matlab sedumi cone optimization solution)
    2012-01-03 21:58:25下载
    积分:1
  • Matlab-HHT
    能够进行信号的Hilbert-Huang变换的matlab语言代码,使用的是以前的老算法计算的,但是已经证明可用,希望能对初学者有帮助(Used to implement the input signal of the Hilbert-Huang transform. First proposed calculation method, after validation, can be used.Based on Matlab.)
    2012-03-23 09:36:55下载
    积分:1
  • disteu
    DISTEU Function DISTEU Pairwise Euclidean distances between columns of two matrices Input: x, y: Two matrices whose each column is an a vector data. Output: d: Element d(i,j) will be the Euclidean distance between two column vectors X(:,i) and Y(:,j) Note: The Euclidean distance D between two vectors X and Y is: D = sum((x-y).^2).^0.5
    2013-03-15 15:11:01下载
    积分:1
  • dipum_images_ch03
    dipum_images_ch03 matlab编程实例(dipum_images_ch03 matlab Programming Example)
    2009-09-12 11:11:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载