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

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

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.     

基于分阶段筛选评估的合同网任务分配机制

基于合同网的任务分配机制广泛应用于各领域的多Agent系统中,以解决分布式任务分配问题。在分析经典合同网协议优缺点的基础上,提出了分阶段筛选与招投标协商相结合的任务分配模型。通过招投标的可计算性评估,将主要计算任务放在招投标Agent内部进行并且缩小招投标范围,从而减少通信并提高效率;通过动态确定评估指标提高了机制的通用性。     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

基于反正切函数的测试性分配方法

针对现有主流测试性分配方法存在的分配指标过低和过高等不合理问题,分析认为其根源在于现有方法采用线性分配函数,而该函数不符合测试性指标提升规律,为此,构造了一种基于反正切函数的测试性分配函数,设计故障检测率与故障隔离率指标的分配算法,开展案例应用并与经典故障率分配法和综合加权分配法进行对比分析,结果表明随着分配权重(故障率)的变大,本方法分配指标的增幅逐渐减小,不会出现极低指标和超1指标的不合理情形。     

干扰及机动条件下的比例导引智能调控策略

由于红外诱饵干扰样式复杂、目标机动形式多变导致传统比例导引律极易被干扰。为提高采用比例导引方法的导弹性能,提出一种利用径向基函数网络调控比例系数及导弹发射时机的智能导引律。以飞行时间及脱靶量为参考,通过构建加权型指标函数将求解最优比例系数及发射时机问题转化为单目标优化问题;引入量子粒子群算法求解最优决策参量,并以其作为网络输出,干扰样式作为网络输入,离线训练径向基函数网络;为提高训练效率,结合K-means及K最近邻算法初始化径向基函数网络。仿真结果表明,当存在红外诱饵干扰时,智能导引律性能优于扩展比例导引律及自适应滑模导引律。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008