Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

利用AHP确定决策方案排序的一种改进方法

针对在用AHP法求解权重排序向量时 ,用不同的计算方法导致排序方案不一致的矛盾现象 ,提出了一种在单准则下综合各个排序方案信息的方法 ,使AHP法更趋于完善     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

长码直扩信号的符号速率盲估计方法

针对长码直接序列扩频(DSSS)信号的符号速率估计的难题,提出了基于相关处理的方法。该方法首先估计长码直扩信号的相关函数二阶矩,然后将相关函数二阶矩的估计作为输入信号进行预处理,以去除扩频码周期处的峰值。对预处理后的信号再次进行自相关处理,则所得的信号的频谱中含有符号速率谱线。理论分析和计算机仿真证明了所提出的算法的有效性。     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

作战体系有序性判别模型*

未来作战已经逐步演变为体系之间的对抗,为确保我军作战体系有序进行发挥其作战力量,探讨了作战体系有序性问题;应用了耗散结构理论和灰色系统理论,把灰关联度与熵结合起来,以序参量为基础,建立了基于灰关联熵的作战体系有序性判别模型.研究结果为对作战体系实施调控提供了依据,使作战体系符合现代战场态势发展的需要.     

一类二阶微分方程Poincaré分岔极限环的不存在性

讨论一类二阶微分方程x¨+εf(x,x.)x.+g(x)=0的Poincar分岔极限环的不存在性,利用一阶Mel’nikov函数直接从整体上进行分析讨论,得出了若干充分条件和判别准则。     

军事欺骗战法分析的数学方法-应用

针对军事欺骗战法定量分析困难的问题,采用基于贝叶斯统计推断和博弈均衡分析的数学方法,在理论上为解决此难题提供了一种可行的方法。该方法首先定义基本概率矩阵,然后根据贝叶斯原理为交战双方构造用于统计推断的主观概率矩阵,并在由两个主观概率矩阵元素构成的偏序链与实施军事欺骗机会之间建立对应关系,再将此关系推广到基本概率矩阵,即是否存在实施军事欺骗的机会将由基本概率矩阵元素构成的偏序链决定。对理论成果的初步应用表明：通过分析由战场情报信息构成的基本概率矩阵的偏序链,可以科学地运用军事欺骗和反军事欺骗战法。     

基于语言评价信息的多方案选优研究

通过LWD和LOWA算子,给出了一种算法。该算法在预先定义语言短语排序的情况下,可将专家群给出的多个指标下多个方案的语言评价信息集结为对方案的语言短语排序,从而可选出最优方案,并通过仿真算例,证明了该方法的有效性。     

运载器牵制释放结构动力响应数值模拟方法研究

将运载器牵制释放垂直发射的过程依次分为静态、牵制、释放三个阶段.利用MSC.Patran/Nastran的场功能和分组分析功能,将前一个阶段的计算结果场向后一个阶段的初始条件场传递,提出了一种分析运载器牵制释放全过程结构动力响应的分阶段计算新方法.解决了牵制释放过程中由于出现运载器-发射台分离面给结构动力响应计算带来的困难.采用该方法计算了几个运载器牵制释放的算例,分析了牵制阶段牵制力的变化、释放阶段运载器结构动力响应的特点、不同释放时间对结构动力响应的影响.算例表明:该方法实施简便、精度较高,还可拓展用于不同时刻释放、释放不同步、施加缓释力等条件下运载器结构动力响应的分析,为牵制释放系统的研制提供参考.