基于遗传算法的tsp算法

宽度优先算法解决八码难题-width priority code algorithm to solve eight problems

应用背景随机共振利用噪声，可以增强信号。对于双稳态系统，朗之万方程的参数a,b对系统影响很大，需要合理选取。压缩包中有两个使用GA遗传算法的示例程序，一个简单一个较复杂。关键技术随机共振SR相比于以往的去噪技术，可以利用噪声进行信号增强。使用了遗传算法对系统的参数进行优化

资源描述迷宫里的最短路问题是相当经典的问题，也是一个图的遍历问题，这里遍历用的是宽度优先搜索

背包问题的 求解代码，自己用C++实现，里面包括0-1背包问题 和  单位质量的背包问题，包括如下几个关键的函数：void vwComp(Item*item,int n) ；void vwSort(Item*item,int n)；int getMaxValue(Item*item,int n, int p,int cvs,int cws)；double frackKnapsack(Item*item,int n,double *chs)；void zeroOneKnapsack(Item*item,int n,int &fv,int &fw,int *fch)

应用背景The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms.关键技术Its key features includes:   * Fast, reliable implementations of many state-of-the-art algorithms   * Extensible with custom algorithms, problems and operators   * Supports master-slave, island-model, and hybrid parallelization &n

高斯赛德尔 高斯赛德尔 高斯赛德尔 高斯赛德尔 高斯赛德尔-Gauss-seidel

[[ Complex Matrices : Language c]]

应用背景本次智能小车设计是在全国电子设计大赛的背景下，省区选拔第一阶段，我和两名队友协作努力，一起完成整个电路的硬件设计，和算法。获得区级三等奖，成功进入国家级的初赛。关键技术本次智能小车的关键设计在于电路的选择和算法的实现。电路我采用最简单的51单片机作为MCU，对于循迹完全足够了，红外传感器既可以循迹，也可以避障。

Floyed算法void floyed(void)// a[i][j]表示结点i到结点j的最短路径长度，初始时值为的权值。{for(int k=1;k

It s simple implementation of Genetic Algorithm on 8-puzzle and as result it can say either there is or not a set of movement to go from initial state to a given final state.-It s simple implementation of Genetic Algorithm on 8-puzzle and as result it can say either there is or not a set of movement to go from initial state to a given final state.