助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   动态配流 在 铁路运输 分类中 的翻译结果: 查询用时:1.172秒
图标索引 在分类学科中查询
所有学科
铁路运输
公路与水路运输
自动化技术
更多类别查询

图标索引 历史查询
 

动态配流    
相关语句
  dynamic wagon-flow allocating
    Research on the Model and Algorithm of Dynamic Wagon-Flow Allocating in a Marshalling Station
    编组站动态配流模型与算法研究
短句来源
    How to select the favorable scheme out of a large number of break-up schemes is the core of the dynamic wagon-flow allocating problem for a marshalling station.
    如何从众多的解体方案中选择有利方案 ,这是编组站动态配流所要解决的核心问题。
短句来源
  dynamic wagon-flow allocating
    Research on the Model and Algorithm of Dynamic Wagon-Flow Allocating in a Marshalling Station
    编组站动态配流模型与算法研究
短句来源
    How to select the favorable scheme out of a large number of break-up schemes is the core of the dynamic wagon-flow allocating problem for a marshalling station.
    如何从众多的解体方案中选择有利方案 ,这是编组站动态配流所要解决的核心问题。
短句来源
查询“动态配流”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  dynamic assignment
Advanced planning concepts, such as dynamic assignment of dismantlers to logistic service providers, are analyzed using a simulation model.
      
A modelling system and associated expert modules: analyser, synthesiser and recogniser have been developed to perform the automatic and dynamic assignment of parts directly from a feature-based CAD modelling system to manufacturing cells.
      
A critical issue in DRC systems is the dynamic assignment of workers to the workstations.
      
The proposed worker flexibility policy is designed to evaluate the state of the system at periodic time intervals so that the dynamic assignment of workers to the workstations can be made in an efficient manner.
      
In this paper we present a dynamic assignment language which extends the dynamic predicate logic of Groenendijk and Stokhof [1991: 39-100] with ι assignment and with generalized quantifiers.
      
更多          


How to select the favorable scheme out of a large number of break-up schemes is the core of the dynamic wagon-flow allocating problem for a marshalling station. Based on Reference [3], this paper builds a scheme tree and presents the concept “the maximum possible residual amount”, generating a scheme value to control the growth of the tree, so that the favorable scheme can be searched by the backdating algorithm. Thus this paper, together with References [2] and [3], provides an integral train of thought and...

How to select the favorable scheme out of a large number of break-up schemes is the core of the dynamic wagon-flow allocating problem for a marshalling station. Based on Reference [3], this paper builds a scheme tree and presents the concept “the maximum possible residual amount”, generating a scheme value to control the growth of the tree, so that the favorable scheme can be searched by the backdating algorithm. Thus this paper, together with References [2] and [3], provides an integral train of thought and concrete methods for solving the wagon-flow allocating problem.

如何从众多的解体方案中选择有利方案 ,这是编组站动态配流所要解决的核心问题。本文在文献 [3 ]的基础上 ,运用组合数学原理构造方案树 ,提出最大可能剩余量概念 ,导出计算公式 ,并以此作为方案值控制树的生长 ,进而利用回溯算法搜索有利方案。这样 ,本文连同文献 [2 ]、[3 ]一起 ,为配流问题的全面解决提供了完整的思路和具体的计算方法

 
图标索引 相关查询

 


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

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