Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

基于信息需求的情报支持效能分析

经典的侦察与监测(S&R)系统效能分析方法存在模型难以建立、结果不准确等问题。考虑到S&R系统的目的是提供情报支持,提出一种基于信息需求的S&R系统情报支持效能分析方法。该方法以用户的信息需求为度量基准量,比较S&R系统性能对信息需求的满足度,并以此满足度作为S&R系统效能度量的指标。仿真实例表明了新方法的有用性。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

宽带模糊函数的群论解释及小波变换求解

讨论了各种形式的宽带模糊函数,通过群论分析表明,它们都可解释为二维不可约仿射群U表示的矩阵系数,因此其性质可通过对仿射群的研究作出解释。还讨论了宽带模糊函数与小波变换的关系,并由此导出其高效的小波变换求解方法。     

线性核时频信号表示及其仿真

根据ｃｈｉｒｐ信号在模糊域的特点,本文提出了线性核时频表示方法。这种方法在提高分辨率、消除交叉项以及抑制噪声等方面都具有较高的性能。理论分析和实验结果都证实了这种方法的有效性     

整数线性规划问题的一个新算法

本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。     

一种适用于长基线的改进CIR算法

长基线下,受伪距多径和电离层残差影响,传统的CIR法解算载波相位宽巷模糊度时某些历元无法得到正确的结果,基础载波模糊度的搜索范围也较大。分析了CIR法的模糊度误差,提出了基于载波相位平滑伪距并且消除电离层时延的改进的CIR算法,分析了其误差方差,最后利用Compass系统实测数据对短基线和长基线两种情况下CIR法和改进CIR法的解算结果进行比较。实测数据表明,本文提出的算法能够单历元解算超宽巷模糊度和宽巷模糊度,并且能够大大缩小基础载波模糊度的搜索空间。     

一种新的星载高分辨宽测绘带SAR运动目标

本文针对星载多通道高分辨宽测绘带合成孔径雷达系统,提出了一种地面运动目标检测和参数估计方法,该方法首先利用空时自适应处理进行杂波抑制,然后采用传统SAR成像处理得到模糊的运动目标图像,接着利用恒虚警检测技术检测出所有运动目标,包括真实目标和由于多普勒模糊引起的虚假目标,再根据模糊图像的空间位置关系从所有成像目标中检测出运动目标的真实成像位置,最后根据运动目标的斜距历程得到因运动目标速度引起的图像位置偏移,由此估计得到运动目标速度。该方法具有运算量小、检测精度高等优点,星载仿真数据验证了本文方法有效性。     

STCN的对岸打击时间协同冲突消解研究

为验证航空兵对岸打击中时间协同计划的可行性以及快速地调整时间协同计划,建立了任务间的简单时间约束网络(STCN),并转化成权值矩阵的形式.根据权值矩阵特点,提出了一种检测STCN一致性的权值矩阵法,大大降低了算法复杂度.为加快时间协同计划的调整速度,基于检测结果,提出了一种代价最小的冲突消解方法,避免了消解过程中的重复检测问题,提高了效率,使计划调整更加快捷高效.