一类具有时滞和捕获的食物链模型的周期解

研究一类具有时滞和捕获的食物链模型,借助重合度理论中的Mawhin延拓引理,得到了保证系统至少存在8个正周期解的充分条件。     

多尺度法的设解形式之探讨

当采用多尺度法研究非线性振动问题时,经常会遇到不同情形下系统响应的设解形式不同的问题.文中针对一类具有平方和立方非线性项的单自由度和多自由度非线性系统,得到不同设解形式下的一次近似解和二次近似解,并与数值解相比较,发现两种设解形式的近似解与数值仿真解的解曲线吻合很好,表明传统的各种设解形式在研究弱非线性系统时都有很好的近似性.     

一类污染环境下扩散种群周期解的存在性

研究了两斑块中一个斑块受到污染的一类种群系统,通过运用Gaines和M awh in重合度延拓定理,得到了系统周期解存在的一个充分条件。     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于逼近理想解排序法的导弹保障性评价研究

保障性评价是实现导弹综合保障目标的重要手段。根据保障性评价指标模型建立了决策判断矩阵,采用层次分析法确定各指标权重,利用逼近理想解排序法对导弹保障性评价进行了定量分析。通过实例分析,这种方法计算简便,可操作性强,有实际应用价值。     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

具有脉冲和Holling IV类功能反应的三维捕食系统

建立了在固定时刻具有脉冲效应的三维捕食系统,利用常微分方程比较原理、含脉冲的比较原理及Lyapunov函数方法,得到了该系统的持续生存性、周期解的存在唯一性和全局吸引性,并给出了保持这些性质时脉冲项应满足的界限.     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

圆锥壳方程的二次渐近解

本文由旋转壳的一对二阶常微分方程得出圆锥壳的复变量方程,利用渐近积分法推导出方程的一次近似解和二次近似解。二次近似解达到薄壳理论所具有的精度,一次近似解也具有足够精度。对于所取算例,本文解的计算结果与已有的Kelvin函数解的结果符合良好。但本文解为有限形式的简单表达式,便于计算应用。