助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   tabu search algorithms 在 数学 分类中 的翻译结果: 查询用时:0.631秒
图标索引 在分类学科中查询
所有学科
数学
动力工程
电信技术
电力工业
计算机软件及计算机应用
公路与水路运输
无线电电子学
自动化技术
地质学
更多类别查询

图标索引 历史查询
 

tabu search algorithms
相关语句
  禁忌搜索算法
    (4) The improved tabu search algorithms, ITS and TS_SQP, are applied on the training of recurrent neural network.
    4) 将改进的禁忌搜索算法(ITS、TS_SQP)应用于反馈神经网络的训练。
短句来源
    (3) The improved tabu search algorithms ITS and TS_SQP are applied on system identification. The problems of system identification are transformed to optimization problems in parameter space, and then the ITS and TS_SQP algorithms are used to obtain the global optimal estimation of the system parameters.
    3) 将改进禁忌搜索算法(ITS、TS_SQP)应用于系统辨识,以改善传统的辨识办法存在局部极小等缺点,并实现了对包括滞后在内的所有参数同时辨识。
短句来源
    This paper studies the multiple objective assembly line balancing problem, discusses the reationship of the objectives, furthermore, designs a Tabu Search algorithms to solve the problem.
    文章研究了多目标装配线平衡问题 ,探讨了这些目标之间的联系 ,设计了禁忌搜索算法求解多目标装配线的平衡问题。
短句来源
  禁忌搜索算法
    (4) The improved tabu search algorithms, ITS and TS_SQP, are applied on the training of recurrent neural network.
    4) 将改进的禁忌搜索算法(ITS、TS_SQP)应用于反馈神经网络的训练。
短句来源
    (3) The improved tabu search algorithms ITS and TS_SQP are applied on system identification. The problems of system identification are transformed to optimization problems in parameter space, and then the ITS and TS_SQP algorithms are used to obtain the global optimal estimation of the system parameters.
    3) 将改进禁忌搜索算法(ITS、TS_SQP)应用于系统辨识,以改善传统的辨识办法存在局部极小等缺点,并实现了对包括滞后在内的所有参数同时辨识。
短句来源
    This paper studies the multiple objective assembly line balancing problem, discusses the reationship of the objectives, furthermore, designs a Tabu Search algorithms to solve the problem.
    文章研究了多目标装配线平衡问题 ,探讨了这些目标之间的联系 ,设计了禁忌搜索算法求解多目标装配线的平衡问题。
短句来源
查询“tabu search algorithms”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  tabu search algorithms
Tabu search algorithms are developed for solving a large class of cyclic machine scheduling problems with the objective to minimize the cycle time.
      
Tabu Search Algorithms for Cyclic Machine Scheduling Problems
      
Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems
      
We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood.
      
Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies.
      
更多          


Through deeper contrast and comparison between simulated annealing and tabu search algorithms the convergence for tabu search has been discussed in this article. How to evaluate the iteration numbers of tabu search has also been presented. It turns out that several tabu search ideas can be subjected to mathematical analyses similar to those applied to simulation annealing, which makes it possible to establish corresponding convergence properties based on a broader foundation....

Through deeper contrast and comparison between simulated annealing and tabu search algorithms the convergence for tabu search has been discussed in this article. How to evaluate the iteration numbers of tabu search has also been presented. It turns out that several tabu search ideas can be subjected to mathematical analyses similar to those applied to simulation annealing, which makes it possible to establish corresponding convergence properties based on a broader foundation.

对TabuSearch算法的收敛性进行了研究。并对TabuSearch算法运行的迭代次数与收敛性的关系进行了理论上的说明,从而使TabuSearch算法迭代次数的选取有了一定的估计。

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...

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

This paper presents a Tabu search based algorithm for optimum polygoal approximation of digital curves. For a maximal tolerable error between the approximation and the curve, the Tabu search algorithm finds a near optimal polygonal approximation with a minimal number of vertices. Compared to the famous Teh Chin algorithm, the algorithm has obtained the approximated polygon with less number of vertices and less error. Compared to the dynamic programming algorithm, the...

This paper presents a Tabu search based algorithm for optimum polygoal approximation of digital curves. For a maximal tolerable error between the approximation and the curve, the Tabu search algorithm finds a near optimal polygonal approximation with a minimal number of vertices. Compared to the famous Teh Chin algorithm, the algorithm has obtained the approximated polygon with less number of vertices and less error. Compared to the dynamic programming algorithm, the processing time of the algorithm is much less expensive. Experimental results have shown that the Tabu search has good performance in both fidelity and efficiency.

为在平面数字曲线的多边近似中克服顶点的检测只依靠局部区域、缺乏全局信息的弱点, 把多边形近似问题作为在一定的允许误差下寻找最少顶点数的最优化问题来处理。为能够处理点数较多的曲线, 采用Tabu 搜索来求近似最优解。和一些经典算法的实验比较表明, 与只依靠曲线局部特性的一类算法相比, 该算法在近似的保真性和效率上有明显的改进, 同时又比准确寻优一类的算法如动态规划等有大幅度的时间节省。

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

 


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

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