搜索资源列表
AHybidGeneticAgorithmtoSolveTS
- 求解TSP和MTSP的混合遗传算法_英文_,Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is called
2
- tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
12345
- 自己编写的带2-opt法的蚁群算法求解TSP，可以运行，运行环境VS2008-His writing with 2-opt method of ant colony algorithm for solving TSP, can run, run VS2008 environment
Ant-Algorithmcpp
- 蚁群算法的C++实现，VC6.0环境。基本蚁群算法+2OPT局部优化+Etlist精英解策略。-Ant colony algorithm C++ implementation, VC6.0 environment. The basic ant colony algorithm+2 OPT local optimization+ Etlist elite Solution Strategy.
R-Opt-Lin-Kernighan
- Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
2
- PSO求解TSP问题的参考文献，查询学校IEEE检索得到！-Particle Swarm Optimization Based on Neighborhood Encoding for Traveling Salesman Problem
aco
- 蚁群算法解欧氏平面上的TSP问题。包括了2-opt、3-opt优化，经过了若干经典数据的测试。-AntColony algorithm solving the TSP problem in Euclid plane, including 2-opt and 3-opt optimization. It has been tested by authorized data.
sa
- 基于M5（2-opt领域）选择策略的模拟退火算法，手动编写，实现的效果也相当不错！-Based on M5 (2-opt the field) selection strategy simulated annealing algorithm, written by hand, to achieve the effect is quite good!
constrain-opt
- 针对工程优化设计问题,提出了基于混沌粒子群算法的工程约束优化问题求解方法。CPSO算法利用混沌搜 索的全局遍历性、随机性和规律性等特点, 引导粒子在全局范围内搜索, 从而克服了传统粒子群算法早熟收敛的缺点。 该算法以种群适应度方差作为粒子群优化算法早熟收敛的判据, 并用惩罚函数法处理违法约束的粒子, 当基本粒子群算 法陷入早熟时, 随机选择粒子群中的部分粒子实施混沌搜索, 直至满足迭代收敛条件为止。CPSO算法能提高种群的多 样性和粒子搜索的遍历性, 从而有效提高了PSO算法的收
Research-on-Some-Novel-Bionic-Opt
- ：仿生优化算法是模拟自然界中生物行为的随机搜索算法，可以用来解决现实中的许多优化问题。简要介绍了目前比 较流行的四种新型仿生优化算法(蚁群算法、微粒群算法、人工免疫算法以及人工鱼群算法)的基本原理；然后深入分析了这 些仿生优化算法的异同之处-Bionic optimization algorithms aye stochastic search methods that mimic the natural biological behavior of species．They age
VRP
- 蚁群算法，2-opt，解决车辆路径问题（vrp）的matlab代码，修正了原始代码忽略初始节点下一节点cost的问题，但是对某些测试数据集存在车辆数大于或小于的标准问题。-Ant colony algorithm ,2-opt, vehicle routing problem (vrp) matlab code, amended the original code ignores the initial node next node cost problems, but for some tes