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

图标索引 历史查询
 

grading planning
相关语句
  分阶段规划
     The test results show that the model and algorithm are superior compared with the conventional grading planning method and have broad prospects for practical application.
     算例表明,该模型及算法相对于传统的分阶段规划法,具有一定的优越性,拥有实际应用前景。
短句来源
  分级规划
     Because of the complexity of solving the model, the two algorithms of grading planning are presented: start points in cutting contour are solved by using an improved nearest neighbor algorithm; when start points are determined, the problem of the path optimization turns into the traveling salesman problem (TSP), which is solved by using an high-efficiency intellectual biological algorithm--the ant colony system algorithm.
     由于求解该模型的复杂性 ,采用了分级规划的两个分步算法 :首先用改进的最近邻域算法求解轮廓边界线上的切割起点 ,然后当切割点确定后把路径优化问题归结为旅行售货员问题 (TSP) ,采用了高效的智能仿生算法——蚁群系统算法来求解。
短句来源
  相似匹配句对
     PLANNING FOR BOMBAY
     孟买的规划
短句来源
     PLANNING & UNCERTAINTY
     计划与不确定性
短句来源
     On grading of journals
     期刊等级评定反思
短句来源
     Study on Application of Agricultural Land Grading Outputs in Land Use Planning
     农用地分等成果在土地利用总体规划中的应用探讨
短句来源
     The output of agricultural land grading outputs is determined through studying land use planning.
     研究方法:剖析农用地分等过程及其产生的各种成果的内涵,根据土地利用总体规划内容,找出可应用的农用地分等成果。
短句来源
查询“grading planning”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Layer manufacturing time in laminated object manufacturing (LOM) technology is determined by the cutting speed and cutting path of each layer. When the parameters of cutting process such as cutting power and cutting speed are defined, the manufacturing time of each layer is determined by the cutting (scanning) path. So it is most important to optimize the cutting path in order to improve the manufacturing efficiency. In LOM technology, laser cutting path optimization is in fact vacancy course path optimization....

Layer manufacturing time in laminated object manufacturing (LOM) technology is determined by the cutting speed and cutting path of each layer. When the parameters of cutting process such as cutting power and cutting speed are defined, the manufacturing time of each layer is determined by the cutting (scanning) path. So it is most important to optimize the cutting path in order to improve the manufacturing efficiency. In LOM technology, laser cutting path optimization is in fact vacancy course path optimization. The mathematical model of vacancy course path optimization is set up in this paper. Because of the complexity of solving the model, the two algorithms of grading planning are presented: start points in cutting contour are solved by using an improved nearest neighbor algorithm; when start points are determined, the problem of the path optimization turns into the traveling salesman problem (TSP), which is solved by using an high-efficiency intellectual biological algorithm--the ant colony system algorithm. The results of algorithm show that the algorithm remarkably shortens vacancy course in LOM and the manufacturing efficiency of rapid prototyping is improved.

分层实体制造 (L OM)技术中分层制造时间是由该层的切割速度与切割路径确定的 ,当切割工艺参数 (如 :切割功率、切割速度 )确定之后 ,每一层制造的时间是由该层切割 (扫描 )路径确定的。因此优化切割 (扫描 )路径对提高成型效率有重要意义 ,而分层实体制造技术中激光切割路径优化的实质是空行程路径的优化。建立了切割路径空行程路径优化的数学模型。由于求解该模型的复杂性 ,采用了分级规划的两个分步算法 :首先用改进的最近邻域算法求解轮廓边界线上的切割起点 ,然后当切割点确定后把路径优化问题归结为旅行售货员问题 (TSP) ,采用了高效的智能仿生算法——蚁群系统算法来求解。运行结果表明 ,该算法显著缩短了分层制造中的空行程 ,提高了快速原型制造的效率。

Seeking a more rational and effective planning method has all along been the target of researchers and engineers working on the planning of the distribution network of power systems. This paper presents an optimization model and its corresponding algorithm by making an overall consideration of the location and capacity of substations and the network, including all sorts of constraints. The model unifies the sub-problem of location and capacity optimization of substations and that of network optimization to yield...

Seeking a more rational and effective planning method has all along been the target of researchers and engineers working on the planning of the distribution network of power systems. This paper presents an optimization model and its corresponding algorithm by making an overall consideration of the location and capacity of substations and the network, including all sorts of constraints. The model unifies the sub-problem of location and capacity optimization of substations and that of network optimization to yield the results at the same time. The test results show that the model and algorithm are superior compared with the conventional grading planning method and have broad prospects for practical application.

寻求一种更加科学合理且有效的规划方法一直是配电网规划研究者及工程技术人员的目标。文中提出了一种多约束条件下综合考虑变电站站址、站容和网架的优化模型和算法。该模型把变电站优化子问题与网架优化子问题结合起来统一优化,实现最优变电站站址、站容和最优网架的同时确定。算例表明,该模型及算法相对于传统的分阶段规划法,具有一定的优越性,拥有实际应用前景。

 
图标索引 相关查询

 


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

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