助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[1]页 共[19]条 当前为第1条到19条
 

相关语句
tabu search algorithms
Currently, the best available heuristic procedures for the CMST problem are tabu search algorithms due to Amberg et al.
      
Flexible job shop scheduling with tabu search algorithms
      
Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
      
Part type selection problem in flexible manufacturing systems: tabu search algorithms
      
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
      
Approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated.
      
We have developed intelligent heuristics - simulated annealing and tabu search algorithms for the design of unidirectional AGVSs.
      
Different versions of simulated annealing and tabu search algorithms are implemented.
      
Diversification strategies in tabu search algorithms for the maximum clique problem
      
Optimization of a high-speed placement machine using tabu search algorithms
      
Design and Evaluation of Tabu Search Algorithms for Multiprocessor Scheduling
      
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.
      
We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood.
      
Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems
      
Tabu Search Algorithms for Cyclic Machine Scheduling Problems
      
Tabu search algorithms are developed for solving a large class of cyclic machine scheduling problems with the objective to minimize the cycle time.
      
FIGURE 44.5 Diagram of the hybrid tabu search algorithms for the nurse rostering problem, plug-in for Figure 44.3.
      
Multi-start tabu search algorithms are used for all these problems.
      
The complexity analysis of the iterations of the respective tabu search algorithms follows.
      
 

首页上一页1下一页尾页 

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