搜索资源列表
Combinatorial-Auctions
- 采用禁忌搜索算法解决组合拍卖问题,在短时间内找到近似最优解,用C++语言实现。-Tabu search algorithm for solving combinatorial auctions, in a short time to find the approximate optimal solution with C++ language.
MWCP(TS)
- 采用禁忌搜索算法解决最大权值团问题,包含最大独立集于最大权值团之间的转换问题。-Tabu search algorithm using the maximum weight clique problem solving, contains the largest independent set in the maximum weight conversion problems between the groups.
10012
- 文件夹 论文及原附带程序 是Abdel-Rahman Hedar,Masao Fukushima的论文《Tabu Search directed by direct search methods for nonlinear global optimization》是一篇连续禁忌搜索的算法。- 文件夹 论文及原附带程序 是Abdel-Rahman Hedar,Masao Fukushima的论文《Tabu Search directed by direct searc
VRP_algorithm
- 5个求解车辆路径问题(VRP)的MATLAB算法源程序和相应数据(数据也在m文件里),包括三种遗传算法,SA算法和禁忌搜索算法的m文件-5 solving vehicle routing problem (VRP) MATLAB algorithm source and the corresponding data (data is also in the m file), including three kinds of genetic algorithm, SA algorithm and
tabu_search
- 我们尝试用禁忌搜索(tabu search)算法来解决旅行商问题(TSP),程序可以选择随机生成点的位置坐标,也可以从圆上均匀取点(比较容易判断结果的好坏)。 我们采用下面的一些规则来运行程序: 特赦规则:如果新解被禁,但是目标函数值比当前最优解的目标函数值小于某个定值时,接受新解。 终止规则:1、如果在给定的迭代次数内,最优解的目标函数值保持不变终止2、迭代次数达到给定的最大值时终止。 候选解的产生:本实验中我采取的是随机产生候选解的方法 一些参数的选取: 在每一步的
Tabu
- matlab环境下利用禁忌搜索算法解决TSP问题-Tabu search algorithm for TSP
Tabusearch
- 在MATLAB平台,实现利用禁忌搜索算法,解决基站选址问题-In the MATLAB platform, use the so called tabusearch algorithm to solve the problem of secleting the best base station locations
Tabuwindow
- 用mfc做的禁忌搜索算法解决tsp问题的界面的代码-Using mfc taboo search algorithm to solve the tsp problem of the interface code
83268749TS-SA
- 31个城市的tsp问题,并没有改进,如果你有改进过的请联系我(31 cities tsp problem, and no improvement, if you have improved please contact me)
TS
- 法禁忌(Tabu Search)算法是一种亚启发式(meta-heuristic)随机搜索算法,用于求最优解(Tabu search algorithm)
jinji
- 禁忌搜索算法,主要为解决TSP问题,选取31个城市,目标是31个城市的路径最短化(Tabu search algorithm, mainly to solve the TSP problem, select 31 cities, the goal is the shortest path of 31 cities.)
5个求解车辆路径问题
- 5个求解车辆路径问题(VRP)的MATLAB算法源程序和相应数据(数据也在m文件里),包括三种遗传算法,SA算法和禁忌搜索算法的m文件