1) VNTS(variable neighborhood tabu search) algorithm
变邻域禁忌搜索算法
2) Tabu search algorithm
禁忌搜索算法
1.
Optimization of Vehicle Routing Problem based on Improved Tabu Search Algorithm;
基于改进禁忌搜索算法的车辆路径优化
2.
Optimal PMU placement based on genetic algorithm and tabu search algorithm;
基于遗传禁忌搜索算法的PMU布点配置
3.
Two-phase tabu search algorithm of unloading operation scheduling project in container wharf;
集装箱码头卸船作业调度方案的两阶段禁忌搜索算法
3) tabu search
禁忌搜索算法
1.
Research on shop scheduling optimization based on genetic and tabu search hybrid algorithm;
基于遗传和禁忌搜索算法求解车间调度优化问题
2.
System identification based on tabu search;
基于禁忌搜索算法的系统辨识
3.
The Application of a Hybrid Strategy Based on Genetic Algorithm and Tabu Search to VRPTM;
遗传算法与禁忌搜索算法的混合策略在VRPTM问题上的应用
4) tabu search(TS)
禁忌搜索算法
1.
Tabu Search(TS) behaves well in finding global optimum of combined optimization problems.
蚁群优化算法(ACO)的正反馈机制使其具有强大的局部搜索性能,但其全局优化性的优劣在很大程度上与挥发系数的选择有关,如选择得不合适则易将使算法陷入局部最优,而禁忌搜索算法(TS)则具有强大的全局优化性能。
5) taboo search algorithm
禁忌搜索算法
1.
Improved taboo search algorithm for Job Shop scheduling problems;
求解Job Shop调度问题的改进禁忌搜索算法
2.
According to the characteristics of the solution to a job shop scheduling problem,we propose a new neighborhood search method based on critical operations and use the taboo search algorithm based on the neighborhood search algorithm as the local search algorit.
在融合方法中,采用遗传算法和蚁群算法进行并行搜索;根据Job Shop调度问题解的特征,提出基于关键工序的邻域选择方法,并将基于这种邻域选择方法的禁忌搜索算法作为局部搜索算法,加强了遗传算法和蚁群算法的局部搜索能力。
3.
A solving strategy combining heuristic clustering method with taboo search algorithm is established.
现将二者合并分析,建立了一个混合整数规划模型———R-LRP模型,并采用启发式聚类规则与禁忌搜索算法的混合策略进行求解,最后通过算例验证了该模型和算法的有效性和实用性。
6) variable neighborhood search algorithm
变邻域搜索算法
1.
Application of evolutionary variable neighborhood search algorithm to location-allocation problem in close-loop supply chain;
用进化变邻域搜索算法求解闭合供应链选址问题
2.
A two-stage variable neighborhood search algorithm was designed to solve the problem, and the algorithm solves the problem by optimizing the average rolling length first and optimizing hot charge rate secondly.
提出了一种两阶段变邻域搜索算法,该算法按照先优化平均单元计划轧制长度后优化热装比的顺序求解该问题。
补充资料：超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
伦敦第二个方程（见“伦敦规范”）表明，在伦敦理论中实际上假定了js(r)是正比于同一位置r的矢势A(r)，而与其他位置的A无牵连；换言之，局域的A(r)可确定该局域的js(r)，反之亦然，即理论具有局域性，所以伦敦理论是一种超导电性的局域理论。若r周围r'位置的A(r')与j(r)有牵连而影响j(r)的改变，则A(r)就为非局域性质的。由于`\nabla\timesbb{A}=\mu_0bb{H}`，所以也可以说磁场强度H是非局域性的。为此，超导电性需由非局域性理论来描绘，称超导电性的非局域理论。皮帕德非局域理论就是典型的超导电性非局域唯象理论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条