进气口位置和进气体积流量对油罐油气惰化置换效率的影响

采用机械通风方式对油罐油气进行处理,具有安全性差、通风时间长和效率低下的缺点;利用燃惰气对油罐油气进行处理,可较好地克服上述缺点。在前期研究的基础上,设计模拟实验台架,以燃惰气为介质,实验研究进气口位置和进气体积流量对燃惰气惰化置换油罐油气的影响。     

基于任务的连续出动舰载机航空保障重调度研究

对舰载机和各种保障资源进行调度是提高舰载机航空保障效率、保证舰载机所承担作战任务顺利完成的有效手段。为了克服以往研究中没有考虑作战任务变更对舰载机航空保障调度的影响,使用重调度的理论与方法研究了基于任务的连续出动舰载机航空保障重调度问题,建立了连续出动舰载机航空保障重调度模型。采用免疫算法对模型进行求解,可以避免模型的解空间可能出现组合爆炸问题。最后通过一个实例表明该模型可以很好的应对由作战任务变更所引起的重调度问起,算法求解速度满足作战需求,从而验证了模型的准确性及算法的有效性。     

Irreducibility of joint inventory positions in an assemble‐to‐order system under (r,nQ) policies

In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Optimal inventory control policy for periodic‐review inventory systems with inventory‐level‐dependent demand

We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

k-ary n-cube中的移动气泡流控策略

在k-ary n-cube网络中,气泡流控是一种有效、实用的死锁避免技术,它不必依赖虚通道就能避免环网中出现的死锁问题。如果流控策略能感知到维度内缓冲区的总体使用情况,就能够更加高效地进行调度,从而提高网络性能。为了避免关键气泡机制引起的阻塞,提出了伪报文协议;结合伪报文协议,设计了移动气泡流控策略,它有效实现了维度内的全局资源感知能力。与局部气泡流控相比,路由器每条输入通道仅设置一个报文缓冲区就可以避免环网中的死锁,即最小资源需求减少了一半。网络模拟结果表明,该机制不会出现永久阻塞;在distribute、hotregion和uniform传输模式中,该机制可以有效提高网络吞吐率20%以上,并且在网络饱和后吞吐率依然维持稳定。     

军用飞机综合效能/费用评估方法

军用飞机的效能与费用是两个相互制约的因素,对两者进行科学合理的综合评估,对于军用飞机的发展和使用有着很重要的意义。在分析综合效能/费用的基本评估指标基础上,提出了在军用飞机全寿命周期综合效能/费用评估指标,重点对作战使用阶段的最佳效能/费用进行评估分析,最后给出结论。     

低功率霍尔推力器阳极供气环工程设计关键参数仿真

为了提高低功率霍尔推力器放电通道内中性原子分布均匀性,采用有限元方法对阳极供气环关键结构参数进行优化研究。针对双腔式阳极供气环结构,重点分析了缓冲腔容积比以及缓冲腔隔板导流小孔数量等关键参数对阳极供气均匀性的影响。研究结果表明:随着缓冲腔容积比的增大,阳极供气环出气孔差异率先快速减小后趋于稳定,其中当容积率k=1.0时,平均差异率和最大差异率分别为1.77%和3.79%;隔板间导流小孔数量从8增加到14时,出气孔差异率呈现浴盆曲线特性,其中导流孔数量为10时,平均差异率和最大差异率分别为1.8%和3.8%。研究结果可为霍尔推力器阳极供气环工程设计提供理论支撑。