对潜搜索的灰色整数规划模型

在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴.     

装备寿命周期备件供应网络优化方法

针对现有备件供应优化方法未从寿命周期角度考虑备件供应优化问题,将寿命周期不同阶段的备件需求特征融入备件供应网络设计中,实施动态需求特征下的寿命周期整体优化。深入分析寿命周期不同阶段的备件需求特征;建立备件供应响应时间转移方程,在此基础上,构建使寿命周期备件保障效益最大的多目标混合整数规划模型。通过仿真案例证明了多种备件保障模式的组合能够显著提高寿命周期保障效益,寿命周期整体优化可以实施更高效的备件供应。     

Mitigation of EDFA transient effects in variable duty cycle pulsed signals

We report the transient effects in Erbium Doped Fiber Amplifier (EDFA) systems for pulsed signals with different duty-cycles. The work includes the analysis using three different duty-cycles, 10%, 20% and 50%. A curve fitting technique is also proposed to predict the transients of any lesser duty-cycled pulse, once the transients of a larger duty-cycled pulse is known. Mathematical evaluation confirms the double exponential shape of transient distorted signal. Further, EDFA transient effect is experimentally verified on a Wavelength Division Multiplexed (WDM) link by multiplexing high and low bitrate modulated optical signals. We conclude the paper by proposing a transient suppression technique for variable duty-cycle signals and analyzing its effectiveness with different wavelength spacing.     

舰船空调系统不同保障模式的效费分析

分析了舰船全寿命期和使用期的结构,在此基础上,借助于WSEIAC模型,分别对舰船空调系统在两种保障方式的全寿命使用期效能和费用的各个指标进行了建模,提出了指标计算的思路与计算方法.结合海军舰船特点,在对WSEIAC效能模型进行修改和完善的基础上,给出了计算示例,结果显示了海军舰船空调系统采用岸基保障方式的合理性和优越性.     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一类具Holling-Ⅲ类功能性反应的食物有限捕食-被捕食模型的极限环

研究一类具Holling-Ⅲ类功能性反应的食物有限捕食-被捕食模型的动力学性态。应用微分方程定性理论，证明当正平衡点不稳定时该模型存在唯一稳定的极限环。     

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     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上，确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足，采用一种基于加权的模糊C均值聚类算法，通过对同一维度在不同簇上赋予不同的权重值，对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取，有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题，同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析，确定了各类组合观测量的适用范围，并结合实测数据，利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算，结果验证了该方法的可行性。     

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     

A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008