Description: This algorithm is a heuristic algorithm in the current domestic and international research focus and topics at the forefront, has been successfully applied to solve the traveling salesman problem, ant colony algorithm in solving complex optimization problems has great advantages and broad prospects. However, based on observation was found in multiple ant colony movement is random, the diffusion range is large, in a relatively short time is difficult to find a better path in the algorithm implementation process prone stagnation and slow convergence phenomenon. In this malpractice case, scholars have proposed an adaptive ant colony algorithm, by adaptively adjusted during operation to change the path of volatile factor pheromone, which effectively overcome the traditional ant colony algorithm easy to fall into local optimal solution and slow convergence phenomenon.
To Search:
File list (Check if you may need any files):
蚁群算法（C＃版）\AntFood.Ant.dll
.................\dotnetfx.exe
.................\Environment.dll
.................\Loader.exe
.................\zh-CHS\Loader.resources.dll
.................\....N\Loader.resources.dll
.................\说明.txt
.................\zh-CHS
.................\zh-CN
蚁群算法（C＃版）
Download