基于全寿命周期的舰船喷水推进装置综合保障技术研究

针对舰船喷水推进装置的保障需求，介绍了喷水推进装置的基本组成、技术特点，引入环境特征，使用特征因素，研究喷水推进装置从交装到服役期满的全寿命服役周期的综合保障技术，提出针对喷水推进装置在不同状态、不同时期的保障策略，建立喷水推进装置保障能力体系。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于模糊动态层次分析法的军车全寿命费用模型

为研究军车最优的效费比，提出了控制军车装备费用增长的有效途径——全寿命费用管理方法，并通过模糊动态层次分析法建立了分析决策模型，将定性与定量的分析有机结合起来研究军车全寿命费用的变化趋势，有利于提高军车装备的可靠性和决策的科学性，具有较好的应用价值。     

BDS三频非差观测数据周跳探测与修复方法

随着三频技术的出现,多频观测量及其丰富的线性组合特性为周跳的探测与修复提供了新的契机。因此提出三频非差观测量线性组合对载波相位观测数据中周跳进行实时探测及修复的方法。该方法构造无几何无电离层的码相组合,并通过对历元间的电离层延迟变化量进行实时估计与消除,构造出第三组线性无关的周跳探测量。用30 s采样间隔的北斗三频实测数据对算法性能进行验证,试验结果表明:该方法可以有效地对各频点的周跳实现探测与修复,即使在电离层活跃的应用场景中,该方法依然具有较好的性能。     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

北斗导航系统移动基准站差分定位算法

针对复杂测量环境无法建立固定基准站及进行精密定位的问题,提出一种基于北斗导航系统的移动基准站差分定位算法,即基准站与流动站同时运动并实现高精度差分定位的算法。基于载波相位测量值,在动态短基线条件下,对数据进行站间和星间双差处理,消除接收机钟差以及其他公共误差。对多频观测值进行线性组合,构造双差载波相位超宽巷、宽巷、中巷及窄巷观测量。对上述观测量进行窗口滑动均值滤波并采用逐级模糊度确定法固定整周模糊度,即沿着从超宽巷到窄巷的顺序依次求解整周模糊度。为验证算法有效性,设计基于北斗导航系统的轨道外部几何参数检测仪进行实验,实现毫米级静态相对定位精度和厘米级RTK相对定位精度。     

一种稳健的循环平稳信号时延估计算法

基于信号循环平稳特性的时延估计算法具有较强的抗干扰和抗噪声能力,但循环频率误差时性能下降严重。针对这一问题,首先分析了循环频率误差对循环时延估计算法中,循环互相关函数相关法估计性能的影响,进而提出了一种对循环频率误差稳健的改进循环时延估计算法。改进算法通过两次搜索确定循环频率的真实值。仿真实验结果表明,改进算法可以有效地校正循环频率误差,最终使时延估计误差与无循环频率误差时基本相同。