助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   tabu search algorithm 在 数学 分类中 的翻译结果: 查询用时:0.176秒
图标索引 在分类学科中查询
所有学科
数学
电力工业
计算机软件及计算机应用
宏观经济管理与可持续发展
自动化技术
互联网技术
无线电电子学
公路与水路运输
企业经济
更多类别查询

图标索引 历史查询
 

tabu search algorithm     
相关语句
  禁忌搜索算法
    A Fuzzy Assignment Problem and Its Tabu Search Algorithm
    一类模糊指派问题及其禁忌搜索算法
短句来源
    Tabu Search Algorithm for Fuzzy Due Date Permutation Flow Shop Scheduling
    模糊交货期下置换Flow Shop调度的禁忌搜索算法
短句来源
    Tabu search algorithm for model 1│fuzzy│min sum from i=1 to n (C_i)
    1│fuzzy│min sum from i=1 to n (C_i)模型的禁忌搜索算法
短句来源
    The main results can be summarized as follows:(1) An improved continuous tabu search algorithm, ITS, is developed.
    1) 对连续禁忌搜索算法进行改进,提出了改进的算法ITS。
短句来源
    Modern optimization includes genetic algorithm, ant colony algorithm and tabu search algorithm.
    现代优化算法主要包括遗传算法、蚁群算法、禁忌搜索算法
短句来源
更多       
  tabu搜索算法
    Tabu Search Algorithm with Varying Neighborhood and Its Application to Job Shop Scheduling Problem
    变邻域结构Tabu搜索算法及其在Job Shop调度问题上的应用
短句来源
  禁忌算法
    Tabu search algorithm for optimization model of integration of job of 4th party logistics
    用禁忌算法求解第四方物流作业整合优化模型
短句来源
    A Tabu Search Algorithm for Vehicle Scheduling Problem with Time Windows
    有时间窗约束车辆调度优化的一种禁忌算法
短句来源
    Study on Multi-depot Vehicle Scheduling Problem with Time Windows and Multi-type Vehicle Limits and Its Tabu Search Algorithm
    多车场有时间窗的多车型车辆调度及其禁忌算法研究
短句来源
    A Capacitated Multi-commodity Network Design Problem with Side Constraints on Paths and Its Tabu Search Algorithm
    一种带路径约束的多商品流网络设计问题及其禁忌算法
短句来源
    Bi-level Optimization Model and Tabu Search Algorithm for Industry Location with Stochastic Price
    随机价格条件下的产业选址双层规划模型及其禁忌算法
短句来源
更多       
  “tabu search algorithm”译为未确定词的双语例句
    The Convergence Results for Tabu Search Algorithm
    关于Tabu Search算法收敛性的研究
短句来源
    Land Use Development Plan Based Genetic Algorithm and Tabu Search Algorithm
    基于GATS算法的城市土地使用规划问题研究
短句来源
    RECOVERY OF THE VRPTW DISRUPTION AND THE TABU SEARCH ALGORITHM
    VRPTW的扰动恢复及其TABUSEARCH算法
短句来源
    Genetic algorithm and tabu search algorithm are powerful tools for complicated large scale optimization problems.
    用遗传算法求解多目标优化问题的难点在于适应值函数难以定义。
短句来源
    In this paper the FR-TS algorithm which combines fletcher-reeves method and tabu search algorithm is improved by extending the concept of tabu area and introducing the tabu area expanding and tabu area connecting techniques.
    扩充禁忌区域的内涵,引入禁忌区域扩展与禁忌区域连接技术,有效地加速了全域范围寻优进程,从而改进和完善了FR-TS法,为其赋予了新的意义。
短句来源
更多       
查询“tabu search algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  tabu search algorithm
Numerical results show that the tabu search algorithm produces solutions close to a proposed lower bound.
      
In order to find a "good" solution, we propose a tabu search algorithm.
      
The proposed GA is compared with a tabu search algorithm.
      
Our tabu search algorithm seems to be effective both with respect to time and solution quality.
      
This solution is used to determine the neighborhood for our tabu search algorithm.
      
更多          


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 algorithm的内容
在知识搜索中查有关tabu search algorithm的内容
在数字搜索中查有关tabu search algorithm的内容
在概念知识元中查有关tabu search algorithm的内容
在学术趋势中查有关tabu search algorithm的内容
 
 

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