救灾物资的紧急调运模型

针对某地区防洪救灾中物资的调运问题,利用图论中最短路的知识,根据问题实际,将物资的调运方案分成3个阶段.在每个阶段以费用最小或时间最短为目标.以各单位之间物资的供求平衡为约束,建立了规划模型.通过编程求解,制定了不同情况下物资紧急调运的具体方案,包括用车数量、行车线路、用车时间和费用.     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

求解武器目标分配问题的改进粒子群算法

在建立多种类型武器目标分配模型的基础上,提出了一种求解该模型的改进粒子群算法。首先,定义粒子聚焦距离变化率,使惯性权重依据聚焦距离变化率自适应调整;其次,采用速度最大值线性递减的策略平衡算法收敛精度与全局寻优能力之间的矛盾;最后,粒子替换策略使算法改善了因自适应惯性权重的引入而造成收敛速度变慢的问题。仿真结果表明,提出模型和算法合理有效,算法收敛快,适合求解各种种群规模的武器目标分配问题。     

最优线性分派模型的水面舰艇破交方案优选

水面舰艇破交方案是由指挥机关根据辅助指挥决策系统提供的敌情判断和应采取的对策拟制形成的,由于问题本身的复杂性,在进行方案优选时,其模糊性、不确定性较强.在综合分析了水面舰艇破交方案指标的基础上,考虑到了"成本型"和"效益型"指标间的不可公度性及矛盾性.对待选方案按其对正理想解和负理想解的贴近度进行排序,求出各方案的排序频数,将其转化为最优线性分派模型进行优化,从而使所有方案得到总体最优排序.     

关于一维线性系统的逆

本文对单输入单输出系统给出了可逆性的判断准则，建立了新的降阶逆系统的构造方法。这种新的降阶逆系统与以往的降阶逆系统相比，阶数更低了、构造更加简单，而且揭示了可观测性矩阵的秩与逆系统的阶之间的联系。最后用例子说明了这一方法。     

MTTR的两种预计方法

维修性是装备的设计特性。平均修复时间MTTR(Mean Time to Repair)是衡量维修性的重要定量参数。为了使装备具有良好的维修性,必须在装备设计论证阶段加强维修性预计,特别是对MTTR的预计。本文以雷达、指挥仪一类电子装备为背景,提出预计MTTR的仿真方法和解析方法,并进行了应用性研究。     

自导车激光导引控制系统研究

本文提出一种用于柔性加工系统(FMS)的自动导向车(AGV)导引控制系统。该系统不仅能导引直线运行,而且能控制转弯。当自导车沿直线行驶时,它由设置在地面的气体激光器发出的激光束导引,由最优线性调节器控制;当自导车转弯时,它由三束激光和角锥棱镜检测位置和方向,由模糊控制器控制。实验表明该导引控制系统可行,它将使FMS的物流系统具有更高的柔性度。     

极大代数及其在离散事件动态系统中的应用

在人类社会活动中,有许多活动属于离散事件或离散事件动态系统。在极大代数意义下,这类系统可用线性系统的理论和方法建立数学模型、求解状态方程,讨论可控性、可观性,以及实现系统运行的优化设计。     

马尔可夫链最优停止的值函数

本文讨论了时间无限的马尔可夫链的最优停止问题。对于无限状态情况,给出了其最优停止变量以及值函数存在的一个充分条件;对于有限状态情况,这个充分条件以及问题的计算等价于解一个线性规划问题。