搜索资源列表
PSOLSp
- 10个粒子群算法的旅行商问题,内容详尽 ,可以此类推n个城市的算法-greedy algorithm to do with the country s 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of data tables and urban name, and the executable on the same withi
PSO
- 动态环境下的粒子群算法研究 动态优化问题是指目标函数随时间连续、缓慢或突然、随机变化的情况。该课题旨在将动态优化问题连续变化的时间变量区间进行任意划分,在得到的每个时间子区间上将动态问题转化为静态问题,针对此静态优化问题设计相应的遗传算法。同时给出一种能自动检测时间变化的应答算子。-Dynamic optimization problem refers to the objective function over time in a row, slow or sudden, random c
PSO11-20121026
- 粒子群优化算法的示例代码,可以很好解决连续性寻优问题-PSO sample code, can be solved continuous optimization problem
JavaNotepad-master
- 大部份的优化问题都是多峰函数或病态函数,为了克服基本粒子群算法的缺陷,我研究了以下四种改进的粒子群算法(Most optimization problems are multi-peak functions or ill-conditioned functions. In order to overcome the defects of basic particle swarm optimization, I studied the following four improved particl