遗传算法工具箱matlab

很管用的GIS控件，对于进行GIS开发的人员很有帮助，第一次发请多关照-very effective GIS component for GIS development for the staff helpful, first made news conference for the

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method.

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.

该程序介绍了一种简单的遗传算法应用程序，采用matlab高效编程，适合于二进制编码的典型应用。-The program introduced a simple application of genetic algorithm using matlab efficient programming, suitable for the typical application binary code.

本算法中采取了种群规模为100，同时采用轮盘赌来获取种群。开始使用随机的方法得到初始的种群-the algorithm adopted a population size of 100, using roulette to access populations. Using the stochastic method initial Stocks

利用模拟退火法求解TSP问题 可以求得50个城市的精确解-The use of simulated annealing algorithm for solving TSP problems can be obtained 50 cities Exact Solutions

神经网络中的SOM算法的C语言程序实现,可以对初学者了解神经网络有帮助.-SOM neural network algorithm in the C language program can be for beginners understand the neural network has to help.

基于RBF神经网络的复杂背景下的运动目标检测论文一篇-RBF neural network based on the complexity of the background of a moving target detection Papers

用局部最优探索算法求解tsp问题。。。matlab编写。附有城市坐标用于检验。 -Using local optimization algorithm to explore the issue tsp. . . matlab prepared. Coordinate with the city for inspection.

这个程序是在windows平台下运行game of life最好的平台。它不仅对细胞空间没有限制、运行速度非常快、界面很友好，而且能够为你提供大量的初始细胞分布图案，你还可以任意组合这些图案达到你象要的构形，然后让这些构形动起来组合出更加神奇的生命游戏的世界。-the procedure is the windows platform running game of life the best platform. It not only on the cell space is no restriction, running very fast, very friendly interface, but you have to provide a lot of initial cell distribution patterns, you can design any combination of these to you as to the configuration, then let these configuration movement combined to make life more wonderful game world.