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     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

遗传算法在防空导弹火力优化分配中的应用

介绍了遗传算法的基本原理、算法设计并结合遗传算法主要解决了如何把目标分配给火力单元的问题,编写了相应的程序,并给出了一个基于遗传算法的火力优化分配方案。     

始终处于大气层内飞行的TBM被动段弹道预测

对大气层内飞行的TBM弹道进行预测时,需要根据不同的应用要求,在求解精度允许范围内用近似方法对六自由度运动进行简化,获得简便实用的弹道预测方法。在假设获得TBM被动段弹道初始位置和速度参数的基础上,首先构建简便实用的处于大气层内飞行的TBM被动段抛物线弹道模型;然后将雷达测得的TBM被动段弹道初始位置和速度参数作为初始条件,对弹道方程采用精度较高的龙格-库塔法进行求解,相应得出被动段弹道上各点及落点的位置和速度参数,进一步确定出落点位置的地理位置经纬度。在某地空攻防对抗仿真项目中应用表明,弹道模型及其求解方法可应用于实战或较为逼真的仿真系统中。     

防空武器系统总体效能的灰色层次评价模型

以某型防空导弹为例,首先建立防空武器系统总体效能评价指标,并采用效用函数法进行指标量化。在此基础上,采用AHP法和Dephi法确定权重系数,采用灰色方法计算综合评估值,从而建立一种综合灰色系统理论、AHP法和ADC法三者优点的灰色层次评价模型。最后对该型防空导弹进行仿真分析。结果证明,灰色层次评价法较AHP法和ADC法具有更大的合理性。     

基于EMP环境下的导弹作战防护对策分析

EMP武器以其极强的破坏性在现代战争中展现出了显著的作战效能。为了提高EMP环境下导弹作战防护能力,简单分析了EMP的产生过程,阐述了EMP武器在作战运用中的干扰、软(硬)杀伤的作用机理,研究了EMP环境对导弹及测试设备、指挥系统、计算机系统的影响,提出了导弹作战中对EMP的防护应采取设置法拉第笼、可靠接地、滤波等防护对策。     

一种通信装备系统间干扰评估的新方法

提出了通信装备系统间互扰评估的一种低计算复杂度分析方法。比特差错概率是对数字通信接收机性能进行评估的重要指标,而由比特差错概率(BEP)表征的系统间互扰的情况计算非常复杂,因此需要合理简化。通常假设干扰为加性高斯白噪声,但有些情况下这种假设并不合理。而使用高阶统计量峰度值来估计的方法可以处理调制干扰信号也可以处理脉冲干扰信号,综合了加性高斯白噪声近似和峰度测量以达到对数字通信设备间互扰分析更合理精确。