均匀设计在柴油无灰节能降污添加剂配方研制中的应用

基于低压氧弹燃烧法研究了充氧压力分别为0．6MPa和0．9MPa时两种无灰型柴油添加剂不同配比对助燃性能的影响。采用均匀实验设计和Matlab回归优化的方法，得到复配体系的最优配方，并对其进行了验证。结果表明，由Matlab回归分析得到的完全二次回归模型最理想，0．6MPa时由该模型得到的最优配方为：添加剂A和B的质量分数分别是0．300‰和0．700‰，并通过实验验证得到的发热量达到最大，变化率为8．697％。0．9MPa时，结合直观分析和回归分析，得到与实际相符的最优配方：添加剂A和B的质量分数分别是0．600‰和0．900‰，此时发热量皮化率为4．453％。     

一种面向Agent的概念化建模方法*

面向Agent的建模方法为基于Agent系统的概念化描述提供了一种新的技术.针对多Agent系统分析与建模问题,扩展并规范了面向Agent概念化建模过程,定义了Agent模型及其扩展模型,并给出了形式化描述.同时,给出面向Agent的分析和设计过程,为其具体建模提供了一种高层指导.最后,与其它现有面向Agent的方法在应用方面进行了类比分析,为该方法的广泛和深入地应用研究打下基础.     

基于模糊动态层次分析法的军车全寿命费用模型

为研究军车最优的效费比，提出了控制军车装备费用增长的有效途径——全寿命费用管理方法，并通过模糊动态层次分析法建立了分析决策模型，将定性与定量的分析有机结合起来研究军车全寿命费用的变化趋势，有利于提高军车装备的可靠性和决策的科学性，具有较好的应用价值。     

公共场所人员安全疏散评价方法探讨

公共场所安全疏散评价对于确保火灾中人员的生命安全具有重要意义。基于“性能化”防火设计的思想，对影响公共场所安全疏散的因素进行了分析，并对安全疏散的必要性能和评价程序进行了较为全面的探讨，其中包括烟气的评价、人员疏散能力的评价、疏散路线合理性的评价、疏散对策的评价等，目的在于通过合理的评价方法得出合理的疏散性能，为减少公共场所火灾造成的人员伤亡和财产损失提供帮助。     

关于奥运临时用房消防设计问题的技术探讨

由于奥运临时用房项目建设的临时性、特殊性、紧迫性，导致了部分项目的消防设计存在难以满足现行规范的问题。笔者作为消防设计审核人员，以“为建筑内人员提供安全保障；为消防人员提供消防条件，保障其生命安全；尽量减少财产损失；保护结构安全；尽量减少对正常营运的干扰。”为安全目标，利用消防性能化设计，完善了消防设计中的火灾防控技术措施。     

基于学科间差异信息的协同优化改进算法

分析了MDO(Multidisciplinary Design Optimization)中广泛应用的协同优化算法的特点和存在的问题,提出了一种基于学科间差异信息的协同优化改进算法COMI(Collaborative Optimization based on Multidisciplinary Inconsistency).利用学科间差异信息构造了系统级松弛约束和系统级罚函数,利用遗传算法作为系统级优化算法,并采用标准算例比较了标准CO(Collaborative Optimization)算法、松弛CO算法与COMI算法的性能.结果表明COMI算法在设计结果可行性和最优值上平衡性较好.     

UCAV编队对地攻击智能决策系统总体结构

UCAV编队对地攻击是未来战争制信息权和制空权的关键所在,结合无人作战飞机(UCAV)与有人驾驶飞机各自的特点和优势,提出了UCAV编队对地攻击系统的基本组成和对地攻击流程.根据UCAV编队对地攻击的战术决策类型和决策方式,构造了UCAV编队对地攻击智能决策系统的总体结构并且提出了决策系统应该解决的关键技术,详细分析了所建立的UCAV编队对地攻击决策系统的决策方式和决策流程,并且对该系统所涉及的关键技术进行了详细的研究.     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

蚁群算法在车辆巡回保障中的应用研究

应用蚁群算法（ACA）解决车辆巡回保障问题，建立了车辆巡回保障优化数学模型，对轨迹更新规则进行了重新设定，给出了算法的实现步骤。通过算例分析，将计算结果与遗传算法（GA）和粒子群算法（PSO）作了比较，对模型和算法的正确性、高效性和适用性进行了验证。实验结果表明，该算法可以快速、有效求得车辆巡回保障的优化解，得到车辆巡回保障过程中的较优方案。