随机动态规划的混合算法研究

针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

复杂大系统仿真的VV&A理论及过程研究

为了确保复杂大系统仿真(LCSS)的可信性,应该在建模与仿真(M&S)的全生命周期中开展校核、验证与确认(VV&A)研究.对LCSS的VV&A进行了理论研究,提出其方法论与原则;以基于仿真组件构建的HLA仿真系统为例,从仿真组件层、联邦成员层及联邦层三个层面研究了VV&A过程,并将这些研究应用于反舰导弹突防联邦仿真中.实践表明,研究对LCSS的VV&A工作具有很好的指导作用,有力地保障了仿真的可信性.     

基于结构熵理论的师装备保障力量层次设置模式评价研究

针对师装备保障力量层次设置模式优选时缺乏定量分析的问题,尝试从系统信息论的角度,采用结构熵理论对师装备保障力量层次设置的组织结构有序度进行客观评价,用时效熵和质量熵分别对师装备保障力量层次设置组织结构中信息流通的时效性和质量性进行度量,为师装备保障力量层次设置模式的选择提供科学依据。     

Making defense planning meaningful: the evolution of strategic guidance in the Hungarian Ministry of Defense

Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary.     

利用镁金属化学还原法制备多孔Si/Si-O-C负极材料机理研究

以二乙烯基苯和聚硅氧烷为原料经先驱体转化法制备了Si-O-C材料,利用镁金属在惰性气氛保护下高温还原制备了多孔的Si/Si-O-C负极材料。Si/Si-O-C负极材料的首次放电与充电容量分别为547.2和450.7mAh?g-1,第二次放电与充电容量分别为487.4和422.9mAh?g-1,库伦效率分别为82.3%、86.8%,材料具有较好的循环性能。利用X射线衍射(XRD)、能谱分析(EDX)、元素分析和场发射扫描电镜(FE-SEM)分析了多孔Si/Si-O-C负极材料的组成、结构、形貌,从而研究利用镁金属化学还原法制备多孔Si/Si-O-C负极材料的机理。结果表明,镁金属在还原过程中生成MgO和Mg2SiO4等产物,经HCl洗涤后可形成多孔的Si/Si-O-C负极材料。Si/Si-O-C材料中的单质硅分布于多孔的Si-O-C相中,一定程度上可缓解Si在循环过程中产生的体积效应。利用镁金属还原Si-O-C材料制备多孔Si/Si-O-C材料是一种可行的制备方法。     

基于协方差矩阵估计的稳健Capon波束形成算法

常规Capon波束形成器性能对模型误差或失配非常敏感,尤其是当期望信号包含在训练数据中,导向矢量失配将引起性能急剧下降。为解决这一问题,提出了一种采用干扰噪声协方差矩阵和导向矢量联合估计的稳健波束形成算法。该方法通过对Capon空间谱在非目标信号的方位区域内的积分,实现对干扰噪声协方差矩阵的估计,解决数据协方差矩阵包含有目标信号时引起信号自相消问题;其次为了克服导向矢量失配的影响,通过最大化输出功率,并增加二次型约束防止估计的导向矢量接近于干扰导向矢量,实现对导向矢量的估计。仿真实验表明:该算法能获得近似最优的输出信干噪比,与现有算法相比稳健性更强。     

水下缩比航行体热尾流的红外探测实验研究

根据缩比模型,建立了缩比红外成像实验测试系统,对水下航行体的体积、航行深度、运动速度、尾流排放等进行了缩比设计,设计了多种实验工况,可实现缩比目标模型红外尾流的静态和动态测试,一方面明确红外尾流的可探测性,另一方面掌握红外尾流可探测性的影响因素以及红外尾流的变化规律,为下一步工作奠定基础。