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

图标索引 历史查询
 

complete优化
相关语句
  “complete优化”译为未确定词的双语例句
     Vehicle routing problem with time windows(VRPTW) is an NP-complete optimization problem.
     带时间窗口的车辆路径问题(VRPTW)是一个NP-Complete优化问题。
短句来源
  相似匹配句对
     Using optimization principl
     优化;
短句来源
     The main problem facing us now is to determine the aims and the ways of the optimization.
     如何优化 ?
短句来源
     Vehicle routing problem with time windows(VRPTW) is an NP-complete optimization problem.
     带时间窗口的车辆路径问题(VRPTW)是一个NP-Complete优化问题。
短句来源
     The maximum clique problem is one of the classic NP-complete problems from combinatorial optimization.
     最大团问题是组合优化中的一个经典的NP-Complete问题。
短句来源
查询“complete优化”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  complete optimization
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.
      
Quantum-chemical calculations of a trans-octahedral complex of SiCl4 with pyridine involving complete optimization of its geometry and variation of the coordinate of the complex-formation reaction were fulfilled by the RHF/6-31G(d) method.
      
Quantum-chemical calculations of the systems SiCl4←OP[N(CH3)2]3 and SiCl4←2OP[N(CH3)2]3 with complete optimization of their geometry at various Si←O distances were performed by the RHF/6-31G(d) method.
      
The complete optimization of the geometry of molecules in compound I and unsubstituted 2-(2'-tosylaminophenyl)-4H-3,1-benzoxazin-4-one in the ground singlet electronic state is performed by the semiempirical method with the MOPAC program.
      
Complete optimization of a discrete stochastic numerical procedure for globally estimating the solution of an integral equation
      
更多          


Vehicle routing problem with time windows(VRPTW) is an NP-complete optimization problem.The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customer with fixed demand and time window constraints.A parallel multiple ant colony system(PMACS-VRPTW) is proposed to solve this problem.QUICS-ACS is used to generate the initial solution,then ACS-VEI and ACS-TIME are used to optimize the vehicle number and travel distance seperately.Numerical results shows that the proposed...

Vehicle routing problem with time windows(VRPTW) is an NP-complete optimization problem.The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customer with fixed demand and time window constraints.A parallel multiple ant colony system(PMACS-VRPTW) is proposed to solve this problem.QUICS-ACS is used to generate the initial solution,then ACS-VEI and ACS-TIME are used to optimize the vehicle number and travel distance seperately.Numerical results shows that the proposed algorithm is very effective on Solomon's benchmarks of VRPTW.

带时间窗口的车辆路径问题(VRPTW)是一个NP-Complete优化问题。VRPTW的主要目标在于利用最少的车辆数以及最短的行程来服务客户,客户有固定的需求和被服务的时间限制。基于该问题提出了一种并行多蚁群算法(PMACS-VRPTW):首先利用QUICK-ACS生成初始解,然后利用ACS-VEI和ACS-TIME分别优化车辆数和行程距离。试验表明,所提出的算法基于Solomon的VRPTW基准实例获得了很好的结果。

 
图标索引 相关查询

 


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

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