An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

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     

一种基于几何特征的虹膜定位算法

虹膜定位是虹膜识别中基础性环节,其精度和速度决定了虹膜识别系统的性能。为提高虹膜定位的速度,提出一种基于圆几何特征的虹膜内边缘定位算法,利用内外边缘中心的耦合特性缩小微积分方法搜索外边缘的范围。实验结果表明,与经典虹膜定位算法相比,提出的算法快速、精确、鲁棒。     

空基平台无源定位精度分析

针对三维空间内的空基平台对海面目标的无源定位问题,在考虑了多种测量误差因素的条件下,建立了定位模型,分析了各种测量误差对最终定位精度的影响.仿真实验表明,所采用的定位精度分析方法能够有效的分析空基平台的定位精度.从仿真实验结果中得到了各种测量误差对定位精度影响的一些指导性结论,为提高空基平台无源定位的测量精度提供了依据.     

《潜伏》：红色经典的三个突破

谍战剧《潜伏》注重文化内涵的挖掘,融入了以往谍战类作品鲜见的人文因素,从信仰、人性深度、英雄的悲剧意蕴等三个方面进行了严肃的探讨。     

基于转业回报视角的我军高素质人力资本流失分析

从微观主体人力资源投资的角度来理解军队高素质人力资源的流失现象,以人力资本投资理论、经济学成本一效益理论和激励相容理论为基础,在Mincer工资方程的基础上建立转业回报方程,通过计算教育回报率和转业回报率来解释我军高素质人才缺失、高素质人才留不住的现况。为从实证角度分析转业回报率和教育回报率,提出相应的政策建议奠定了理论基础。     

信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。     

泥沙传输方程广义初边值问题的解析解与差分解比较

Cheng提出了泥沙传输问题的广义底边界条件并导出了具有复杂形式的解析解 ,解析解的求解过程中还需求解两个超越方程。本文一方面分析了解析解的复杂性 ,简化了超越方程根的搜索区间 ,另一方面 ,通过数值试验 ,得到了一类稳定的差分格式 ,格式参数为 0 .48≤Θ ≤ 1 ,数值例子表明 :对于稳定的差分格式 ,差分数值解具有很好的逼近效果。     

依据噪声能量变化提取目标运动信息的方法

在对被动噪声声纳接收的噪声能量随时间的变化规律分析的基础上,从理论上分析噪声能量的变化与目标运动参数关系,给出了其中所含目标运动信息的提取方法.     

一种多方位一距离目标定位的最小二乘伴随估计器

对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器．该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用．