助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   tabu search ts 的翻译结果: 查询用时:0.193秒
图标索引 在分类学科中查询
所有学科
电力工业
更多类别查询

图标索引 历史查询
 

tabu search ts
相关语句
  相似匹配句对
     Tabu search(TS) algorithm is a meta-heuristic algorithm.
     禁忌搜索算法(tabu search, TS)是一种亚启发式搜索算法。
短句来源
     Research on Tabu Search with Its Parallelization
     禁忌搜索及其并行化研究
短句来源
     On Search
     论搜查
短句来源
     Tabu Search with Stochastic Simulation of Stratified Sampling Intelligently Integrated (TS II)
     基于分层抽样的模拟禁忌混合智能优化算法TSII
短句来源
     Tabu Search (TS) is a novel intelligence optimization algorithm, which was formally proposed by Prof.
     禁忌搜索(Tabu Search或Taboo Search,TS)是一种新的智能优化算法,由美国科罗拉多大学系统科学家Glover教授于1986年正式提出。
短句来源
查询“tabu search ts”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  tabu search ts
We provide two solutions, one is an optimal solution using an Integer Linear Program (ILP) model, and the other is an algorithm based on the Tabu Search (TS) methodology.
      
This approach combines the characteristics of modern metaheuristics such as scatter search (SS), genetic algorithms (GAs), and tabu search (TS) and named as hybrid scatter genetic tabu (HSGT) search.
      
In a similar domain, Tabu search (TS) constitutes a meta-procedure that organizes and directs the operation of a search process.
      
In this paper we discuss the use of three local search strategies within a tabu search (TS) method for the approximate solution of a single machine scheduling problem.
      
It is a hybrid metaheuristic merging Variable Neighborhood Search (VNS) and Tabu Search (TS) principles and exploiting the synergies between the two.
      
更多          


Tabu Search(TS) is a metaheuristic viewed as an integration of management science and artificial intelligence, it is an efficient method for combinatorial optimization problem. In this paper, we solve parallel machine minimizing the number of tardy jobs problem using TS, and compare it to the best heuristic found so far, computational results show its efficiency.

禁忌搜索方法(TS)是一种将人工智能技术引入管理中的一种高于一般启发式算法的智能化“超启发式”算法,它能有效地解决大型组合优化问题。本文用TS方法解决最小化拖期任务数的并行多机调度问题,并同目前最好的启发式作了比较,大量实验表明了TS方法的有效性。

In this paper, a new approach to alarm processing in power systems based upon the set covering theory and Tabu search (TS) method is proposed. The main contributions of this paper consist of the following two aspects:(a) A new criterion describing the alarm processing problem is proposed, and a 0 ̄1 integer programming model is then obtained.(b) A new approach is developed to solve this problem using a TS based method. Two examples are served for demonstrating the feasibility and efficiency...

In this paper, a new approach to alarm processing in power systems based upon the set covering theory and Tabu search (TS) method is proposed. The main contributions of this paper consist of the following two aspects:(a) A new criterion describing the alarm processing problem is proposed, and a 0 ̄1 integer programming model is then obtained.(b) A new approach is developed to solve this problem using a TS based method. Two examples are served for demonstrating the feasibility and efficiency of the developed method. The test results suggest that the developed TS based method is efficient, and of promise for practical application.

提出了基于覆盖集理论(setcoveringtheory)和Tabu搜索(Tabusearch——TS)方法的电力系统警报处理的一种新方法。以覆盖集理论为基础,首先把电力系统警报处理问题表示为0-1整数规划问题,引入了一种新的评估指标。之后,提出了用TS方法来求解这一问题。两个算例系统的计算结果证明,所发展的数学模型是正确的,提出的以TS为基础的方法比现有的以遗传算法(geneticalgorithm——GA)为基础的方法更为有效

篢ransmission network optimal planning prob-lem is a nonlinear, large scale combinatorial optimizationproblem. Although this problem has been extensively stud-ied, it is still not well solved. ln recent years, there is anenormous amount of interest in the applications of Genetic Al-gorithms (GA), Simulated Annealing (SA) and Tabu Search(TS) for solving some difficu1t or poorly characterized opti-mization problems with multi-medal or combinatorial nature.These methods are generally called II...

篢ransmission network optimal planning prob-lem is a nonlinear, large scale combinatorial optimizationproblem. Although this problem has been extensively stud-ied, it is still not well solved. ln recent years, there is anenormous amount of interest in the applications of Genetic Al-gorithms (GA), Simulated Annealing (SA) and Tabu Search(TS) for solving some difficu1t or poorly characterized opti-mization problems with multi-medal or combinatorial nature.These methods are generally called II medern heuristic" tech-niques. The applications of GA and SA in solving the trans-mission network optimal planning problem are reported re-cently. TS is emerging as a new, highly efficient, searchparadigm for quickly finding high quality solutions to combi-natorial optimization problems. It is characterized by gather-ing konwledge during the search, and subsequently profitingfrom this knowledge. In this paper, the authors investigatethe application of TS to the transmission network optimalplanning problem, and develop the mathematical model andsolution algorithm. The test results for three sample systems,although preliminary, have verified the feasibility and effi-ciency of the developed TS based transmission network opti-mal planning method.

输电系统最优规划问题是一个复杂的非线性组合优化问题,至今未得到很好的解决。Tabu搜索(TS-TabuSearch)方法是近年来出现的用于求解组合优化问题的一种高效的启发式搜索技术。本文尝试了应用TS方法来解决输电系统最优规划问题,发展了相应的数学模型和其法。3个算例系统的计算结果证明了这种方法的可行性。

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

 


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

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