一种关于~pc(0≤c<1)的快精算法

求pc(p>1,正整数)的值时,若c较小,通常会存在收敛速度较慢以及数值字长有限所致精度变差的问题。提出了一种关于pc(0≤c<1)的快精算法,该方法按照定点二进制数特点,通过适当扩大c值,利用牛顿迭代法求取近似值,在采用选值法确定初值时,将对应值域分为若干等间隔子区间,初值精度取决于间隔h的大小,而h的大小则根据迭代精度和预定迭代次数确定,由此可获得高精度初值,从而在理论上使pc的迭代计算达到快速、高精度的目的。     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Unpacking the various meanings of redundancy: from refining the concept to military planning

The authors engage in the debate over waste in military force structure planning by rigorously deconstructing the concept of “redundancy.” First, a typology of redundancy is constructed that provides a common framework for identifying variety among redundant structures. These are labeled “true redundancy,” “expanded capacity,” “portfolio diversification,” and “mission overlap.” Further, a number of mechanisms are identified that produce these types of structures, and show the conditions under which planners may utilize redundant structure in the search for optimization. In sum, the article provides refined concepts for analysts and planners to identify when redundancy is deleterious or beneficial.     

基于GRA-PSO算法的端铣工艺参数多目标优化

考虑生产实际的需求,综合最小变形误差、最大金属切除率和最大刀具耐用度建立端铣工艺参数多目标优化模型。通过对粒子群全局寻优能力和灰色理论的适应性综合分析,研究提出耦合粒子群算法（Particle Swarm Op-timization,PSO）和灰色关联（Gray Relevancy Analysis,GRA）的多目标工艺参数优化算法。该方法将多目标函数的优化问题转化为优化单项灰关联度,得到了多项工艺指标要求下的参数优化组合。将该方法应用在多目标工艺参数优化设计中取得了满意的结果,表明其具有很大的适应性。     

基于模态分析的变速箱振动测点优化配置

针对坦克变速箱振动信号在状态监测中测点的选择问题,提出了根据不同测点的频响特性优化振动测点的方法。通过分析变速箱箱体的有限元动力学模型,得到箱体的各阶固有频率和振型,选择模态分析中总位移较大的位置作为最优的测点安装传感器,为试验测点布置以及状态监测和评估提供理论支持。研究结果表明：位于风扇联动装置齿轮箱附近的传感器对变速箱振动信号的强弱变化比较敏感。     

一种考虑权重的多专业流水式批量维修任务调度模型

针对维修专业不同的设置模式和运行模式,对多专业流水式批量维修任务调度问题进行了分析和建模,在考虑任务权重的基础上将该问题分成两步求解。首先,建立了初始专业领域内批量维修任务调度及优化模型;其次,建立了考虑任务权重的多专业流水式批量维修任务调度模型。实例验证表明：该方法更贴近于实际,可快速、有效地解决批量维修任务调度问题。     

战场环境下无人车辆战术机动路径规划方法

针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化（Particle Swarm Optimization,PSO）方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO（BPSO）算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化（Particle Swarm Optimization based on the Multi—tasking Subpopu—lation Cooperation,PSO-MSC）算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明：该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。     

基于自适应变异粒子群算法的火力分配方法研究

针对最优火力分配的特点,分析了火力分配优化问题的数学模型,设计了一种求解该类问题的自适应变异粒子群算法（Adaptive Mutation Particle Swarm Optimization, AMPSO）。该算法采用十进制编码方法和基于数值运算的个体更新方法;为平衡算法的局部搜索能力和全局收敛性能,设计了一种关键参数自适应调整方法;为增强种群在进化后期的多样性,提出了一种变异策略。仿真结果表明,所提AMPSO算法具有良好的寻优性能,是优化火力分配的一种有效算法。     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

面向突防效能的超声速巡航导弹总体设计技术初步研究

防御系统技术的不断发展,对超声速巡航导弹设计提出了新的需求.针对以“性能”为核心的设计不能满足超声速巡航导弹设计新需求的问题,初步探讨了面向突防效能的超声速巡航导弹总体设计技术.分析了国内外导弹武器设计技术的发展,指出设计技术向着以“效能为核心”的设计方向发展;提出了面向效能的设计理念,分析指出面向效能的设计是以追求满意设计为目标的优化设计;在新的设计理念指导下提出了面向突防效能设计的技术框架,主要说明了面向突防效能的超声速巡航导弹设计框架、效能基础、技术基础、基本模式以及几项关键技术等.