助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   飞机排班 的翻译结果: 查询用时:0.013秒
图标索引 在分类学科中查询
所有学科
航空航天科学与工程
数学
更多类别查询

图标索引 历史查询
 

飞机排班
相关语句
  aircraft assignment
     Mathematical programming model of aircraft assignment
     飞机排班数学规划模型
短句来源
  aircraft-arrangement
     Application of Ant Algorithm in Aircraft-arrangement Problem inCivil Aviation
     蚂蚁算法在民航飞机排班问题中的应用
短句来源
  aircraft dispatching problem
     Fixed Job Scheduling Model and Algorithm of Airline Aircraft Dispatching Problem
     航空公司飞机排班问题的排序模型及算法
短句来源
     Airliner aircraft dispatching problem: Heuristic algorithm based on stage-assignment
     航空公司飞机排班问题的分阶段指派算法
短句来源
  “飞机排班”译为未确定词的双语例句
     Airline Tail Number Assignment Problem: Model and Algorithm
     航空公司飞机排班问题:模型及算法研究
短句来源
     Tail-Number-Assignment Problem of Airliners Based on Fleet Balance Application
     基于均衡使用要求的飞机排班算法
短句来源
     Based on analyzing the status of domestic airline operational planning system, this dissertation determines the study subject as Tail-Number-Assignment (TNA) Problem.
     本文在深入分析当前国内各航空公司生产计划工作现状的基础上,选择了飞机排班计划作为研究课题,通过系统分析飞机排班工作的流程和要求,提出了描述飞机排班问题的数学模型。
短句来源
     1. On the basis of operational characters of domestic airline by now, a mathematical model describing TNA problem is constructed, and by classifying a specific TNA problem into one of three typical TNA modes, corresponding heuristic algorithms are reconstructed. This research supplies a domestic gap in this field.
     1.根据当前国内航空公司的运营组织模式特点,以及飞机排班工作的实际需求,提出了描述飞机排班问题的数学模型,并通过将一般形式的飞机排班问题归结为三种典型的飞机排班模式,构造出相应的启发式算法,填补了国内在此领域的研究空白。
短句来源
     2. When solving the TNA problem based on fleet dispatching commands, a Stage-Assignment algorithm is build to overcome the defect of FIFO algorithm, which can be widely applied to cope with fixed job scheduling problem.
     2.在解决基于飞机调度指令要求的飞机排班问题时,本文提出的分阶段指派算法较好地克服了标号算法的缺陷,该算法能普遍地应用于处理类似的固定工件排序问题。
短句来源
更多       

 

查询“飞机排班”译词为其他词的双语例句

     

    查询“飞机排班”译词为用户自定义的双语例句

        我想查看译文中含有:的双语例句
    例句
    为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
      aircraft assignment
    We have modeled aircraft assignment as a CSP, and reassignment of aircraft thus requires finding alternative solutions to the CSP.
          


    On the basis of analyzing operational management method in Chinese airlines, a fixed job scheduling model for aircraft dispatching problem in single hub and spoke network are constructed, and the corresponding labeling algorithm is found. First, a new concept called “flight pairing” is defined, by which the aircraft flight dispatching problem is transferred to an aircraft flight pairing assignment problem which can be modeled by applying fixed job scheduling theory; Secondly, a labeling function of flight...

    On the basis of analyzing operational management method in Chinese airlines, a fixed job scheduling model for aircraft dispatching problem in single hub and spoke network are constructed, and the corresponding labeling algorithm is found. First, a new concept called “flight pairing” is defined, by which the aircraft flight dispatching problem is transferred to an aircraft flight pairing assignment problem which can be modeled by applying fixed job scheduling theory; Secondly, a labeling function of flight pairing and an aircraft labeling function are introduced; then the labeling algorithm is presented according to the rule “First In First Out”; Finally, an example is analyzed to demonstrate the application of this algorithm. The computerizing complexity of this algorithm is O(mn) .

    针对国内航空公司运营管理的特点 ,提出了描述单枢纽航线结构下飞机排班问题的排序模型及算法。首先通过引入航班节概念 ,将飞机对航班的安排问题转化为飞机对航班节的安排问题 ,并运用固定工件排序理论建立起描述该问题的数学模型 ,然后根据“先到先服务”的规则并通过引入航班节标号函数和飞机标号函数设计了一种标号算法 ,该算法的计算复杂性为 O( mn)。通过对一个算例的分析说明了该算法的应用

    On the basis of analyzing operational management method in Chinese airliners, an fixed job scheduling model for aircraft dispatching problem in single hub and spoke network is constructed, and a heuristic algorithm called stage_assignment is found. First, a new concept called "flight pairing" is defined, by which the aircraft_flight dispatching problem is transferred to an aircraft_flight pairing assignment problem which can be modeled by applying fixed job scheduling theory. Secondly, by defining "departure...

    On the basis of analyzing operational management method in Chinese airliners, an fixed job scheduling model for aircraft dispatching problem in single hub and spoke network is constructed, and a heuristic algorithm called stage_assignment is found. First, a new concept called "flight pairing" is defined, by which the aircraft_flight dispatching problem is transferred to an aircraft_flight pairing assignment problem which can be modeled by applying fixed job scheduling theory. Secondly, by defining "departure event" and "arrival event" of flight_pairing, we determine the "departure stage" and "arrival stage" to which each flight_pairing belongs. Then we apply Hungarian algorithm to assigning departure flight_pairings on the same stage to corresponding aircraft. Finally, an example is analyzed to demonstrate the application of this algorithm. The computational complexity of this algorithm is O(m2n2).

    针对国内航空公司运营管理的特点,提出了描述单枢纽航线结构下飞机排班问题的排序模型并构造了一种分阶段指派算法.首先通过引入航班节概念,将飞机对航班的安排问题转化为飞机对航班节的安排问题,然后在定义航班节的"出发事件"和"到达事件"的基础上,分析航班节的出发阶段属性和到达阶段属性,并运用Hungarian算法对各阶段的出发航班节进行指派,该算法的计算复杂性为O(m2n2).最后通过对一个算例的分析说明了该算法的应用.

    Based on analyzing the characters of single hub and spokes network ,which is used in China airliners, and the principles and working flow of aircraft tail number assignment(TNA) problem, studying the mathematical models of aircraft TNA problem, this paper introduced a new concept called "flight pairing", put forward a new TNA model, which classified a specific TNA problem into one of three typical TNA modes, TNA based on fleet dispatching commands, TNA based on fleet balance application, TNA based on minimum...

    Based on analyzing the characters of single hub and spokes network ,which is used in China airliners, and the principles and working flow of aircraft tail number assignment(TNA) problem, studying the mathematical models of aircraft TNA problem, this paper introduced a new concept called "flight pairing", put forward a new TNA model, which classified a specific TNA problem into one of three typical TNA modes, TNA based on fleet dispatching commands, TNA based on fleet balance application, TNA based on minimum fleet requirement. Applied results show that the error of TNA is only 4.8 min, the time of attaining TNA is only 23 s, which indicates the model is feasible. 2 tabs, 2 figs, 8 refs.

    分析了国内航空公司普遍采用的单枢纽线性航线结构以及飞机排班工作流程和要求,研究了描述飞机排班问题的数学模型构造方法,引入"航班节"的概念,将一个具体的飞机排班问题归结为三种典型排班模式中的一种,即基于飞机调度指令要求的排班问题、基于最少需用飞机数的排班问题、基于飞机使用均衡要求的排班问题。应用结果表明平均每架飞机分配的航班任务时间与期望飞行时间的偏差仅为4 8min,而且得到飞机排班方案的时间不到23s,因此此飞机排班模式是解决单枢纽线性航线结构下的飞机排班问题的一种有效方法。

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

     


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

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