用局部最优探索算法求解tsp问题。。。matlab编写。附有城市坐标用于检验。...

一种运算效率较高的遗传算法-a higher genetic algorithms

vs2005开发 遗传算法求解144城市的旅行商问题-VS2005 to develop genetic algorithm 144 city traveling salesman problem

微分进化算法DE是1995年由Rainer Storn和Kenneth Price首先提出。DE已被证明在求解过程中具有高效性、收敛性、鲁棒性等优点[5,6] 。它在许多优化问题中都表现出优于自适应模拟退火算法、POS 算法、GA算法的性能。DE利用实数值参数向量作为每一代的种群，它的自参考种群繁殖方案与其他优化算法不同。-DE was first proposed in 1995 by Rainer Storn and Kenneth Price and had been proven that it is efficient, convergent, and robust in the solution process. [5,6] In many optimize questions, its performance surpasses the adaptive simulated annealing algorithm, the POS algorithm, and the GA algorithm. DE gets each generation of population using the real value parameter vector, and the crucial idea of DE is a scheme for generating trial parameter vectors.

XCS是一种新的人工智能算法

迁移学习的经典文章，大多为国际顶级会议论文-Transfer of learning classic articles, most of the international top-level Conference Papers

用免疫算法来实现TSP问题的求解，程序全，可以运行。-Using immune algorithm to achieve the TSP problem solving, program-wide, you can run.

LinPacker是一个优化矩形布局的工具，是在具有遗传算法的半无限大小区完成这一操作的。对缩减工厂的库存是有用的。-LinPacker optimization is a rectangular layout of the tool, with a genetic algorithm in the semi-infinite size of the area to complete the operation. To reduce factory stocks will be useful.

关联规则中的频繁项集生成算法TreeMiner，可在linux和windows下编译运行。-Frequent one of related rule collect and produce algorithm TreeMiner , can compile running under linux and windows

C 语言编缉神经网络工具-neural network tools edited by C language

有关优化的遗传算法-the genetic algorithm optimization