求解面向进攻的武器-目标分配问题的蚁群算法

面向进攻的武器-目标分配问题是军事运筹学研究中的重要课题,旨在制定合理的打击策略以最大程度摧毁敌方目标。采用一种融合局部搜索和信息素控制的蚁群算法,兼顾控制解的局部收敛速度和全局收敛质量。在解的构造过程中直接处理约束条件,提高生成解的可行性,并大大缩小了搜索空间,提高了算法效率。通过采用多种算法对不同规模的武器-目标分配问题进行实验,结果表明改进的蚁群算法在收敛速度和求解质量上表现优异。     

基于灰色理论的电子系统状态预测方法

电子系统的状态预测是利用其历史信息来实现系统未来状态和趋势的估计,以防止灾难性故障的发生,对于推动视情维修具有重要意义。针对典型模拟滤波电路,通过分析其关键测试信号的特点,研究了基于灰色理论的状态预测方法,并针对该预测模型的不足,设计粒子群算法选择最佳预测维数,设计新陈代谢法使该模型参数在线改变,从而建立符合电子系统信号特点的灰色预测模型。将该模型与ARAM模型比较,实验结果验证了该模型具有较好的状态预测精度和预测性能。     

解坦克分队武器-目标分配问题的小生境遗传算法

为快速求解坦克分队武器-目标分配（Weapon-Target Assignment,WTA）模型,对基本遗传算法的关键步骤进行改进,设计了独特的基于火力单元排序的战术种群初始化策略,引入小生境共享函数和参数自适应机制,完成了基于小生境自适应改进遗传算法的设计与实现。最后进行了仿真试验,试验结果表现出了良好的收敛效果。     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Concave envelopes of monomial functions over rectangles

The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Development programs for one‐shot systems using multiple‐state design reliability models

Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

战术互联网的网络重组方法

战术互联网的网络重组是在网络节点或通信链路发生故障,或受到安全威胁时,保证网络强壮性的重要手段之一。根据战术互联网特殊的移动网络环境,提出基于作战指挥原则的组织重组方法和基于遗传算法的链路重组方法。仿真实验结果证明了这些方法的有效性。     

时域分析在雷达动目标识别中的应用

本文通过对地面几类目标运动特性的统计研究,利用线性预测的方法进行目标特征的提取,进而用模式识别的理论对地面目标进行自动识别,取得了良好的识别效果。     

以发射质量最小为优化目标的反TBM拦截器优化研究

以反ＴＢＭ拦截器发射质量最小为优化目标,系统地研究了反ＴＢＭ拦截器总体优化技术,建立了反ＴＢＭ拦截器数学模型和优化算法,并得出重要结论。