搜索资源列表
Dynamic-Search-Algorithm
- 提出一种基于改进粒子群动态搜索算法的网络重构方法，算法把初始粒子群按照适应度的大小分为两个互不交叉，且具有不同分工的子群，并进行动态搜索。通过引入了交叉和禁忌思想，减少了解陷入局部最优的可能性．与遗传、禁忌搜索算法重构的结果进行比较，表明本文算法具有更高的搜索效率，更容易找到全局最优解．-：An improved method based on improved particle swarm optimization dynamic search algodthm networkrcconfig
optimizationBook
- 讲述各种优化算法的书籍，如禁忌搜索、遗传算法、模拟退火算法、蚁群算法等-Books about various optimization algorithms such as tabu search, genetic algorithms, simulated annealing, ant colony algorithm
TS-SA
- 禁忌搜索和模拟退火相结合的算法，解决TSP问题。注：31城市。-Tabu search and simulated annealing to a combination of algorithms to solve TSP. Note: The 31 cities.
CPP_Tabu-search-algorithm
- 禁忌搜索算法C/C++源代码，以禁忌表形式来搜索和禁忌以搜寻最优解-The taboo search Algorithm C/C++ in source code form of taboo table to search for and contraindications to search optimal solution
HeuristicLab-3.3.7
- Heuristic 算法库。包含很多算法，包括蚁群算法，遗传算法，模拟退火算法，禁忌搜索算法。-Heuristic algorithms library. Contains many algorithms, including the ant colony algorithm, genetic algorithm, simulated annealing, tabu search algorithm.
TSP_TS
- 基于禁忌搜索的求解TSP问题。问题为31个城市的寻优路径，采用GLover提出的简单禁忌搜索算法。设置禁忌表，避免陷入循环，实现全局的最优。-Based on Tabu Search for TSP. Route optimization problem in 31 cities, using a simple tabu search algorithm GLover proposed. Set tabu list, to avoid falling into circulation, to a
tabu
- 一个用禁忌搜索算法求解旅行商（TSP）问题的java源代码，算法正确可行。-A tabu search algorithm to solve TSP (TSP) problem java source code, the algorithm is correct and feasible.
TS
- 禁忌搜索（Tabu search）是局部邻域搜索算法的推广，Fred Glover在1986年提出这个概念，进而形成一套完整算法。 -Tabu search
ant-colony-algorithm
- 针对车辆的越野路径规划问题,设计了以最少行驶时间为目标的多策略蚁群算法.首先,分析了地形坡度和地表属性对于车辆路径规划的综合影响,通过叠加坡度与粗糙度约束建立了禁忌表 其次,一方面引入了自适应调整策略以提高路径搜索的有效性,另一方面设计了双向搜索策略以增加蚂蚁之间的协作能力和成功路径的搜索机率 另外,还提出了子路径多段交叉策略以提高算法的全局搜索能力和收敛速度,在详细叙述改进算法的步骤之后,优化了算法的部分参数取值 最后,就基本算法和改进算法的性能指标、收敛代数和仿真结果进行了比较与分析.实验结
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
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.