基于FAHP-GP的装备调配保障决策模型

分析了装备调配保障决策的主要流程、影响因素和基本模式;根据装备调配保障决策的特点和装备调配保障所面临的实际问题,将模糊层次分析法与目标规划法相结合,构建了装备调配保障决策模型,较好地解决了装备调配保障需求与资源之间的矛盾。最后,以某装备的调配保障决策为例,给出了该模型的求解方法和结果,验证了模型的可行性和有效性。     

战术数据链动态时隙分配算法研究

现代信息化作战中,战术数据链网络系统正发挥着越来越重要的作用。本文以战术数据链时隙分配算法为研究对象,在深入分析两种典型时隙分配算法的基础上,提出了一种动态时隙分配算法。仿真结果表明该动态时隙分配算法灵活性较好,较轮询与TDMA固定时隙分配算法,其能够更好地适应瞬息万变的战场需求。     

离散多音调制中一种改进的动态能量分配方法

本文探讨了离散多音调制（ＤＭＴ）中的动态能量分配的特点和应用范围，并分析了几种典型的动态能量分配方法。在此基础上，本文提出了一种改进的分配方法。计算机模拟结果表明，该方法不仅降低了运算复杂度，而且性能近于最优。文章最后还探讨了动态能量分配中尚待进一步解决的问题。     

相依目标群系统火力分配问题分析与解法

本文中讨论由若干个相依目标群组成的平面点目标系统的火力分配问题。对于武器型号相同的情形,得到了“边际毁伤递减原理”和“循序最优方案即全局最优方案”等结论,并在此基础上提出了问题的解算方法。对于武器型号不同的情形,提出了“循序最优枚举法”,并得出有关结论。     

多机环境下多帧速系统仿真的若干问题

本文论述了多帧速系统在多机环境下并行仿真时处理机分配的原则,指出为减少通信开销,应将多帧速系统中各个子系统分配到不同的处理机(群) 上并行处理。并给出了多帧速系统的仿真主控流程。     

随机通信网络分时管理分析

分析了时分网络的主要性能指标─—信息传递准确率,并给出了其在各种节点类型中的计算公式,据此总结了时分网络中时隙分配的一些原则。     

Allocation with demand competition: Uniform,proportional, and lexicographic mechanisms

We examine capacity allocation mechanisms in a supply chain comprising a monopolistic supplier and two competing retailers with asymmetric market powers. The supplier allocates limited capacity to retailers according to uniform, proportional, or lexicographic mechanism. We study the impact of these allocation mechanisms on supplier pricing decisions and retailer ordering behavior. With individual order size no greater than supplier capacity, we show that all three mechanisms guarantee equilibrium ordering. We provide precise structures of retailer ordering decisions in Nash and dominant equilibria. Further, we compare the mechanisms from the perspective of the supplier, the retailers, and the supply chain. We show that regardless of whether retailer market powers are symmetric, lexicographic allocation with any priority sequence of retailers is better than the other two mechanisms for the supplier. Further, under lexicographic allocation, the supplier gains more profit by granting higher priority to the retailer with greater market power. We also extend our study to the case with multiple retailers. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 85–107, 2017     

多机协同目标与火力资源分配

在协同空战中,快速正确的空战决策是己方战机少受敌方伤害并取得战争胜利的前提。目标与火力资源分配是决策过程的重要部分。多机空战与单机空战相比有明显的不同,不同之处是面临多个敌方目标,根据我方资源最优分配作战对象和火力,基于遗传算法实现了两种算法的有人无人目标与火力资源分配。仿真结果表明,带有毁伤概率门限的算法既节省火力资源又快速有效。     

战役野战油库油料输送力量优化分配研究

如何科学、合理分配战役野战油库油料输送力量是战时油料保障必须面临的一个实际问题。首先根据战役野战油库运油车分配模型得到一个运油车初始分配方案,然后运用计算机模拟技术对分配方案进行模拟,并根据模拟结果不断调整,直至得到优化的分配方案,为制定战役野战油库油料输送计划提供决策依据。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.