联合作战目标协同模型构建与求解方法?

在对联合作战目标协同研究内容分析的基础上，提出了多任务部队与多作战目标的协同目标分配模型，其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解，验证了分析方法的可行性。     

Novel approach for active vibration control of a flexible missile

This paper investigates the feasibility of using an active dynamic vibration absorber (ADVA) for active vibration control of a flexible missile system through simulation. Based on the principles of a dynamic vibration absorber (DVA), a ring-type ADVA is first designed to attenuate the elastic vibration of the flexible missile, and the design of the active controller adopts the proportional-integral-derivative (PID) control algorithm. The motion equations of a flexible missile with an ADVA, which is subjected to follower thrust at its aft end, are derived using the Lagrangian approach. Taking the minimum of the root mean square (RMS) of the lateral displacement response of the center of mass as the objective function, a genetic algorithm (GA) is used to optimize the parameter of the DVA and PID controller. The numerical calculations show that the ADVA and DVA are effective in suppressing the vibration and provide approximately 41.2% and 17.6% improvement, respectively, compared with the case of no DVA. The ADVA has better performance than the DVA. When the missile is subjected to follower thrust, the effect of vibration reduction is more effective than the case without follower thrust. It is feasible to reduce vibration and improve the stability of flexible missiles by means of the ADVA.     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

小波变换在漏磁检测信号处理中的应用

在对军用装备进行漏磁无损检测时,漏磁信号中含有大量噪声,针对这种情况,介绍了小波变换消噪理论.在数字化实现中,离散小波变换是利用Mallat分解与重构算法来完成.仿真试验中,选取二阶样条小波为小波函数,对从漏磁检测装置中采集到的漏磁信号进行消噪.结果表明将小波变换应用于炮管漏磁检测中,能提高检测信号的信噪比和抗干扰能力.为漏磁信号分析、特征提取和缺陷漏磁反演打下了基础.     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

装备维修器材生产路径决策的两阶启发式算法

当前装备供应保障系统中维修器材存在短缺、积压以及配送系统效率低下等问题,亟须对生产、库存和配送作业环节进行集成优化。为客观反映各个决策环节,将该问题公式化为一个混合整数线性规划模型,针对该模型多变量、多约束的特点,提出了一个基于数学规划的两阶启发式算法对其进行求解。结合算例,检验模型的可行性,并选取求解器CPLEX和一个类似的迭代算法与该算法在求解质量和运算时间方面进行对比与分析。结果表明,提出的模型是合理可行的,该算法在求解不同规模实例时表现出优异的性能。     

支持并行工程的造船分段作业计划系统

针对传统造船模式下,车间作业计划与工艺设计串行工作方式的缺点,基于并行工程的原理,提出了分段作业计划与工艺设计的集成运行模式,为实现造船CAPP系统与PPC系统的集成化和并行化提供了实现的基础。针对集成模式的特点,建立了分段作业计划系统资源优化的数学模型,应用遗传算法解决了针对任意分段装配工艺方案的多资源平衡优化问题,可以得到每项作业最优的开工时间,同时能够给出多种资源的最优分布结果,满足了多工艺方案之间资源利用率的比较。最后,给出了计算实例,计算机模拟结果说明了这一方法的有效性。     

On online bin packing with LIB constraints

In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (larger item in the bottom) constraints. We give an improved analysis of First Fit showing that its competitive ratio is at most , and design a lower bound of 2 on the competitive ratio of any online algorithm. In addition, we study the competitive ratio of First Fit as a function of an upper bound (where d is a positive integer) on the item sizes. Our upper bound on the competitive ratio of First Fit tends to 2 as d grows, whereas the lower bound of two holds for any value of d. Finally, we consider several natural and well known algorithms, namely, Best Fit, Worst Fit, Almost Worst Fit, and Harmonic, and show that none of them has a finite competitive ratio for the problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

临近空间高超声速目标跟踪方法研究?

临近空间高超声速目标跟踪技术研究在空天防御系统中具有重要军事意义和理论价值。本文综述了临近空间高超声速目标跟踪中的目标运动建模、目标跟踪算法等研究内容的研究进展，并对其存在的问题进行了深入分析。针对这类目标跟踪存在的问题，结合临近空间高超声速目标探测跟踪需求，指出了临近空间高超声速目标跟踪技术的研究思路，为相关研究提供了参考。