Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

Evergreening and operational risk under price competition

“Evergreening” is a strategy wherein an innovative pharmaceutical firm introduces an upgrade of its current product when the patent on this product expires. The upgrade is introduced with a new patent and is designed to counter competition from generic manufacturers that seek to imitate the firm's existing product. However, this process is fraught with uncertainty because the upgrade is subject to stringent guidelines and faces approval risk. Thus, an incumbent firm has to make an upfront production capacity investment without clarity on whether the upgrade will reach the market. This uncertainty may also affect the capacity investment of a competing manufacturer who introduces a generic version of the incumbent's existing product but whose market demand depends on the success or failure of the upgrade. We analyze a game where capacity investment occurs before uncertainty resolution and firms compete on prices thereafter. Capacity considerations that arise due to demand uncertainty introduce new factors into the evergreening decision. Equilibrium analysis reveals that the upgrade's estimated approval probability needs to exceed a threshold for the incumbent to invest in evergreening. This threshold for evergreening increases as the intensity of competition in the generic market increases. If evergreening is optimal, the incumbent's capacity investment is either decreasing or nonmonotonic with respect to low end market competition depending on whether the level of product improvement in the upgrade is low or high. If the entrant faces a capacity constraint, then the probability threshold for evergreening is higher than the case where the entrant is not capacity constrained. Finally, by incorporating the risk‐return trade‐off that the incumbent faces in terms of the level of product improvement versus the upgrade success probability, we can characterize policy for a regulator. We show that the introduction of capacity considerations may maximize market coverage and/or social surplus at incremental levels of product improvement in the upgrade. This is contrary to the prevalent view of regulators who seek to curtail evergreening involving incremental product improvement. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 71–89, 2016     

合成分队动态武器目标分配协同决策模型

针对合成分队地面作战特点,提出了一种动态武器目标分配的协同决策模型,该模型基于一种自适应决策中心的协同决策体系结构,以战场信息共享为核心,实现动态火力协同优化分配。提出了针对战场应急目标的一种快速火力分配方法,提高火力整体打击效率的火力适度分配优化方法,适应战场态势动态变化的anytime终止控制方法。仿真实例表明,该模型能够满足合成分队火力动态分配的需求,提高动态武器目标分配决策的合理性和科学性。     

基于Riccati方程的动态传感器分配算法

针对组网跟踪系统传感器分配算法计算量过大的问题,提出了一种基于Riccati方程的动态传感器分配算法。该算法通过Riccati方程离线计算各传感器组合跟踪下的稳态滤波协方差,根据稳态滤波协方差与期望协方差的接近程度动态分配传感器资源。仿真结果显示,与传统协方差控制和贪婪算法相比,基于Riccati方程的动态传感器分配算法在大大减少计算量的同时能够保持较好的跟踪性能。该方法能够更好地应用于大规模传感器组网目标协同跟踪系统。     

战场运动目标快速跟踪研究

针对现有的基于图像序列目标提取算法HS算法和LK算法过于复杂、运算量大等缺点,提出了快速微分光流法,并利用Matlab仿真实验验证了该技术的可行性。     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

基于BIST的3D SRAM中TSV开路测试算法研究与实现

基于3D-IC技术实现的3D SRAM,其电路中使用了大量的TSV。目前TSV制造工艺尚未成熟,使得TSV容易出现开路或短路故障,从而给3D SRAM的测试带来新的挑战。现有的2D BIST测试方式能够探测到3D SRAM中存在的故障,但并不能判定是TSV故障还是存储器本身故障;TSV专用测试电路虽然能够探测出TSV的故障,但需要特定的测试电路来实现,这就增加了额外的面积开销,同时加大了电路设计复杂度。基于此,本文提出了一种使用测试算法来探测TSV开路故障的方法,在不使用TSV专用测试电路且不增加额外面积开销的情况下通过BIST电路解决3D SRAM中TSV的开路故障检测问题。结果显示该TSV测试算法功能正确,能够准确探测到TSV的开路故障,并快速定位TSV的开路位置。     

空投着陆缓冲系统效能评估模型

为了有效构建空投缓冲系统效能评估体系,研究建立了不同缓冲系统通用效能评估模型。模型综合分析缓冲系统作战能力与保障能力,建立了空投缓冲系统效能指标体系。在此基础上,运用效能评估ADC模型与AHP方法,结合指标能力量化准则实现对缓冲系统效能的定量评定。通过实例计算,验证了模型的正确性和有效性,为缓冲系统的发展论证与使用决策提供依据。     

基于改进QPSO-NN的冗余机械臂逆运动学算法

针对某种冗余机械臂逆运动学求解的问题,提出了一种基于改进量子粒子群神经网络的求解算法。以冗余机械臂末端位姿为输入,经神经网络求得其逆解;针对神经网络输出结果误差较大的问题,把神经网络求初值加入初始化的粒子群中,通过基于Metropolis准则改进量子粒子群算法,避免了量子粒子群算法的早熟现象;以关节坐标经正向运动学求得的末端位姿和期望位姿的误差为适应度函数,对机械臂关节坐标迭代寻优。仿真结果表明该方法结合了神经网络算法的快速性和改进量子粒子群算法的精确性,满足求冗余机械臂逆运动学问题的速度和精度要求。