基于遗传算法的目标分配优化模型研究

结合现代防空作战的特点,给出了现代防空作战的目标分配模型,利用遗传算法给出了模型求解的方法及步骤;实践证明该方法解题速度快,结果的精度高,可以为决策者作出科学、准确的决策提供有力支持。     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

某高炮武器系统作战效能评估

某高炮武器系统是我军近几年装备的一种性能优良、技术先进的新型防空武器系统,在反空袭作战中将发挥重要的作用,计算该系统的作战效能具有重要的军事价值和现实意义。建立了计算高炮武器系统对空中目标毁歼概率的数学模型,给出了作战效能评估的数学公式,分别计算了某高炮武器系统用X波段雷达、Ka波段雷达、电视激光方式工作时的作战效能。     

一种改进的雷达探测概率计算方法

基于对指挥自动化系统日常积累的雷达情报数据进行处理,提出了一种改进的雷达探测概率计算方法。综合考虑了目标在飞行过程中,RCS随着其与雷达相对位置的变化而变化的因素,对各个高度层上的航迹按距离取样间隔分段,统计各分段内的观测点数和发现点数,从而计算各距离取样间隔内的发现概率,再根据目标相对雷达的俯仰角和方位角对距离取样间隔中心点的探测距离进行修正。     

对马克思主义基本原理概论课实施案例教学的思考

案例教学是一种比较理想的符合大学生认知规律和心理需求的新教学尝试。它在教学实践中的灵活运用,为“两课”教学改革提供了新的契机,成为深化“两课”教学方式改革的新的突破口。《马克思主义基本原理概论》实施案例教学要努力提高增强思想政治理论课教师的责任感和敏锐性,要注重紧密围绕思想政治教育的目标展开教育教学,要努力捕捉学生理论思考中的疑点、热点和难点进行案例教学。     

中国维和警察防暴战术理论体系初探

研究维和警察防暴战术理论体系,以丰富维和警察理论体系,为维和警察在任务区执行任务提供理论支持。重点对维和警察防暴战术理论体系的概念、构成及应用进行了论述。     

防空火控系统火力分配的多目标优化研究

在防空火控系统的研究中,如何充分发挥火力单元的作战效能,使来袭目标遭受最大的毁伤,是火力分配研究的一个关键问题.通过对防空火控系统的分析,给出了防空火控系统火力分配的问题描述,并建立了基于指派问题的火力分配数学模型.提出了威胁度计算的改进方法.在使防空高炮群对威胁度大的目标造成大的毁伤分配准则下,研究了利用匈牙利法求解指派问题时的具体方法.经仿真验证,此火力分配方法合理、有效.     

CEC条件下舰艇编队目标武器分配研究

在分析CEC条件下舰艇编队目标武器分配模式的基础上,综合运用MAS理论与方法,建立了舰艇编队目标武器分配MAS模型,即利用Agent描述舰艇编队的各种物理资源或逻辑资源,通过网络及Agent通讯协议将多个Agent连接成一个整体系统,设计了映射实体功能的Agent结构,从而为舰艇编队目标武器分配决策提供了一条新途径.     

Statistical analysis of exponential lifetimes under an adaptive Type‐II progressive censoring scheme

In this article, a mixture of Type‐I censoring and Type‐II progressive censoring schemes, called an adaptive Type‐II progressive censoring scheme, is introduced for life testing or reliability experiments. For this censoring scheme, the effective sample size m is fixed in advance, and the progressive censoring scheme is provided but the number of items progressively removed from the experiment upon failure may change during the experiment. If the experimental time exceeds a prefixed time T but the number of observed failures does not reach m, we terminate the experiment as soon as possible by adjusting the number of items progressively removed from the experiment upon failure. Computational formulae for the expected total test time are provided. Point and interval estimation of the failure rate for exponentially distributed failure times are discussed for this censoring scheme. The various methods are compared using Monte Carlo simulation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009