资源列表
SA_TSP_su
- 模拟退火解决TSP问题 内附测试文件 效果不是特别好。-Simulated Annealing to solve TSP problem file containing the test results are not particularly good.
BGAandDWT
- 基于遗传算法和小波变换的图像去噪处理-Based on genetic algorithms and image denoising wavelet transform to deal with. . . . .
BGAthrehold
- 基于遗传算法的图像去噪阈值分析研究的方法-Based on Genetic Algorithm for Image Denoising threshold method of analysis. . . .
demosvm
- matlab编写的svm实现多类分类的源代码，训练算法包括OAA算法、OAO 算法、BSVM2算法等。-matlab prepared svm multi-category classification of the source code, training algorithms, including OAA algorithm, OAO algorithm, BSVM2 algorithm.
SGASforTSP
- 这是遗传算法对TSP的运算结果。文件夹中包含有源代码与运算结果，可做参考-This is a genetic algorithm for computing the results of the TSP. Folder contains the source code and computing the results, can refer to! !
Autoclust.pdf.tar
- 这就是点集自动聚类的算法，基于delaunay三角剖分。-This is the point set automatic clustering algorithm, based on the delaunay triangulation.
OnRelationalPossibilisticClustering
- 一篇基于可能性理论的数据聚类分析的经典文献。很值得阅读，有一些未解决的难点，可以进一步深入研究！-The possibility of a theory based on cluster analysis of data from the classical literature. Is worth reading, there are some unresolved difficulties, can be further in-depth study!
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
20080912103856
- 人工智能 十五数码和八数码问题 包含界面-Artificial Intelligence 15 digital and eight issues included in the digital interface
GuoA
- 郭涛算法(GuoA)是基于子空间搜索(多父体重组)和群体爬山法相结合的演化算法。它通过利用少数个体所张成的子空间随机生成新的个体,体现了随机搜索的非凸性。此外,由于GuoA算法采用了单个体劣汰策略,算法在每次演化 迭代中,只把群体中适应性能最差的个体淘汰出局,淘汰压力 较小,既保证了群体的多样性,又可使具有较好适应性的个体能够一直保留。实践证明, GuoA算法具有较好的坚韧性,对于不同的优化问题无须修改算法的参数,而且效率很高,可能同时找到多个最优解。-Guo Tao algorithm
jswarm-pso
- 不错的代码 调试过了。希望会对大家有帮助 。-Well after debugging the code. Hope will be helpful
HybridalgorithmbasedonabalancedstudyofMTSP
- 基于混合算法的均衡路程MTSP研究 给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标 问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应 的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of the MTSP integer linear programm