载人飞船返回段的最优控制

本文介绍空间飞船再入段最优制导方法。纵向制导采用二次型性能指标最优的线性系统,得到最优控制规律。侧向制导利用庞特里亚金最小原理,得到最优开关曲线。结果表明,这些控制规律优于Rodney C.所介绍的制导方法。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

阶段事故树分析在舰艇火灾消防上的应用

对火灾过程的研究一直以来都是舰艇消防研究的重点,利用阶段事故树工具从火灾宏观发展过程的角度出发将舰艇火灾划分为6个发展阶段,研究了每一阶段的诱发因素,得出了导致这些因素的基本事件,并通过对它们各自结构重要度的比较明确了重点,最后分析给出了各阶段的应对措施并提出了相应的合理化意见建议。     

建筑节能初期设计阶段的能耗模拟与分析

针对建筑节能初期设计阶段,采用建筑环境设计软件Ecotect对某节能示范楼外窗遮阳情况进行模拟分析,得到各朝向外窗的遮阳形式以及大小设计范围,为下一阶段包括外遮阳形式,构造尺寸和各朝向房间的窗墙比、外窗材料选择提供了设计参考.     

新阶段推进武警学院科学发展的战略思考

武警学院要在新阶段、新起点上实现又好又快发展,必须用科学发展观统领发展战略,解决＂发展什么＂和＂怎么发展＂两个根本问题。为此,对学院发展面临的形势要有新认识,发展理念要有新升华,发展路径要有新突破。     

Technical note: Worst‐case performance of power‐of‐two policies for serial inventory systems with incremental quantity discounts

This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

平流层长航时气球上升过程超冷现象影响因素分析

平流层长航时气球超冷现象是指内部浮升气体温度低于外界大气温度,超冷会引起浮力损失进而阻碍气球上升过程。建立了长航时气球辐射、对流等热模型和上升过程动力学模型,仿真分析了初始净浮力、蒙皮热物性参数、放飞时间和放飞日期等因素对超冷现象的影响规律。研究结果表明,上升过程内外温差随初始净浮力增大而增大且变化显著,可见光吸收率和红外吸收率增大时,内外温差值总体上呈减小趋势;放飞时刻和放飞日期对超冷现象影响较小,但放飞时间不同,气球上升至设计驻空高度的时间差别较大。该结论可为平流层浮空器总体方案设计和放飞试验提供有益参考。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017