搜索资源列表
TSP_TS
- 采用禁忌搜索算法解决中国城市tsp问题,语言环境为matlab(Using tabu search algorithm to solve the problem of Chinese city tsp)
TS
- 法禁忌(Tabu Search)算法是一种亚启发式(meta-heuristic)随机搜索算法,用于求最优解(Tabu search algorithm)
TS-TSP
- 本禁忌搜索算法主要用于求解经典的TSP问题(Tabu search algorithm is used to solve the classical TSP problem)
禁忌算法求解tsp
- 利用禁忌搜索算法求解经典TSP问题。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路径的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Tabu search algorithm for solving classical TSP problems)
紧急搜索求VRP
- TS算法通过引入一个灵活的存储结构和相应的禁忌准则来避免迂回搜索,并通过藐视准则来赦免一些被禁忌的优良状态,进而保证多样化的有效探索以最终实现全局优化(TS algorithm by introducing a flexible storage structure and corresponding tabu criteria to avoid circuit search, and the contempt of criterion to pardon a little good state
智能优化算法资料
- 优化算法有很多,经典算法包括:有线性规划,动态规划等;改进型局部搜索算法包括爬山法,最速下降法等,模拟退火、遗传算法以及禁忌搜索称作指导性搜索法。而神经网络,混沌搜索则属于系统动态演化方法。 梯度为基础的传统优化算法具有较高的计算效率、较强的可靠性、比较成熟等优点,是一类最重要的、应用最广泛的优化算法。但是,传统的最优化方法在应用于复杂、困难的优化问题时有较大的局限性。(There are many optimization algorithms, the classical algori
新建文件夹
- 提出了一种以目标函数变化量作为评价函数的改进禁忌搜索算法,并进行了理论分析,然后将其与有效禁忌搜索算法作了性能比较。通过比较三个公共测试数据集的计算结果,验证了本文提出的禁忌搜索算法的可行性和有效性。(Proposed a change in the objective function as the evaluation function of the improved tabu search algorithm, and has carried on the theoretical anal
禁忌算法
- 用禁忌算法求解VRP问题,简单易懂,有解释语句,方便了解学习。(Using tabu algorithm to solve the VRP problem, easy to understand, there are explanatory statements, easy to understand learning.)
tabu_search
- 基禁忌搜索于31城市TSP问题,Base tabu search in the 31 city TSP problem(Base tabu search in the 31 city TSP problem)
禁忌搜索matlab算法
- 禁忌搜索算法建议编程,车辆路径问题,以最短距离为目标(The tabu search algorithm recommends programming, vehicle routing problem, with the shortest distance as the target)
禁忌搜索
- matlab实现的利用禁忌搜索解决tsp问题,代码可以运行(Matlab implements the use of tabu search to solve the TSP problem, the code can run)
n-Queen using TS
- n-Queen Problem using Tabu Search
ts_tsp
- 简单介绍禁忌搜索算法的过程,并求解TSP,来加深对其的理解。(Briefly introduce the process of tabu search algorithm, and solve TSP, to deepen its understanding.)
TS_tsp
- 利用matlab软件,应用禁忌搜索算法解决31个城市的TSP问题(Using Matlab Software, Applying Tabu Search Algorithm to Solve TSP Problems in 31 Cities)
prokiler
- 一个java的tabu search算法框架()
禁忌算法 C++
- 禁忌搜索算法是一种全局性邻域搜索算法,模拟人类具有记忆功能的寻优特征。它通过局部邻域搜索机制和相应的禁忌准则来避免迂回搜索,并通过破禁水平来释放一些被禁忌的优良状态,进而保证多样化的有效探索,以最终实现全局优化(Tabu search algorithm)
禁忌搜索算法
- 禁忌搜索解决背包问题,matlab环境实现c流程(Tabu search solves knapsack problem, and C flow is realized in Matlab environment.)
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.)
禁忌搜索算法
- matlab禁忌搜索算法的源程序,内含 TS_TSP.m TS_TSP TSP_DATA.m(Matlab tabu search algorithm source program)
禁忌搜索解决TSP加注释
- matlab程序编写 应用禁忌搜索解决TSP(商旅)问题(Using Tabu Search to Solve TSP (Business Travel) Problem in Matlab Programming)