搜索资源列表
cucaojishuxingyuejian
- 本程序是一个关于粗糙集属性约简启发式算法的实现，不过只有执行文件-this procedure is a rough set of attribute reduction heuristic algorithm to achieve, but only the implementation of documents
MC_3points
- 蒙特卡罗启发式搜索算法，在平面内的多个点找到任意三点组成对大三角形的面积-Monte Carlo heuristic search algorithm, a number of points in the plane to find any of three large triangular area formed
algorithm02
- heuristic algotrihm for travelling salesman problem
Minoux_greedy_algorithm
- Minoux’s greedy algorithm is a method of a heuristic solution for the network design with linear separable costs.
Tabu_Best
- Tabu search is a meta-heuristic that guides a local search towards better solutions.
matrix
- heuristic algorithm for solving discrete optimization
qifashi
- 改文档详细论述了启发式优化算法的原理，以及使用例程和待改进点，供编程爱好者使用-Change the document in detail the principle of heuristic optimization algorithm, and the use of routines and points to be improved for programming lovers
NelderMid
- The Nelder–Mead method or downhill simplex method or amoeba method is a commonly used nonlinear optimization technique, which is a well-defined numerical method for twice differentiable and unimodal problems. However, the Nelder–Mead technique is onl
Lin-Kernighan-heuristic-for-the-TSP-and-minimum-w
- Lin-Kernighan heuristic for the TSP
TSP_SA
- Solution for Travelling Salesman Problem using the simulated annealing heuristic. As an input, we take coordinates of cities (x,y) and then transform them into distances matrix (we assume, the distance between x and y is the same as between y and
Grasp2
- Grasp Heuristic header file
A-heuristic-algorithm
- 一个大地球物理数据的多元分析的启发式算法在模式识别集-A heuristic algorithm for pattern identification in large multivariate analysis of geophysical data sets
KMean
- KMEAN C# In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data sp
TSP
- TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
TSP-Heuristics
- Another version of TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
CDS
- CDS(Campbell-Dudek-Simth)：是Johnson算法的扩展，被认为是好的具有鲁棒性的启发式算法。用于求解n-job，m-machine的流水作业调度问题；即n项作业都需要顺序进行m个工序，m个工序中，每道工序仅有一台机器，如何安排n项作业的加工先后关系。-CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is go
css
- 用visual basic编译的布谷鸟算法的源代码,是一种很好地启发式智能算法。-Use visual basic compiler cuckoo algorithm source code, is a good heuristic intelligent algorithm.
beibao
- 一个背包问题的启发式算法，在处理小数据时可以快速得到结果。-A heuristic algorithm for knapsack problem, in dealing with small data can quickly get results.
TestAStar
- 在即时战略或角色扮演游戏中，经常需要控制角色移动到指定位置，只要存在可行路径，总是会采用最优路径到达目的地。这种能够在角色移动到目的地的方法，通常称为“游戏寻路算法”。 A*是一种启发式搜索算法，其所处理的对象是状态空间，安装预先设定的规则进行有选择有方向的遍历。-In the real-time strategy or role-playing games, often need to control the character moves to the specified locatio
hoopoe-heuristic-optimization.txt
- Most optimization problems in real life applications are often highly nonlinear. Local optimization algorithms do not give the desired performance. So, only global optimization algorithms should be used to obtain optimal solutions. This paper propose