基于超效率DEA-Malmquist的装备维修经费配置效率评价与改进

分析评价和改进提高装备维修经费配置效率对于评价装备维修保障计划落实情况、发现问题、找准成因、及时纠偏具有重要的军事和经济意义。通过分析当前装备维修经费配置效率评价方法的不足,针对经费投入特点,运用超效率数据包络分析理论,构建了配置效率分析的静态评价和改进模型;并通过Malmquist模型结合面板数据对配置效率的变化情况进行动态研究分析。案例分析结果表明,该方法可以相对客观地评价不同单位装备维修经费的配置效率,通过横向和纵向比较,综合分析效率不高的原因,并提出相应改进建议,具有一定的理论意义和推广应用前景。     

改进协同演化算法求解超多目标云工作流调度问题

目前主流优化方法通常将云工作流调度建模为单目标或者不超过三个目标的多目标优化问题,未能充分考虑实际应用场景需求。为克服传统方法局限性,将云工作流调度问题直接建模为涉及时间、费用、可靠性、资源消耗度、负载均衡等众多指标的超多目标优化问题,并针对该问题提出一种改进协同演化算法,利用双阶段策略和多性能指标协同机制有效地平衡解集的收敛性和多样性,提升算法寻优能力。在七类真实工作流实例上的实验表明,所提方法相比现有算法在大多数情况下可找到更好的调度方案。     

通信对抗装备维修管理信息系统

通信对抗装备的性能越来越强、复杂程度越来越高 ,而维修保障方式和手段的落后制约了装备战斗力的发挥。因此 ,改善装备维修的手段 ,实现装备信息的科学管理就成为一项迫切需要解决的问题。从功能、构成和信息结构、信息管理和软件体系等方面介绍了一个装备维修管理信息系统的设计思想。     

序列近似优化方法及其在火箭外形快速设计中的应用

针对序列近似优化方法在代理模型构造与采样策略等方面的不足,基于采样点局部密度,引入与局部密度成反比的样本点影响体积概念,通过优化总影响体积确定径向基函数最优核宽度,满足序列近似优化过程不同规模、非均匀样本条件下的函数近似需要;建立潜在可行域最大距离加点准则,并与潜在最优加点准则结合平衡算法的探索能力与开发能力;建立三步收敛判定准则;构建改进序列近似优化的算法流程。对于Golinski减速器的优化设计问题,算法在目标函数调用42次后便搜索到全局最优解,体现了其良好的全局寻优能力与搜索效率。以\"天航二号\"火箭为例,建立其外形优化问题数学模型,所提优化方法在调用原始计算模型165次之后便搜索到全局最优解,大大提高了设计效率,同时飞行试验也表明设计结果满足要求。     

基于资源平衡的分布式星群网络连接接入策略

针对现有卫星网络接入策略未能充分考虑卫星资源以及合理确定卫星资源权重问题,提出了一种基于资源平衡的星群网络连接接入策略。该策略充分考虑卫星的多种资源建立卫星资源评价模型,利用移动代理技术,采用层次分析法和熵值法计算各卫星资源的主观和客观权重,并通过Kullback散度权重优化方法对主客观权重进行平衡处理,判决过程兼顾了卫星的综合性能水平和用户偏好,提高了接入的准确性和合理性。仿真结果表明,采用该接入策略,有效改善了新呼叫阻塞率和强制中断率。     

仓储条件下弹药修理若干问题研究

本文对仓储条件下弹药修理决策、修理材料的选用与检验、修理质量控制与检验的现状进行了分析,对目前弹药修理中存在的问题提出了解决办法和基本设想。     

基于比较语言的军民融合式装备维修保障风险评估

针对地方维修商参与部队装备维修保障给军方带来诸多风险的问题,系统分析了军民融合式装备维修保障存在的风险因素,提出了一种基于比较语言表达的风险评估模型。将比较语言表达式转换为犹豫模糊语言术语集（HFLTS）,并计算出由梯形模糊隶属函数表示的 HFLTS 的模糊包络,最后应用双基点法进行维修商的选择决策。通过实例验证了模型的有效性。     

基于三角模糊熵的装备维修合同商评价与选择

装备维修合同商保障能力评价是军民融合装备维修招投标过程中合理选择最优合同商的基础.通过对招投标过程及以往资料的研究,在考虑部队装备维修保障特殊性的基础上,从合同商资质、技术能力、管理水平和价格成本4个方面构建装备维修合同商评价指标体系,并运用基于三角模糊熵的综合评价法进行评价.综合运用三角模糊法和熵值法,针对评价指标的模糊性和不确定性,采用三角模糊数对定性指标量化处理,又用熵权反映出指标竞争的相对激烈程度,计算出评价对象与理想点的贴近度和距离,据此对评价对象进行优劣排序,最后通过实例进行了验证.     

An informal framework to aid the analysis and design of military posture

The design of military posture is an exercise in confronting potential enemies’ capabilities within the context of geographic, technological, temporal, political and economic constraints. No formal model is capable of encapsulating the essentials of so complex an environment for closed or simulated analysis, but it is useful to have an informal framework within which to reason interactively within these dimensions.

This paper presents such a scaffolding, patterned on the notion of a military posture as the output of an economic process whose structure reflects important determinants of the characteristics and extents of weaponry and expenditures that are appropriate to the environment within the feasibility set determined by the constraints. The analysis remains at an abstract level, but it does highlight the important shifts toward preparation for littoral warfare, greater reliance on reserve rather than active forces, and necessary changes in missions among military departments.     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000