一种基于蚁群算法的准动态防空武器分配算法

武器目标分配问题是一个典型的限制组合优化问题,旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题,提出了基于时间窗的准动态武器目标分配算法,该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标,并将该算法推广至多类防空武器的优化分配中。通过大量实验验证,该算法在性能、时间复杂度等方面均有较大优势,并且能较好地适应战场态势的变化,及时调整分配方案,具有很好的实用性。     

坦克底盘角振动对火炮射击精度影响机理研究

实车试验表明,在行进间射击试验时,当车辆超过一定车速(行进间射击车速)时,射击精度或射击命中率会发生大幅度的下降。针对这个问题,建立了坦克底盘角振动导致的射击偏差的数学模型;并结合实车试验数据,对射击延迟时间内底盘角振动造成的火炮射击偏差进行了全面分析。分析研究表明:在相同的行驶车速条件下,车辆底盘角速度、姿态角变化量随着射击延迟时间的增大而增大;在相同的射击延迟时间内,车辆底盘角速度、姿态角变化量与射角偏差随着行驶车速的增大而增大;其中射角偏差引起的目标距离偏差是弹丸横向速度导致的目标距离偏差的3倍~5倍。因此,随着行驶车速增加而增加的射角偏差增大是行进间射击车速受限的主要原因。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

卫星差分码偏差对北斗三号双频精密单点定位的影响

为探讨北斗三号系统不同频点组合卫星差分码偏差(differential code bias, DCB)对精密单点定位(precise point positioning, PPP)的影响,推导北斗三号系统不同频点无电离层组合卫星端DCB改正模型,并基于MGEX跟踪站连续7天4站的观测数据按7种不同双频组合进行DCB改正实验。结果表明,DCB改正对PPP精度在最初的历元有明显提升,有助于滤波的收敛及提高单天解的均方根,但对于最终定位精度无明显提升。B2a/B3I及B2b/B3I组合定位精度及收敛速度明显低于其他组合,DCB改正后有所提升。其他5种组合改正后定位精度及收敛时间相当：静态PPP单天解均方根在E、N和U方向约为5.50 cm、2.50 cm和6.25 cm,较未改正前提升20%～65%;平均收敛时间为38 min,提升约6%;动态PPP平均收敛时间为59 min,提升约20%;最终定位精度水平方向优于5 cm,高程方向优于7 cm。     

Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The knapsack problem with a minimum filling constraint

We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

UKF在MEMS陀螺随机噪声补偿的应用

论述了MEMS陀螺静态随机噪声与动态随机噪声的特点;系统分析了无迹卡尔曼滤波(UKF)的特点,将UKF用于MEMS陀螺随机噪声估计;针对MEMS陀螺静态噪声与动态噪声补偿用同一方法处理达不到一定性能的难题,提出了一种由阈值决策静态和动态滤波的工程方法;指出将时间序列用于建立随机噪声的数学模型的缺陷,指出欧美等使用的MEMS陀螺随机噪声补偿的优点与缺点.     

基于时间序列图书借阅的预测与分析

以武警工程大学图书馆2009～2012年的读者借阅流量为基础,基于年、月等时间序列,分别建立了相应读者借阅流量的分布图,对分布规律进行了分析总结,为今后图书馆的管理决策提供了理论依据。