Description: 自己编的，在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" , will show the most trees. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 【系统功能】
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 path between cities and towns. The main algorithm 【】 1: using Prim algorithm with constraint condition of the minimum spanning tree-connected graph 2: the use of genetic algorithm based on the single condition with the TSP problem. Platform: |
Size: 575488 |
Author:张玉芨 |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS
前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。
如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm for calculation of AS some time ago on the intelligent test classes, make their own procedures. Quote here, hope someone can improve them, and exchange of experience which is more valuable. Genetic algorithm to solve the minimum spanning tree problem, PURFER coding. Particle swarm optimization to do unconstrained optimization problem. Ant colony algorithm to solve the TSP problem. If there is hope to exchange our experience, thank you, He He Platform: |
Size: 5120 |
Author:stephen |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS
前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。
如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm for calculation of AS some time ago on the intelligent test classes, make their own procedures. Quote here, hope someone can improve them, and exchange of experience which is more valuable. Genetic algorithm to solve the minimum spanning tree problem, PURFER coding. Particle swarm optimization to do unconstrained optimization problem. Ant colony algorithm to solve the TSP problem. If there is hope to exchange our experience, thank you, He He Platform: |
Size: 14336 |
Author:stephen |
Hits:
Description: 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I am preparing for 2010 U.S. race mathematical modeling algorithms are well-prepared data, a total of 13 algorithms. It should be said is a relatively wide set of algorithms. Each algorithm implementation from a VC6 example, to solve a problem. Some of which I have written, the other is modified by the web, compiled by the post. Results also good, a M, is now sharing the information out, we want to help, mainly simulated annealing algorithm, genetic algorithm, Monte Carlo algorithm, ant colony algorithm, particle swarm optimization, cellular automata, Dijkstra, minimum spanning tree algorithm, the maximum bipartite matching algorithm, maximum flow algorithm, dynamic programming, branch and bound method, queuing theory algorithms, decision theory algorithm, I wrote a documentation out very detailed Platform: |
Size: 1355776 |
Author:一招鲜 |
Hits:
Description: 遗传算法在Steiner树中的应用
遗传算法的相关论文-In order tO solve the subject of Steiner minimum spanning tree，an adaptive genetic algorithm is introduced．The Steiner
minimum spanning tree is transformed into a combination-optimization problem and a triabselection method is proposed for the crea·
tion of the partial Platform: |
Size: 35840 |
Author:利用 |
Hits:
Description: 基于新的树编码方式用免疫遗传算法解决DCMST问题：提出了一种新的树编码方式，可以方便地表达一棵树，简化了树在遗传算法中的编码表达。且新的树编码方式清楚地表达了边的信息，有利于疫苗的设计。此外，本文使用免疫遗传算法，有效地克服了传统遗传算法中解退化的现象。数值实验表明，解的振荡相对于传统遗传算法减小了，且收敛速度更快。-New tree-based encoding genetic algorithm with immune DCMST problem: A new tree encoding, you can easily express a tree, the tree simplifies the code in the expression of genetic algorithm. And new tree encoding side clearly expressed information is conducive to vaccine design. In addition, we use the genetic algorithm can effectively overcome the traditional genetic algorithm, the phenomenon of degradation in the solution. Numerical experiments show that the oscillation of solutions with respect to reducing the traditional genetic algorithm, and the convergence faster. Platform: |
Size: 5120 |
Author:LYC |
Hits:
Description: 利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-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 results, but the whole process framework is correct! Platform: |
Size: 3072 |
Author:小玉 |
Hits:
Description: 基于遗传算法的最小生成树算法很好解决了常用二进制编码不能正确表达最小生成树的问题，其优点是：求解过程简单清晰，形象直观，快速有效，易于编程，且具有更广泛的适用性，在求解多节点网络的最小生成树时更能体现其计算速度快的优越性。-The minimum spanning tree algorithm based on genetic algorithm is very good to solve the common binary code that can not correctly express minimum spanning tree problem, its advantage is: solving process simple and clear, visual in image, fast and efficient, easy programming, and has more extensive applicability, in solving many more when the minimum spanning tree node network can reflect the superiority of the calculation speed. Platform: |
Size: 57344 |
Author:刘子才 |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 -matlab genetic algorithm GA, particle swarm optimization PSO, some time ago on the ant colony algorithm intelligent calculation AS experimental course, make their own programs. Posts here, I hope someone can improve their exchange of experience is more valuable. Genetic algorithm to solve minimum spanning tree problem, PURFER code. Particle Swarm do unconstrained optimization problems. Ant colony algorithm to solve TSP problem. Platform: |
Size: 1024 |
Author:张 |
Hits:
Description: 遗传算法无功优化，计算两个矩阵之间的欧氏距离，快速扩展随机生成树算法。- Genetic algorithm based reactive power optimization, Calculation of the Euclidean distance between the two matrices, Rapid expansion of random spanning tree algorithm. Platform: |
Size: 4096 |
Author:王创伟 |
Hits:
Description: 信号维数的估计，快速扩展随机生成树算法，遗传算法无功优化。- Signal dimension estimates, Rapid expansion of random spanning tree algorithm, Genetic algorithm based reactive power optimization. Platform: |
Size: 4096 |
Author:funlanqenghun |
Hits:
Description: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime. Platform: |
Size: 342534 |
Author:atrakpc@yahoo.com |
Hits:
Description: 用MATLAB编写的遗传算法路径规划，快速扩展随机生成树算法，算法优化非常好，几乎没有循环。- Genetic algorithms using MATLAB path planning, Rapid expansion of random spanning tree algorithm, Algorithm optimization is very good, almost no circulation. Platform: |
Size: 8192 |
Author:唐万忠 |
Hits:
Search - spanning tree genetic