Location:
Search - pareto
Search list
Description: 一个DE多目标算法，可以绘制相应的pareto前沿(A DE multi-objective algorithm can draw corresponding Pareto frontiers.)
Platform: |
Size: 4096 |
Author: virtualcccc |
Hits:
Description: 一个人工免疫的多目标程序，可以绘制相应的pareto前沿(A multi-objective program of artificial immune system can draw corresponding Pareto frontiers)
Platform: |
Size: 6144 |
Author: virtualcccc |
Hits:
Description: 多目标优化测试函数集合，主要包括ZDT1~ZDT6以及DTLZ1~DTLZ6函数、TYD、UF等测试函数的数学模型，标准Pareto解集，非常实用。(Multi-objective optimization test function set, mainly including the ZDT1~ZDT6 and DTLZ1~DTLZ6 function, TYD, UF and other test functions of the mathematical model, the standard Pareto solution set, very practical.)
Platform: |
Size: 742400 |
Author: littlefu |
Hits:
Description: 测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St\ FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)
Platform: |
Size: 14336 |
Author: 朱朱521 |
Hits:
Description: 1-8遗传算法，9 多目标Pareto最优解搜索算法，10 基于多目标Pareto的二维背包搜索算法，11-12免疫算法，13-17粒子群算法，18鱼群算法，19-21模拟退火算法，22-24蚁群算法，25-27神经网络，28 支持向量机的分类，29 支持向量机的回归拟合，30 极限学习机的回归拟合及分类(1-8 genetic algorithm, 9 multi-objective Pareto optimal solution search algorithm, 10 multi-objective Pareto based two-dimensional knapsack search algorithm, 11-12 immune algorithm, 13-17 particle swarm algorithm, 18 fish swarm algorithm, 19-21 simulated annealing algorithm, 22-24 ant colony algorithm, 25-27 neural network, 28 support vector machine classification, 29 support vector machine regression simulation Regression Fitting and Classification of Combination, 30 Extreme Learning Machines)
Platform: |
Size: 1562624 |
Author: C131027 |
Hits:
Description: 实例分析，运用MATLAB中自带的多目标遗传算法对多目标函数进行计算，找到帕累托最优解。(Case study shows that the multi-objective genetic algorithm in MATLAB is used to calculate the multi-objective function and find the Pareto optimal solution.)
Platform: |
Size: 1024 |
Author: 娴娴xx |
Hits:
Description: 多目标遗传算法是NSGA-II[1]（改进的非支配排序算法）,该遗传算法相比于其它的多目标遗传算法有如下优点：传统的非支配排序算法的复杂度为 ，而NSGA-II的复杂度为 ，其中M为目标函数的个数，N为种群中的个体数。引进精英策略，保证某些优良的种群个体在进化过程中不会被丢弃，从而提高了优化结果的精度。采用拥挤度和拥挤度比较算子，不但克服了NSGA中需要人为指定共享参数的缺陷，而且将其作为种群中个体间的比较标准，使得准Pareto域中的个体能均匀地扩展到整个Pareto域，保证了种群的多样性。（消除了共享参数）。(Multi-objective genetic algorithm is nsga-ii [1] (improved non-dominant sorting algorithm), which has the following advantages compared with other multi-objective genetic algorithms: the complexity of the traditional non-dominant sorting algorithm is, while the complexity of nsga-ii is, where M is the number of objective functions and N is the number of individuals in the population.The introduction of elite strategy to ensure that some good individuals in the evolutionary process will not be discarded, thus improving the accuracy of the optimization results.The comparison operator of crowding degree and crowding degree not only overcomes the defect that NSGA needs to specify the Shared parameter artificially, but also takes it as the comparison standard between individuals in the population, so that individuals in the quasi-pareto domain can uniformly expand to the whole Pareto domain, ensuring the diversity of the population.(eliminating Shared parameters).)
Platform: |
Size: 16384 |
Author: 浅浪 |
Hits:
Description: 形成策略被用来形成稳定的生态位，小生境/子种群被优化以并行地搜索和维护帕累托最优解。此外，还提出了一种自组织机制，以提高物种制定的效率和算法的性能。为了在决策空间和目标空间保持解决方案的多样性，SS-MOPSO采用了非主导排序方案和特殊拥挤距离技术。(In the proposed method, the speciation strategy is used to form stable niches and these niches/subpopulations are optimized to search and maintain Pareto-optimal solutions in parallel.
Moreover, a self-organized mechanism is proposed to improve the efficiency of the species formulation as well as the performance of the algorithm. To maintain the diversity of the solutions in both the decision and objective spaces, SS-MOPSO is incorporated with the non-dominated sorting scheme and special crowding distance techniques. The performance of SS-MOPSO is compared with a number of the state-of-the-art multi-objective optimization algorithms on fourteen test problems. Moreover, the proposed SS-MOSPO is also employed to solve a real-life problem.)
Platform: |
Size: 109568 |
Author: xiang1971 |
Hits: