基于矩估计的高原航空备件消耗规律研究

针对高原航空备件消耗规律难把握的问题,提出了一种解决低消耗器材消耗预测的方法,利用矩估计把握器材的消耗规律和Monte Carlo仿真器材消耗的数据,找出储备量与满足率之间的关系,预测年平均消耗量。     

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     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

基于极坐标多普勒伪状态的最佳线性无偏估计算法

理论和实践已经证明,除位置量测外,包含目标速度信息的多普勒量测具有有效提高目标状态的估计精度的潜力。基于目标匀速运动场景在直角坐标系下提出了一种可使用多普勒伪量测(即距离量测与多普勒量测的乘积)和多普勒伪状态的跟踪算法。从理论上讲,它是在最佳线性无偏估计准则下的近似最优线性无偏滤波器,并且避免了量测转换方法的根本缺陷。通过与目前几种流行的方法进行仿真比较,验证了新算法的优越性和可靠性。     

随机滤波模型在变速箱剩余寿命预测中的应用研究

摘要：基于变速箱加速寿命实验的振动信号,提取信号的多种特征参量．通过分析各特征参量的敏感性和稳定性,选择幅域裕度指标、峰值指标、波形指标和RMS（RootMeanSquare）作为特征参量,建立一种基于随机滤波的变速箱剩余寿命预测模型,给出剩余寿命后验概率密度的递推公式,设计了极大似然估计方法求解模型参数,并经实例验证模型的有效性和实用性．     

A three‐stage procurement optimization problem under uncertainty

This article examines a problem faced by a firm procuring a material input or good from a set of suppliers. The cost to procure the material from any given supplier is concave in the amount ordered from the supplier, up to a supplier‐specific capacity limit. This NP‐hard problem is further complicated by the observation that capacities are often uncertain in practice, due for instance to production shortages at the suppliers, or competition from other firms. We accommodate this uncertainty in a worst‐case (robust) fashion by modeling an adversarial entity (which we call the “follower”) with a limited procurement budget. The follower reduces supplier capacity to maximize the minimum cost required for our firm to procure its required goods. To guard against uncertainty, the firm can “protect” any supplier at a cost (e.g., by signing a contract with the supplier that guarantees supply availability, or investing in machine upgrades that guarantee the supplier's ability to produce goods at a desired level), ensuring that the anticipated capacity of that supplier will indeed be available. The problem we consider is thus a three‐stage game in which the firm first chooses which suppliers' capacities to protect, the follower acts next to reduce capacity from unprotected suppliers, and the firm then satisfies its demand using the remaining capacity. We formulate a three‐stage mixed‐integer program that is well‐suited to decomposition techniques and develop an effective cutting‐plane algorithm for its solution. The corresponding algorithmic approach solves a sequence of scaled and relaxed problem instances, which enables solving problems having much larger data values when compared to standard techniques. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

空间重采样的宽带多重信号分类算法高分辨方位估计

空间重采样法是宽带恒定束宽波束形成的一种重要方法,采用声矢量阵推导了基于空间重采样的宽带MUSIC算法,并和相干子空间FFT插值法做了仿真比较,结果表明,所提算法的性能优于FFT插值法,表现为更低的分辨信噪比门限和估计均方误差上.     

鲁棒四元数无味卡尔曼滤波算法在组合导航姿态估计中的应用

针对SINS/GPS直接式组合导航姿态估计中,GPS信号易受外界干扰而引入污染观测量等问题,提出基于Huber的鲁棒化四元数无味卡尔曼滤波算法。通过研究在四元数无味卡尔曼滤波算法中引入Huber鲁棒化框架,对原算法的量测更新进行修正,增强滤波算法的鲁棒性与稳定性。以SINS/GPS位置松组合为应用背景,在不同仿真环境下,验证提出算法对姿态信息的估计效果。试验结果表明:与原算法相比,该算法具有更好的鲁棒性和稳定性。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

基于相位相关的快速亚像素全局运动估计

为了实现亚像素级图像快速全局运动估计,提出了一种基于相位相关的快速亚像素全局运动估计方法。首先对待计算的两幅图像进行下采样并计算整像素级的全局运动矢量,然后选取两幅图像重叠的部分进行插值,再计算亚像素级的全局运动矢量。最后,将整像素级和亚像素级的计算结果进行加权计算,得出亚像素级的全局运动位移。实验结果表明,文中算法对噪声影响、光照变化和局部遮挡具有较好的鲁棒性,同时能够有效地提高运动估计的精确性和计算效率。