1) iterated local search
迭代局部搜索
1.
An evolutionary iterated local search algorithm with the features of multiple neighborhood structures and population-based evolution is designed to solve the model.
提出了一种基于多个邻域结构和种群进化策略的进化迭代局部搜索算法,用于求解该模型。
2.
Finally, we present an iterated local search document clustering alglrithm based on K-medoid, which uses the improved K-medoid do.
最后,将该改进算法作为局部搜索过程嵌入到迭代局部搜索结构中,构造一个基于K中心点的迭代局部搜索文档聚类算法,进一步改进了文档聚类结果。
3.
This paper presents an Iterated Local Search document clustering algorithm based on K-means, it takes the solution by K-means algorithm as its initial solution, from which local search process is started; during the searching, some bad solutions are accepted.
本文提出一个基于K-均值的迭代局部搜索文档聚类算法。
2) Genetic-Iterative Local Search
遗传-迭代局部搜索
1.
This paper defines the average keystrokes of English words and Chinese Pinyin, and rearranges the mobile telephone keyboard layout by Genetic-Iterative Local Search using it as a meteyard.
本文定义单词(拼音)的平均输入码长,以平均输入码长作为评价标准,用遗传-迭代局部搜索算法(IGA)寻找优化的手机键盘布局,用模拟退火、禁忌策略等优化方法增强算法搜索能力和搜索速度。
3) iterated local search algorithm
迭代局部搜索算法
1.
Local search and perturbation are analyzed,which are the key techniques of iterated local search algorithm.
为了解决混合蚁群优化算法存在的问题,研究了当前求解组合优化问题性能表现最好的迭代局部搜索算法,并分析了其关键技术——局部搜索和扰动;通过将局部搜索和扰动分别用于增强蚂蚁系统算法的开发能力和探索能力,提出了一种基于蚁群优化的混合智能算法。
4) Iterated local search
迭代局域搜索
1.
For this problem,it presents a new iterated local search algorithm based on dynasearch neighborhood with the following characters: 1) While traditional local search algorithms make a single move at each iteration,dynasearch allows a series of i.
提出该问题新的基于dynasearch邻域的迭代局域搜索算法(ILS)。
2.
In the second phase,we construct improved dynasearch algorithm for VRP,and combine dynasearch with the iterated local search algorithm,which is named as iterated dynasearch algorithm.
这两类策略均采用两阶段的思想:第一阶段,利用节约法对顾客进行聚类;第二阶段,构造适合求解VRP的改进dynasearch算法,且将基于随机kick的迭代局域搜索算法与改进dynasearch算法相结合,提出了迭代dynasearch算法。
5) iterative search
迭代搜索
6) iterative local search algorithm
迭代局域搜索算法
1.
An iterative local search algorithm (ILS) is presented and implemented which is based on random kick strategy to solve the flowshop scheduling problem with finite intermediate storage (FSFIS).
提出了一种基于随机kick的迭代局域搜索算法(ILS)求解存储容量受限的流水车间问题(FSFIS)·该算法使用新颖的多对不交叉的交换移动构成kick移动,并采用回溯机制保证搜索在有利的空间内进行·通过应用4种邻域结构,每种情况下产生480组随机数据的试验证明该新型算法是快速有效的近优算法·设计了一种在原有的静态禁忌搜索算法中引入了基于随机kick的迭代局域搜索算法的混和算法,这种混合算法可以充分发挥原有的2种算法的各自优势,使目标函数进一步改进
补充资料：“龙钮玉押”上的龙钮局部(元代)
为清宫旧藏，为元帝御用器，据传元代高层贵族多部识或不会写汉字，凡印记符押皆用符号替代。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条