搜索资源列表
-
0下载：
基于遗传算法的有向图的边序列遍历算法Matlab源码.此函数实现遗传算法，用于用于有向图的边遍历序列的优化 GreenSim团队原创作品-Genetic algorithms are based on the edge to the graph traversal algorithm sequence of Matlab source code. This function implements the genetic algorithm used for edge directed graph
-
-
0下载：
遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
-
-
0下载：
利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-Spanning tree in graph theory using the concept of writing all the spanning tree code, the lack of the middle of the real-coded genetic algorithm code, so it can not come to a complete
-
-
0下载：
我自己写的一个用于图编码的遗传算法，实现了多种算子，如选择、交叉、编译、比较等，具体的请参见源码-I wrote it myself one for the graph-encoded genetic algorithm, to achieve a variety of operators, such as selection, crossover, compile, compare and so on, see the specific source
-
-
0下载：
自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
-
-
0下载：
JGAP是一种遗传算法和遗传规划的组成部分提供了一个Java框架。它提供了基本的遗传机制，可以很容易地用来申请进化原则问题的解决办法。见实例演示或观赏树的图形，可以创建JGAP找到解决办法的基因进化程序。-JGAP is a genetic algorithm and genetic programming an integral part of providing a Java framework. It provides basic genetic mechanisms, can easil
-
-
1下载：
【系统功能】
LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。
【主要算法】
1：利用Prim算法求解带约束条件的连通图的最小生成树；
2：利用基于单亲遗传算法求解带约束条件的TSP问题。
-【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest p
-
-
0下载：
通过遗传算法把随机点提取成曲线的程序，可以用来结合图论分析-Through the genetic algorithm to extract a random point process into a curve can be used to combine graph theory analysis
-
-
0下载：
Genetic Algorithm optimization using bi-partite graph
-
-
0下载：
通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
-
-
0下载：
This article presents one of the most famous hierarchical graph drawing algorithms. Starting from a hierarchical graph we create a population of chromozoms that will be used in a Genetic Algorithm to get the best subjective representation: minimal ed
-
-
0下载：
Hierarchica graph drawing using genetic algorithms. We start with a hierarchical graph containing multiple layers and we create a group of chromozoms from the input layered graph. We have inter-layer and intra-layer crossing. We use the minimum edge
-
-
0下载：
Genetic algorithm to evolving a logic network of 16 gates, and graph evaulation for shortest path.
It use matlab ga basic function
-
-
0下载：
this algorithm uses genetic algorithm for solve graph coloring problem
-
-
0下载：
Graph colloring problem solved with genetic algorithm using visual studio 2010 C# language.
with capability of draw graph.
-
-
0下载：
matlab编写的蚁群算法，即在图中寻找优化路径的机率型算法，结合遗传算法进行了改进。-ant colony algorithm matlab prepared in the graph to find the probability-based algorithm for optimal path, combined with genetic algorithm is improved.
-
-
0下载：
tinyos 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。蚁群算法是一种模拟进化算法,初步的研究表明该算法具有许多优良的性质.针对PID控制器参数优化设计问题,将蚁群算法设计的结果与遗传算法设计的结果进行了比较,数值仿真结果表明,蚁群算法具有一种新的模拟进化优化方法的有效性和应用价值-The tinyos
-
-
0下载：
To the edges of the graph sequence traversal algorithm based on genetic algorithm Matlab source
-
-
0下载：
基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
-
-
0下载：
图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法，而并行遗传算法是遗传算法研究中的一个重要方向，受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many p
-
