助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   soft time 的翻译结果: 查询用时:0.008秒
图标索引 在分类学科中查询
所有学科
数学
公路与水路运输
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

soft time
相关语句
  软时间
     Parallel Genetic Algorithm for Vehicle Routing Problems with Soft Time Windows of Logistic Distribution
     带软时间窗物流配送车辆路径问题的并行遗传算法
短句来源
     Vehicle Scheduling Problem with Soft Time Windows Based on Immune Algorithm
     基于免疫算法的带软时间窗车辆调度问题
短句来源
     Vehicle routing problem with soft time windows(VRPSTW) is a variation of vehicle routing problem(VRP), which is a typical NP-hard problem.
     带软时间窗的车辆路径问题 (VRPSTW)是在基本的车辆路径问题 (VRP)上增加了时间窗约束条件的一种变化形式 ,是一个典型的 NP-难问题。
短句来源
     Model and Algorithms for Mixed Fleet Vehicle Routing Problem with Soft Time Windows
     带软时间窗的混合车队车辆路线问题的模型和算法研究
短句来源
     An Improved Genetic Algorithm for Vehicle Routing Problem with Soft Time Windows
     求解带软时间窗的车辆路径问题的改进遗传算法
短句来源
更多       
  “soft time”译为未确定词的双语例句
     This problem is regarded as the Vehicle Routing Problem with Soft Time Windows (VRPSTW).
     此类问题被称为软时窗汽车路线问题(Vehicle Routing Problemwith Soft Time Windows)。
     Optimization of ship scheduling with soft time windows
     基于时间窗的船舶挂港顺序优化
短句来源
  相似匹配句对
     Time is...
     时间
短句来源
     Time
     时间(英文)
短句来源
     TIME-CONSOLIDATION EFFECT OF SOFT SOIL
     软土的时效固化效应
短句来源
     Optimization of ship scheduling with soft time windows
     基于时间窗的船舶挂港顺序优化
短句来源
     Soft Lithography
     软印刷技术
短句来源
查询“soft time”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  soft time
A large proportion of those referred from prisons have consciously manipulated their transfer in order to do "soft time." This also confers on them future advantage by virtue of being labelled more mental than criminal.
      
Using mobile technologies for delivering in a hard or soft time-window environment 8.
      
The time the task completes depends on the implementation, but the soft-time must be less than the real-time deadline.
      
These test problems highlight the time penalty coefficient that impacts the behavior of soft time windows constraint.
      
Real-time programming models differ in the mapping of soft-time to real-time.
      


The typical vehicle routing problem is expanded to the situation that customers have the restriction of soft time windows and a depot has various kinds of vehicles to distribute. After constructing a mathematical model for the problem, this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem. And then, combined with the adaptive memory procedure, the pseudo-code description of rs algorithm and an example are presented.

将典型的车辆路线问题扩展为综合考虑了客户具有软时间窗约束和中央仓库拥有多种类型配送车辆的情况。在构造了问题的数学模型后,着重阐述了求解本问题的TS算法设计过程。最后结合适应性记忆过程给出了TS算法的伪代码描述和一个算法。

As it's a vehicle scheduling problem with soft time windows, we established two multiple objective programming models to satisfy different practical conditions: double parking lot model and single parking lot model. The main objective of the former was to match the capacity of passengers holding with the real demand, while the objective of the latter was to minimize the average inconvenience of passengers and the cost of transit companies. Both of the two models considered for benefits of both passengers...

As it's a vehicle scheduling problem with soft time windows, we established two multiple objective programming models to satisfy different practical conditions: double parking lot model and single parking lot model. The main objective of the former was to match the capacity of passengers holding with the real demand, while the objective of the latter was to minimize the average inconvenience of passengers and the cost of transit companies. Both of the two models considered for benefits of both passengers and companies. By using the method of step by step time, we simulated the practical procedure and drew two dispatching plans: static dispatching and dynamic dispatching.

本题为带软时间窗的单线路单车型的公交调度问题 ,针对其多目标、多变量的动态特点 ,我们为满足不同的实际需求建立两个多目标规划模型 :双车场模型和单车场模型。双车场模型的主要目标是使运客能力与运输需求 (实际客运量 )达到最优匹配 ,单车场模型的主要目标是使乘客的平均不方便程度和公交公司的成本达最小 ,其目的都是为了兼顾乘客与公司双方的利益。两个模型的主体都是采用时间步长法 ,模拟实际的运营过程 ,从而得出符合实际要求的调度方案 :静态调度和动态调度方案。

Vehicle routing problem with soft time windows(VRPSTW) is a variation of vehicle routing problem(VRP), which is a typical NP-hard problem. In this paper, we describe an improved GA for the VRPSTW, in which a new coding method, the adaptive mechanism of crossover and mutation, and penalty function are introduced. Computational results on a set of benchmark problems show that the procedure is efficient.

带软时间窗的车辆路径问题 (VRPSTW)是在基本的车辆路径问题 (VRP)上增加了时间窗约束条件的一种变化形式 ,是一个典型的 NP-难问题。通过引用一种新的编码方法、交叉和变异概率的自适应机制 ,构造一个改进的遗传算法来求解 VRPSTW,并将求解结果与其他遗传算法比较。比较结果显示 ,该算法具有较好的性能

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

 


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

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