再生冷却通道结构参数对碳氢燃料流量分配影响

以液体火箭发动机再生冷却技术为背景,采用数值模拟方法对Z-type型并联通道流量分配特性进行研究,分析了通道数、通道截面形状及入口汇流结构对流量分配特性的影响。研究结果表明:在冷却通道总流通面积相同的情况下,随着再生冷却系统通道数的增加,流量分配不均匀度系数从2.59%降低至0.5%,相同流通面积下增加通道数可以有效提高流量分配的均匀程度。通道截面形状对流量分配不均匀度系数影响不大,其影响主要表现在通道内部流体速度分布及换热面积上。从换热效果看,梯形截面构型要优于矩形构型。入口汇流结构倾斜角有利于流量的均匀性分布。该研究对于再生冷却通道结构设计具有一定参考价值。     

面向计算流体力学的图形处理器资源管理

针对求解计算流体力学过程中图形处理器资源利用率低的问题,提出面向计算流体力学的图形处理器资源优化管理方案。基于计算流体力学的算法特性和同时运行任务的执行特点,设计合理的调度方案。通过动态改变不同任务的启动规模和启动时间,在减少资源竞争的同时提高图形处理器资源的有效使用。实验结果表明:本文提出的资源管理方案相比基线方法在不同任务规模下的平均加速比达到 1.64,对图形处理器的硬件资源使用也有了显著的提升。     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

碳-酚醛材料烧蚀热解对再入流场特性影响的数值计算

数值模拟存在碳-酚醛材料烧蚀的高超声速再入流场,分析烧蚀和热解对流场热化学参数、电子数密度分布等的影响。采用19组元双温度的热化学模型,耦合热化学非平衡流Navier-Stokes方程组和烧蚀壁面边界条件,进行定常烧蚀流场求解;通过对比无烧蚀、非催化和辐射平衡壁温条件下的流场分析烧蚀的影响;讨论了壁面处碳-酚醛材料热解产物化学组成的确定方法,研究了不同热解率的影响。以RAM-C球锥的两个典型飞行条件(速度7.65km/s、高度61km和71km)为代表的研究表明:最主要的烧蚀热解产物是CO、H2、H,烧蚀产物和烧蚀的影响均局限于边界层内;烧蚀使原子和离子组元含量下降,当离子组元含量峰值出现在边界层内时,烧蚀使电子数密度峰值下降;随热解率增加烧蚀影响程度增强,烧蚀在后身区影响范围大于头部区,随飞行高度增加烧蚀影响范围扩大。     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

经纬网络充气机翼构形特征与气动性能分析

将充气机翼应用于临近空间太阳能飞行器是具有创新性的设计概念。针对充气机翼构形特征和气动分析的相关问题,对构形特征进行分析和设计,并建立经纬网络充气机翼的模型;进一步运用数值方法,通过与标准翼型对比,分析二维充气机翼、三维经纬网络充气机翼的气动性能。数值分析结果表明,在设计的雷诺数条件下,充气机翼的气动性能相比于标准翼型有所降低。在此基础上,结合对流场结构和流动机理的研究,分析出导致充气机翼总阻力系数明显增加的主要原因是:充气机翼表面许多凹陷的局部区域所形成的涡结构,导致局部的摩阻有小幅的减小,但压差阻力大幅增加,最终使得总的气动性能有所降低。     

基于改进遗传算法的舰载机出库调度优化方法

舰载机出库最优调度方案是合理编排一批次舰载机出库顺序,使目标舰载机在最短的时间内调出机库。提出舰载机出库调度方案4步单目标优化方法。第1步实现舰载机数量分配功能;第2步依靠遗传算法,实现舰载机选择功能,寻找最优出库组合方案;第3步根据优先级规则对舰载机出库作业进行排序,从而得到最优出库方案的舰载机调度序列;第4步找出需要倒机的舰载机并根据一定规则进行整理后,得到出库作业序列。最后,建立模拟机库验证调度方案的优化方法可行、高效。     

考虑航线交叉的救援直升机起飞时序规划方法

为解决多架救援直升机的起飞时序规划问题,以最小化最后一架救援直升机的起飞时间为优化目标,建立多直升机多起降点的数学规划模型。设计了基于任务优先级的快速启发式算法,提出航线交叉点的处理方案,给出起飞时间求解算法。以云南鲁甸6.8级地震的灾后救援为背景,设计了包含24架直升机和12个起飞点的起飞时序规划案例,对模型和算法进行了仿真验证,并对航线交叉的影响与处理措施进行了深入讨论。实验结果表明该模型和方法能有效解决多架救援直升机的起飞时序规划问题。     

Maintenance and flight scheduling of low observable aircraft

In this article, we focus on relatively new maintenance and operational scheduling challenges that are faced by the United States Air Force concerning low‐observable (LO) or stealth aircraft. The LO capabilities of an aircraft degrade stochastically as it flies, making it difficult to make maintenance scheduling decisions. Maintainers can address these damages, but must decide, which aircraft should be put into maintenance, and for how long. Using data obtained from an active duty Air Force F‐22 wing and interviews with Air Force maintainers and program specialists, we model this problem as a generalization of the well‐known restless multiarmed bandit superprocess. Specifically, we use an extension of the traditional model to allow for actions that require varying lengths of time, and generate two separate index policies from a single model; one for maintenance actions and one for the flying action. These index policies allow maintenance schedulers to intuitively, quickly, and effectively rank a fleet of aircraft based on each aircraft's LO status and decide, which aircraft should enter into LO maintenance and for how long, and which aircraft should be used to satisfy daily sortie requirements. Finally, we present extensive data‐driven, detailed simulation results, where we compare the performance of the index policies against policies currently used by the Air Force, as well as some other possible more naive heuristics. The results indicate that the index policies significantly outperform existing policies in terms of fully mission capable (FMC) rates. In particular, the experiments highlight the importance of coordinated maintenance and flying decisions. © 2015 Wiley Periodicals, Inc. 62:60–80, 2015