1) neighborhood search
邻域搜索
1.
Hybrid Constraint Satisfaction and Neighborhood Search Algorithm and its Application
约束满足与邻域搜索结合的混合算法及应用
2.
Then a fast neighborhood search algorithm was presented.
研究了无等待流水车间调度问题的快速邻域搜索技术,并将其分别用于加强粒子、个体极值或全体极值的邻域探索能力,得到了三种改进的离散粒子群优化算法。
3.
In accordance with the characteristic of NPhard,a mutation based on neighborhood search is proposed,and a hybrid genetic algorithm is also established,which used the idea of neighborhood search and combined the heuristic algorithm and genetic algorithm.
分析了资源受限项目调度问题,针对其具有NP hard的特点,提出了一种基于邻域搜索的混合遗传算法,将启发式算法与遗传算法相结合,用邻域搜索的思想进行变异操作。
2) local search
邻域搜索
1.
An adaptive hybrid genetic algorithm was developed to solve VRPSDP,which used a special optimal splitting procedure to get the fitness values,and took a local search as the mutation operator.
该算法以最优划分方法计算适应值,邻域搜索法作为变异算子,设计了新颖的交叉算子和群体更新策略,定义了群体多样性结构和变异概率的变化规律。
2.
An improved algorithm,combined ant algorithm with local search,is put forward to reduce the inherent deficiency of traditional ant algorithm in solving JSP.
讨论了蚁群算法在车间作业调度问题中的应用,针对传统蚁群算法求解调度问题的不足,将邻域搜索与蚁群算法结合,通过实验验证了该混合算法的有效性和优化性。
3.
A new local search algorithm for solving the minimum make span problem of job shop scheduling is presented.
该文提出了一种新的求解工件车间调度(jobshopscheduling)问题的邻域搜索算法。
3) Searching neighborhood
搜索邻域
4) 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调度问题,提出嵌入约束满足和变邻域搜索技术的混合遗传算法。
5) 8-Neighbor Searching
8-邻域搜索
1.
By improving the traditional algorithm of 8-Neighbor Searching,the average Neighbor Searching times can be reduced from eight to four.
该算法主要采用8-邻域搜索及排序队列方式实现,通过一次扫描二值图像即可完成连通区域标记。
6) multiple neighborhoods search
多邻域搜索
补充资料：超导电性的局域和非局域理论（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是非局域性的。为此，超导电性需由非局域性理论来描绘，称超导电性的非局域理论。皮帕德非局域理论就是典型的超导电性非局域唯象理论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条