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

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

多目标广义指派问题的模糊匈牙利算法求解

提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子.     

一类拟线性周期抛物边值问题

研究了一类带有小扩散系数的拟线性周期抛物混合边值问题。给出当扩散系数趋于零时其非平凡解的渐近性。     

微分方程的有界性与概周期解的存在性

本文考虑高维非自治概周期系统ｄｘｄｔ＝ｆ（ｔ,ｘ）,利用对ｘ的分量分组构造Ｌｉａｐｕｎｏｖ函数的方法讨论了其概周期解的存在性。所得结果去掉了文献中系统存在有界解的假设,得到了比较明显的改进。     

速率偏频激光陀螺寻北仪中转台测角周期性误差的影响分析

连续旋转式寻北仪以其突出的性能成为当前寻北仪研究的热点,但关于转台误差对连续旋转寻北算法精度影响的分析很少.针对速率偏频激光陀螺寻北仪,研究了转台测角周期性误差对寻北结果的影响.理论分析表明,测角周期性误差的存在会导致寻北结果偏离真实值,必须对其进行建模和补偿以提高寻北精度.对理论分析结果进行了仿真实验和样机寻北实验验...     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基因表达缺失值的加权回归估计算法

在基因芯片实验中,数据缺失客观存在,并在一定程度上影响芯片数据后续分析结果的准确性。在不增加实验次数的情况下,缺失值估计是降低缺失数据对后续分析影响的有效方法。利用相似性信息的核加权函数来实现缺失值回归估计的局部化,提出了基于加权回归估计的基因表达缺失值估计算法。在两个不同类型的基因芯片数据上,将新方法与几种已知的方法进行了比较分析。实验结果表明,新的估计算法具有比传统缺失值估计算法更好的稳定性和估计准确度。     

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于集值统计法确定掩护重点目标问题

确定掩护重点是地面防空作战的一个重点和难点问题.利用集值统计分析采集的数据更适合指挥员确定掩护重点的思维方式,用区间数对数据进行处理能较好地降低主观误差.通过对被掩护目标的价值度的求取,为确定被掩护目标重要性顺序和兵力分配提供了依据.算法推理严密,模型简单实用,易于编程实现,为确定掩护重点目标提供了一种很好的算法.