燃料电池AIP废气处理方案优选模型研究

对潜艇300 kW燃料电池几种可行的气体处理方案进行了对比分析,并运用模糊综合评判方法建立了方案优选模型.研究表明,应用旋转床吸收器吸收废气中的二氧化碳,并配以相应的水处理系统,将二氧化碳排至舷外的方案是最佳方案.     

仿生机器人运动建模与控制研究进展

综述了几何方法在仿生机器人运动建模和控制中应用的最新成果,探讨了在统一框架下处理多种机器人运动问题的可行性.     

空间信息栅格体系与服务聚合技术

空间信息应用中存在的数据海量、分布异构、处理复杂、计算密集等问题制约了空间数据和信息的广泛共享和应用。空间信息栅格(SIG)以Grid和WebServices技术为核心,共享并汇集地理上分布的海量空间信息资源,实现动态整合与集成。在构建开放性SIG七层应用体系的基础上,重点研究SIG服务聚合技术,基于Petri网和图论提出了一种新的服务聚合流程模型(服务/资源网),同时构建了可扩展的服务动态选择模型(SISM),实现服务聚合过程中的动态服务选择。结合国家地质调查业务应用,通过地下水资源评价应用实例对SIG的实用性和有效性进行了验证。     

基于成败型试验数据的弹药贮存寿命评估

简述了弹药在贮存状态下的失效特点,建立了基于成败型试验数据的弹药贮存寿命评估数学模型和统计分析方法,评估了某种弹药在一定置信度下的可靠贮存寿命。     

军队工程招标激励模型研究

运用激励理论研究了军队工程招标采购过程中军方与承包商之间的关系,建立了军队工程招标激励模型。在不完全信息和竞争性招标中,投标人的行为是追求最大的效用,军方则需要建立一种机制诱使投标人按真实成本信息报价,以达到预期支付最小的目的。这种招标博弈的结果是军方与投标人之间达成贝叶斯纳什均衡(Bayesian Nash equilib- rium),即军方利用激励合同诱使投标人报出其真实成本,而投标人为达到中标目的则必须采取讲真话的占优策略,最终在双方均可接受的条件下达成协议。在此基础上,结合实际研究提出了改进的综合评标模型。     

基于仿真模型与遗传算法的最优火力分配模型

针对装备了先进舰载防空武器系统的舰艇编队,需要航空兵与水面舰艇联合多批次打击才能取得满意战果,由于毁伤经验公式所限,现有的算法只能解决对舰艇编队一次打击的火力最优分配问题,而不能很好的解决对舰艇编队多次打击的火力最优分配问题。论文将仿真模型加入遗传算法运算过程中,利用仿真得出每次打击目标的毁伤状态,并将其结果作为遗传算法的参数进行寻优。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.