1) variable neighborhood descent
变邻域下降搜索
1.
We combine the ant colony system(ACS in short) with variable neighborhood descent in the research.
将蚁群优化和变邻域下降搜索VND相结合,形成一种混合启发式算法ACS_VND,应用于客运公司的汽车调度,求解车辆需求数和最佳路径。
2) variable neighborhood search
变邻域搜索
1.
A variable neighborhood search operator and an inversion operator were used to keep the diversity of swarm and improve the algo.
采用变邻域搜索算子和逆序算子来保持粒子群的多样性和提高算法的局部求精能力,使算法在空间探索和局部求精间取得了较好的平衡。
2.
A niche genetic algorithm combined with variable neighborhood search was proposed herein to solve the flow path design of unidirectional AGV systems.
提出一种变邻域搜索与小生境遗传算法结合的混合遗传算法,并采用该算法进行单向AGV路径网络设计。
3.
Aiming at Flowshop scheduling problem with limited waiting time,a Hybrid Genetic Algorithm(HGA) combined with constraint satisfaction and variable neighborhood search is proposed.
针对等待时间受限的Flowshop调度问题,提出嵌入约束满足和变邻域搜索技术的混合遗传算法。
3) VNS
变邻域搜索
1.
Based on the characteristics of this problem,a modified variable neighborhood search method(VNS)is proposed for solving it.
针对推广模型的特点,提出了一种变邻域搜索(VNS)方法进行求解。
2.
To the characters of the model,the improved variable neighbourhood search (VNS) algorithm is proposed for solving the problem.
针对模型特点,设计了改进变邻域搜索的模型求解算法,算法采用模拟退火的Metropolis准则,防止算法陷入局部最优。
4) variable neighborhood descent
变邻域下降
1.
A guided local search algorithm which is combined with variable neighborhood descent algorithm is presented to tackle the independent tasks assignment problem in heterogeneous environments.
针对异构环境下的独立任务分配问题,结合变邻域下降算法,提出了一种导引式局部搜索算法。
5) 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.
提出了一种两阶段变邻域搜索算法,该算法按照先优化平均单元计划轧制长度后优化热装比的顺序求解该问题。
6) variable neighborhood search
变邻域搜索算法
1.
A variable neighborhood search algorithm was presented to solve the no-wait flow shop problem with makespan criterion.
仿真实验证明了变邻域搜索算法的有效性。
2.
A new metaheuristic algorithm,the variable neighborhood search(VNS),has been successfully used to solve optimizaiton problem,especially for the largescale combinational optimization problem.
变邻域搜索算法(Variable Neighborhood Search,VNS)作为一种新的元启发式算法,已初步成功地用于解决优化问题,尤其是对于大规模组合优化问题效果良好。
补充资料：超导电性的局域和非局域理论（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是非局域性的。为此，超导电性需由非局域性理论来描绘，称超导电性的非局域理论。皮帕德非局域理论就是典型的超导电性非局域唯象理论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条