抢险救灾非战争军事行动中应急资源调度网络的优化方法

抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.     

小波神经网络UCAV飞行控制系统

针对采用H∞控制设计方法需求解难度很大的偏微分方程,而导致工程实现难度大的问题,提出了采用小波神经网络进行无人攻击机(UCAV)飞行控制系统设计的方法,该方法集小波变换和神经网络的优点于一身,简化了网络训练,避免了系统达到局部最优解,使得系统具有更好的逼近精度。通过仿真实验表明,利用小波神经网络进行UCAV控制律设计,使系统具有较好的跟踪性和鲁棒性,避免了精确模型的建立,便于分析系统的稳定性。     

多属性融合的坦克分队作战效能评估

现代条件下战场情况复杂,影响作战效能的因素众多且具有不确定性,为了获得对作战效能更为准确,可靠的评价,构建了一种新的基于多属性融合的坦克分队作战效能评估模型。结合已有的证据理论改进算法,给出了一种新的解决冲突证据的组合规则,并提出了一种新的组合策略,将其应用于评估模型中定性指标的融合;通过线性与非线性综合加权的方法求得评价的综合分值,得出了最终的评估结果。通过实例表明,该模型符合评估实际,对多属性模型的评估具有一定的借鉴意义。     

地面防空武器系统的效能评估模型

作战系统服务能力是衡量其作战效能的重要指标,结合现代作战系统的特点,运用排队论原理,建立了一种地面防空武器系统效能评估模型,确定了武器系统作为随机服务系统的主要性能指标,包括目标突防概率、目标杀伤概率、占用射击通道的平均数、射击通道占用概率和武器系统效率等。示例计算分析显示,该模型与外部条件和地面防空武器系统的综合特性密切相关,对辅助指挥员决策有一定的参考价值。     

不完全信息的装备采购博弈

目前,我国的军品市场正由封闭市场向一个相对开放竞争的环境转变。基于不完全信息的装备采购的博弈模型,探讨了在不完全信息的相对开放的竞争环境下,军企双方对对方的策略、偏好、所处的地位或者状态的信息等策略问题进行了解,并给出了求解方法,通过实例进行了说明,对装备采购实践具有一定的指导意义。     

基于灰色系统理论的目标方位估算及应用

针对潜艇作战过程中依据目标方位变化判断战场态势的军事需求,根据灰色系统理论,以实测目标方位序列为原始数据,建立GM(1,1)模型,深入挖掘其内在规律性,对目标方位序列的变化趋势进行科学分析,并估算未来时刻目标方位,用于战术态势判断、检验目标运动要素解算和战术绘算的准确性,以及干预目标运动要素解算,以期望利用有限的数据,获得最大限度的信息,为潜艇指挥员提供决策支持。     

基于模糊数学的火险探测系统设计

针对火灾探测的特点和误报、漏报等问题,提出基于模糊逻辑论的数据融合算法,以提高火灾探测的准确性。运用单片机技术,设计了火灾探测系统的软硬件构成,并通过dsPIC与上位机的串行通信,实现了火情的距离监测。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

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     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.