助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   the tabu search algorithm 的翻译结果: 查询用时:0.217秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

the tabu search algorithm
相关语句
  tabu搜索算法
     A COMPARISON BETWEEN THE RANDOMIZED HOUGH TRANSFORMATION AND THE TABU SEARCH ALGORITHM IN GEOMETRIC PRIMITIVE EXTRACTION
     随机Hough变换与Tabu搜索算法在基元提取中的比较
短句来源
     In this method, considering the features of distribution network, i.e., interconnected meshed network in design and radial tree structure in operation, the optimal encoding method in genetic algorithm (GA) is led into the Tabu search algorithm and the minimization of active power loss is used as the objective function.
     该方法结合配电网络的闭环设计和开环运行的特点,将遗传算法中的优化编码技术引入到Tabu搜索算法中,并以有功网损最小为目标函数对配电网络进行优化。
短句来源
     Expectation maximization (EM) algorithm is usually used to estimate parameters of Gaussion mixture models (GMM). The method using fuzzy clustering algorithm to get GMM parameters was researched, the tabu search algorithm was fused to estimate more accurate parameters, and the training process of GMM was optimized.
     为了研究模糊聚类算法在高斯混合模型(GMM)参数荻取方面的应用,采用模糊C均值算法(FCM)进行语音特征矢量的聚类,并结合Tabu搜索算法得到全局最优的聚类结果,进一步用EM算法得到GMM模型参数。
短句来源
     The tabu search algorithm is introduced into the distribution network planning to overcome the low speed of the conventional mathematic method solving the problem of distribution network optimization planning.
     针对常规数学方法求解配电网优化规划问题时速度慢的缺点,引入具有快速搜索能力的Tabu搜索算法
短句来源
  “the tabu search algorithm”译为未确定词的双语例句
     Against the limitation of the traditional mathematical programming to deal with the transit network system optimization,a simulation optimization model based on the tabu search algorithm was designed.
     针对传统数学规划方法处理公共交通网络系统优化存在的局限性,设计了一种基于禁忌算法的仿真优化模型。
短句来源
     The simulation results show that in the combinational algorithm, which combines the tabu search algorithm with SA algorithm, the feature of large scale search of SA algorithm and the powerful local search ability of tabu search algorithm is effectively combined and the high quality optimized solution of the system can be quickly searched.
     仿真结果表明,tabu-SA组合算法有效地结合了SA算法的大规模寻优特性和tabu搜索的局部搜索能力强的特点,能快速搜索到高质量的系统优化解。
短句来源
     Methods for optimization design of discrete variables are summarized. The tabu search algorithm and its application to the optimization design of discrete variables are presented and explained by an example.
     概述了离散变量优化方法 ,介绍了禁忌搜索算法及其在离散优化设计中的应用 ,并用实例说明之。
短句来源
     Among various tools of solving the high dimension combination optimization problems,the genetic algorithm(GA) has a better overall search ability,whereas the tabu search algorithm(TS) is superior in the partial search aspect.
     在众多解决高维组合优化问题的工具中,遗传算法具有较好的全局搜索能力,而禁忌搜索算法则在局部搜索方面优势明显。
短句来源
     The tabu search algorithm for JIT oriented production scheduling is studied and designed. The neighbourhoods and the tabu list based on the process blocks are designed. The search strategy is designed on the two dynamic key routes.
     研究和设计了面向准时制生产作业计划的禁忌搜索详细算法,论述了该算法的基于工序块的邻域设计、禁忌表设计以及在两条变动的关键路线上所做的邻域搜索策略设计.最后以准时制生产为目标,归纳出了考虑长期记忆功能的禁忌搜索算法步骤,并采用VisualFoxpro 5.0 编程实现了该算法.
短句来源
更多       
  相似匹配句对
     Here ,Tabu Searchalgorithmisusedtoseekapproximatesolution .
     并用禁忌搜索算法 ,求出其近似解 .
短句来源
     SHOOT WITH NO TABU
     摄无禁忌 富士S9600 VS.松下FZ50
短句来源
     Research on Tabu Search with Its Parallelization
     禁忌搜索及其并行化研究
短句来源
     The Research of Imrovement Tabu Search Algorithm in
     改进禁忌搜索算法在地区电网故障诊断中的研究
短句来源
     Research on the Tabu-Hierarchy Genetic Algorithm
     禁忌-递阶遗传算法研究
短句来源
查询“the tabu search algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  the tabu search algorithm
Numerical results show that the tabu search algorithm produces solutions close to a proposed lower bound.
      
This genetic algorithm also outperforms the tabu search algorithm proposed in the literature for the same problem.
      
Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.
      
In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP).
      
The tabu search algorithm proposed performs much better than a local search.
      
更多          


Time modify and tabu search algorithms are realized in job shop rescheduling. The operations starting and completion time are calculated in the time modify algorithm when the sequence and all processing times are known. It can be applied to inflexible rescheduling. When the disturbance occurs, the affected operations time parameters can be modified. The tabu search algorithm used to solve combination optimization problem is applied to flexible rescheduling. When the disturbance...

Time modify and tabu search algorithms are realized in job shop rescheduling. The operations starting and completion time are calculated in the time modify algorithm when the sequence and all processing times are known. It can be applied to inflexible rescheduling. When the disturbance occurs, the affected operations time parameters can be modified. The tabu search algorithm used to solve combination optimization problem is applied to flexible rescheduling. When the disturbance occurs, the number of affected jobs is decided and the jobs on the substitute machine are resequenced. The experiment shows that the two algorithms can be used to solve rescheduling in all operations.

针对单件车间生产作业计划的再生问题,用VisualFoxpro开发了一个时间调整算法和实现了禁忌搜索算法.当干扰发生时,前者用于无可替代机床情况下对受影响工序的开工时间和完工时间的调整;后者用于有可替代机床情况下对在替代机床上加工工件的排序.实验表明,它们能较好地解决各种情况下生产作业计划再生问题.

The tabu search algorithm for JIT oriented production scheduling is studied and designed. The neighbourhoods and the tabu list based on the process blocks are designed. The search strategy is designed on the two dynamic key routes. The detailed steps of tabu search algorithm are given. These parts and factors of tabu search algorithm are coded successfully through Visual Foxpro 5.0.

研究和设计了面向准时制生产作业计划的禁忌搜索详细算法,论述了该算法的基于工序块的邻域设计、禁忌表设计以及在两条变动的关键路线上所做的邻域搜索策略设计.最后以准时制生产为目标,归纳出了考虑长期记忆功能的禁忌搜索算法步骤,并采用VisualFoxpro 5.0 编程实现了该算法.

The Hough transformation has been a widely used in geometric primitive extraction.It relies basically on an evidence accumulation process.Recently a new family of techniques,namely the optimization based one was proposed which resorts mainly to repeated cost function evaluation process.The randomized Hough transformation and the Tabu search algorithm are the two good representatives of the the Hough family and optimization based family respectively.Although some piecemeal works exist,a systematic comparison...

The Hough transformation has been a widely used in geometric primitive extraction.It relies basically on an evidence accumulation process.Recently a new family of techniques,namely the optimization based one was proposed which resorts mainly to repeated cost function evaluation process.The randomized Hough transformation and the Tabu search algorithm are the two good representatives of the the Hough family and optimization based family respectively.Although some piecemeal works exist,a systematic comparison between these two families of techniques is unavailable in the literature.In this paper,based on a reasonable criterion,namely the expected number of random samples of minimum subset for a single successful primitive extraction,the performance of between the randomized Hough transform and the Tabu search algorithm is compared.The paper shows that the randomized Hough transformation generally outperforms the Tabu search algorithm.In particular,based on a large number of simulations and experiments with real images,it shows that with a comparable performance,the randomized Hough transformation is about twice as fast as the Tabu search algorithm for both line extraction and circle extraction.

Hough变换(HT)是目前应用最广的几何基元提取方法,其基本思想在于通过证据积累来提取基元.最近不少人又提出了通过代价函数的全局优化来提取几何基元的思想.随机Hough变换(RHT)和Tabu搜索(TS)分别是Hough变换和优化方法中的佼佼者.RHT和TS分别基于不同的策略,两种方法的相互比较在许多文献中已有提及,但目前尚无较完整的理论分析和系统的比较.本文在提取单个基元所需对最小点集的采样次数的期望值这一准则的基础上,对两种方法进行了比较.分析表明,随机Hough变换通常要优于Tabu搜索.从我们做的大量仿真和实际图像的实验也可看出,在提取的基元正确率相同的情况下,RHT约比TS快1—2倍.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关the tabu search algorithm的内容
在知识搜索中查有关the tabu search algorithm的内容
在数字搜索中查有关the tabu search algorithm的内容
在概念知识元中查有关the tabu search algorithm的内容
在学术趋势中查有关the tabu search algorithm的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社