战时装备维修保障资源优化模型

维修资源在抢修过程中的分配决定了抢修活动的平均处理时间和等待时间,针对抢修实施时维修资源的分配,研究资源的优化配置使抢修时间最小的问题.在抢修过程中使抢修时间最小的目标和约束条件下,提出了资源配置优化的排队模型,并结合遗传算法给出了求解最优配置模型的方法,通过实例分析说明了模型和方法的应用情况.资源配置优化模型和算法已成功应用于集群装备保障决策系统的开发.     

谈外国旅游团来琼免签政策实施的不足与完善

外国旅游团来琼免签政策是目前我国实施时间最长、最宽松的区域性免签便利政策。阐述了外国旅游团来琼免签政策沿革演变历程,从入出境管理和边防检查的角度分析了其施行过程中存在的不足与原因,提出了完善免签政策的措施。     

潜艇规避主动声纳浮标自主决策算法研究

主动声纳浮标可以实现对潜艇的精确定位,但易被潜艇感知采取机动规避措施,为了有效减少被主动声纳浮标发现的概率和暴露时间,提出了潜艇自主规避的决策算法,并针对一型主动声纳浮标阵探测进行仿真,分析探测概率变化规律,由此验证算法的有效性。     

基于装备战斗力的集群装备战损等级评定方法

为了建立集群装备战损评估决策支持系统的需要,对集群装备战损等级评定方法进行了研究.在集群装备的组成特点与评估装备战斗力的基本方法,战时实时评估与平时效能分析的区别与联系的分析基础上,建立了基于单装战损评估的战斗力评估模型,对模型的具体步骤与关键参数进行了详细阐述,由此进一步建立了基于模糊隶属度的集群装备战损等级评定模型.最后以示例对上述模型的具体应用进行了说明.     

双枝模糊评判在舰炮性能评估中的应用*

针对舰炮武器性能指标,运用双枝模糊决策方法对舰炮武器性能进行综合评估.该方法提出了新的论域[-1,1],使评估更能符合人的思维逻辑,能够客观的对舰炮性能进行评估,通过对多中舰炮的具体参数指标进评估,得出各种舰炮的性能优劣的排序,具体的数学模型仿真表明,对舰炮武器性能的评估是行之有效的.     

基于鱼雷航程实时预报的潜射线导鱼雷可攻性判断

针对新型潜射线导鱼雷可攻性判断的决策需求,在分析传统的鱼雷可攻性判断方法不足的基础上,提出以鱼雷航程实时预报作为线导鱼雷可攻性判断的决策依据.并对线导方位导引法进行了深入分析,给出了概略目标运动要素情况下鱼雷航程实时预报的解析模型,该模型可实时预报线导鱼雷航程和鱼雷线导段航行时间.经大量仿真计算验证.解析模型预报结果作为鱼雷可攻性判断依据是具有合理性的,该方法能较好地满足线导鱼雷攻击决策的需求.     

消防部队处置生物突发事件辅助决策系统构建

阐述了生物突发事件的重大危害性和建立生物突发事件辅助决策系统的主要目的和意义。从生物突发事件应急救援工作的实际需求出发,对辅助决策系统软件的设计进行了研究,应用Access数据库和VB6．0,编制出消防部队处置生物突发事件辅助决策系统,并对该软件的相关功能进行了必要的说明。     

基于GAHP的模糊综合评判法在潜艇 作战方案评估中的应用

潜艇作战方案评估是辅助对潜指挥员决策的重要方法,而评估的科学性对决策的有效性影响很大.利用多人层次分析法(GAHP)和模糊综合评判相结合的方法,对潜艇作战方案进行评估,评估的结果可信度高,有利于对潜指挥员的正确决策.最后,通过实例证明了方法的有效性.     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008