一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

An inspection game: Taking account of fulfillment probabilities of players' aims

This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于移动Agent的特定数值求解算法研究

在分布式环境下,运用移动Agent技术实现大型复杂系统研究中经常使用的特定数值算法求解,可显著提高计算效率。以分支定界法为例,介绍了其设计思想和实践步骤,并对算法的时间复杂度进行了分析。     

贮存环境对火箭弹动平衡冲量的影响

实验测定了已经在南方和北方2个地区贮存5年的火箭弹动平衡速度,计算了动平衡冲量,并利用秩和检验方法对实验结果进行了处理与分析。通过实验与分析,得到了32发火箭弹的动平衡冲量,综合试验、计算和检验结果表明,贮存环境对于该火箭弹的动平衡冲量有显著影响。     

影响合成旅实战化装备保障能力问题与对策

针对“跨越-2020库尔勒B”演习中,装备保障矛盾问题突出、维修保障难度大的情况,从装备保障力量发展不均衡、保障分队自身保障存在不足、人才储备弱的影响;高温、潮湿、风沙、高海拔等周边环境恶劣程度的影响;器材筹措效率高低、器材储供管理的好坏、器材利用率高低的影响;指挥控制链路关系、感知战场态势、控制战场节奏的影响四个方面存在的问题,对解决提出的问题进行了思考,从固强补弱装备保障力量、积极适应战场周边环境、优化器材储供管理和筹措渠道、提高装备保障指挥控制能力等方面着手,结合演训地区实际装备保障存在矛盾问题出发,探索和研究实战化训练中装备保障的对策措施,以期为部队实战化装备保障提供借鉴。     

惯性导航系统故障诊断的不确定性问题研究

针对构造惯性导航系统 ( INS)故障诊断所面临的确定性和不确定性问题 ,提出了基于模糊集理论的诊断方法 ,并给出诊断系统自动获取不确定性证据和确定性证据隶属度的方法及函数 .认为对于确定性证据和不确定性证据可以用统一的方法和原则来处理 ,并建立了两类证据的实用数学模型     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

超视距多目标攻击排序及火力分配建模与解算

针对未来超视距空战条件下的多目标攻击排序和制导武器火力分配问题,提出了一种用以评估超视距空战作战效能的综合优势指数法;当目标数多于攻击机数时,通过构造综合优势矩阵,将非平衡指派问题转化为平衡指派问题,并建立了多目标攻击排序的0-1规划模型,该模型可解决对多个目标同时攻击的排序问题;以2对8攻击排序为例,利用求解线性规划软件Lindo6.0进行解算。最后,建立了1对4攻击火力分配的非线性规划模型,并利用求解非线性规划软件Lingo5.0进行解算。计算结果验证了建模的合理性和运用Lindo、Lingo软件求解较大规模目标攻击排序和火力分配问题的实时性。     

航路规划中大地主题解算的简化方法

介绍了大地主题解算的精确公式:Bowring公式,给出了三种大地主题解算的简化方法,包括:椭球体到圆球体、椭球面到圆球面以及椭球面到平面的简化方法,并分析了各种简化方法的误差大小。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001