改进蚁群算法在DSR路由协议中的应用

针对移动Ad hoc网络节点移动频繁和单路径DSR路由协议不能均衡负载、网络健壮性低以及蚁群算法存在局部查询最优的问题,提出一种改进的蚁群算法,并把改进的蚁群算法应用到单路径路由协议DSR,设计出基于蚁群算法的多路径路由协议IDSR,通过仿真实验,从影响Ad hoc网络路由协议性能优劣的3个主要指标来比较IDSR、DSR路由协议和SMR路由协议的性能,实验结果表明,虽然改进协议IDSR路由开销比DSR、SMR稍有增加,但分组的投递率和平均端到端延时性能都有明显提高。     

Dynamic policy for idling time preservation

This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations.     

脱壳弹弹托分离的双目视觉测量

脱壳弹的弹托分离过程对弹体的飞行稳定性和打击效能具有显著的影响。针对脱壳弹出膛后弹托相对弹体的六自由度运动过程,提出采用基于双目视觉原理的弹托分离角测量方法。通过在弹体表面和弹托表面设置标记点,采用图像处理和跟踪算法实现对标记点的识别和跟踪。结合双目空间标定参数解算出标记点的空间位置,进而获得弹托相对弹体的分离角度,同时采用实验验证了上述测量方法的精度,其精度达到2%。以实验室进行的初速度1 550 m/s和1 750 m/s的脱壳弹射击试验为例,测量并分析了不同初速度下的弹托分离轨迹。结果表明:脱壳弹分离初速度越快,弹托分离轨迹越靠近弹体。     

混合遗传算法及其在运载火箭最优上升轨道设计中的应用

运载火箭最优上升轨道设计问题是一类终端时刻未定、终端约束苛刻的最优控制问题,经典算法求解这类问题时收敛性差、局部收敛等问题表现得比较突出。针对上述问题,将具有良好全局收敛性的遗传算法应用到运载火箭最优上升段设计问题求解中,为了提高遗传算法的收敛速度和克服早熟问题,结合遗传算法和单纯型算法的优点,设计了两种混合遗传算法。计算结果表明,所设计的混合遗传算法是求解复杂问题的有效全局优化方法,可以成功地解决一类终端时刻可变飞行器最优控制问题。     

The gradual covering problem

In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

舰船装备修理规划方案的DEA分析与优化

运用DEA方法对舰船装备修理规划方案的有效性进行了分析,对非有效单元的改进途径进行了探讨,为舰船修理规划的制定提供了科学依据.     

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

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

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     

基于Kriging模型的环形桁架可展天线结构参数优化方法

针对传统结构动力学优化过程中求解效率较低的问题,以环形桁架可展天线结构参数优化为研究背景,在环形桁架可展天线结构的参数变量空间中,以试验设计方法选取样本点,通过有限元方法得到各个样本点的第一阶固有频率、固定载荷最大变形等响应值,利用样本点和响应值的关系建立Kriging近似模型进行优化算法的寻优,得到满足所有约束条件的最优解。结果表明,所得到的环形桁架可展天线第一阶固有频率、固定载荷最大变形的响应面呈现比较明显的非线性关系,基于Kriging模型的结构优化方法能比较准确地对环形桁架可展天线进行寻优设计。     

战时野战通信装备随机备件优化方法

随着模块化技术在军事领域的广泛应用,通信装备的战场抢修通常采取换件修理的方式。针对战时野战通信装备随机模块化备件的配置问题,建立了装备战备完好性和费用约束的优化模型,并给出了遗传算法的求解过程。通过实例分析表明该方法能够在战时为装备配置数量合理的备件,使装备备件在满足战备完好性的基础上携行量最少。