搜索资源列表
p1
- 巨大的数据量使显示速度成为制约普及和网络化的重要因素，文章结合4(5’公司的607(84空间数据引擎，提出了一种利用分级技术提高矢量图显示速度的方案，并讨论了几种插值算法在这一应用中的优缺点。- W ith the ant colony algorithm for solving the traveling salesman problem (TSP) as a prototype, a simpli- fied algorithm
ACO.ZIP
- ACO algorythm. This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System
NSGA-II(2000)
- 这是多目标优化问题的经典文章，值得研究。A Fast and Elitist Multi-Objective Genetic Algorithm NSGA-II (2000)-A Fast and Elitist Multi-Objective Genetic Algorithm NSGA-II (2000)
KnapsackProblem
- 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the pr
yichuansuanfa
- 自编的MATLAB遗传算法代码，用简单遗传算法(Simple Genetic Algorithm or Standard Genetic Algorithm ，SGA)求取函数最大值-Optimizing a function using Simple Genetic Algorithm with elitist preserved
ant_tspelitists
- 改进的蚂蚁算法，即带精英策略的蚂蚁算法，求解TSP问题，对深入理解蚂蚁算法的优化原理很有帮助，通过测试。-Improved ant algorithm, ant algorithm with elitist strategy, to solve TSP problem, the ant-depth understanding of the principle of optimization is helpful, pass the te
msops_c.tar
- MSOPS - Multiple Single Objective Pareto Sampling. MSOPS is an elitist multiobjective evolutionary algorithm which incorporates a non Pareto-dominance based multiobjective approach. Author: Tobias Wagner
GA-Elitst
- 基于精英策略的简单遗传算法代码，遗传算法的精英策略可以保证算法的收敛性-Elitist strategy, the simple genetic algorithm code, the genetic algorithm-based elitist strategy can guarantee the convergence of the algorithm
TNSGA-II2000h
- 这是多目标优化问题的经典文章，值得研究。A Fast aand Elitist Multi，已通过测试。 -This is a classic multi-objective optimization problem, and is worth studying. A Fast aand Elitist Multi, has been tested.
3258
- 针对多目标优化的精英保留非劣排序遗传算法(NSGA-11)精英保留非劣排序遗传算法.-Elitist non-dominated sorting genetic algorithm for multi-objective optimization elitist non-dominated sorting genetic algorithm (NSGA-11).
evMOGA_toolbox
- ev-MOGA Multiobjective Evolutionary Algorithm has been developed by the Predictive Control and Heuristic optimization Group at Universitat Politècnica de València. ev-MOGA is an elitist multi-objective evolutionary algor
DeJong
- 遗传算法程序测试De Jong函数；选择方法：最优保存、轮盘赌选择、改进最佳保留；动态或静态变异；量子遗传算法测试PFH函数；运用到量子遗传算法的交叉、变异等操作。-De Jong genetic algorithm program test function selection methods: elitist, roulette selection, the best retention improvement dynamic
hunheyichuansuanfa
- 包含精英保留策略的二进制/十进制可选择遗传算法编码-Elitist strategy contains binary/decimal coding genetic algorithm to select
coevolutionary-algorithm
- 协同进化算法[I5] (Co-Evolutionary Algorithm, CEA)是研究者在协同进化理论基础 上提出的一类新算法。这类算法强调了种群与环境之间、种群与种群之间在不断进化过 程中的协调。与传统进化算法相比较,CEA可以对待求问题解空间进行合理的种群划分, 对较大规模的问题求解能有效跳出局部最优点,寻找到更好的优化解虽然CEA研 究起步较晚,但由于它的优越性,目前己成为当前进化计算
GA-algorithms
- 结合精英保留和轮盘赌、两两竞争法的几种选择算子和单点交叉算子与改进交叉算子分别对函数最小值求解，通过仿真计算相应的平均最小值，平均运行时间等统计值，并比较优差。-Combine elitist and roulette, several pairwise competition law selection operator and a single point of crossover with improved crossover f
GA_1
- 进化算法中带精英保留的遗传算法，实现的功能是需要一个函数的最优值。-Genetic Algorithm evolutionary algorithm with elitist and achieve optimal value function is a function of need.
NSGA2
- 基于非支配排序的带有精英策略的多目标优化算法:NSGA-II,测试函数是DTLZ-Based on the non-dominated sorting multiobjective optimization algorithm with elitist strategy: NSGA-II, the test function is DTLZ
paper3
- A fast and elitist multiobjective genetic algorithm NSGA--A fast and elitist multiobjective genetic algorithm NSGA-II
NSGA-II
- NSGAII 带精英策略的双目标遗传算法-Dual objective genetic algorithm NSGAII Elitist
NSGA-II
- NSGA2 带精英策略的非支配遗传算法 matlab算法包(NSGA2 elitist genetic algorithm matlab algorithm package with elitist strategy)