Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

舰船腐蚀电场建模及补偿最优解验证

基于等效偶极子法,从补偿偶极子长度、角度、大小三方面给出了任意角度的补偿偶极子场解析式,再利用电荷矢量叠加原理,建立了"腐蚀偶极子+补偿偶极子"电场模型。仿真以单轴桨船为例,先验证"腐蚀偶极子+补偿偶极子"电场模型的正确性,再进行补偿偶极子对舰船电场的影响验证,从而得出补偿最优解。模拟实验结果表明,补偿阳极在工程允许条件下距离补偿系统接船端最远处,且补偿系统平行于水平面和船体时补偿效果最优;在补偿最优条件下,理论上是可以抵消原舰船腐蚀电场的。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于特征提取的三维流线分布算法

特征提取与清晰表达是三维流场可视化研究中的两个主要问题.提出了一种基于特征提取的三维流线分布算法,既保障了流场临界点附近的特征结构得以正确描述,同时又使输出结果具有良好的清晰性.该算法分为三个步骤:首先,在临界点的快速检测基础上,根据临界点处Jacobian矩阵特征值对临界点进行分类,并对临界点与种子点模板进行匹配;其次,种子点依照优先规则排序,并从这些种子点出发在物理空间计算出流线;最后,在图像空间由预先设置的阈值对流线进行间距控制,并根据深度检测来保留离视点最近的流线,使得屏幕上的输出结果清晰.     

基于灰色决策原理的导弹核武器最佳配置模型

核武器是国家军事战略的基石,其配置的合理性直接影响核力量作战运用的成效.分析了影响导弹核武器配置的因素,将导弹核武器划分为平时和战时两种状态,构建了导弹核武器最佳配置的灰色规划模型计算结果验证了模型的正确性.研究表明:基于灰色规划原理构建的最佳配置模型在解的稳定性、模型的适应性上要优于同类线性规划模型.核武器最佳配置问题一直是核作战运用研究的重要内容.研究成果可为导弹武器的订购、存贮、阵地配置及作战运用提供理论决策依据.     

被动传感器融合检测系统的优化分布密度

被动传感器由于采用无源探测,而且制造成本低,体积小,在战场环境中将采用并配置大量的被动传感器来检测目标.不论是主动还是被动式传感器,在实际应用中均存在资源优化配置问题.针对被动传感器的具体应用模型,采取了若干合理近似,得到了在"OR"融合检测条件下,基于最大检测概率的被动传感器优化配置密度计算公式.     

基于SEA方法的传感器与武器系统匹配分析

分析系统的匹配程度,是对作战系统进行评价的重要内容,提出将系统的作战效能作为衡量系统匹配程度的重要指标,在SEA(System Effectiveness Analysis)方法的框架下建立了系统匹配分析模型,采用蒙特卡罗方法对匹配过程进行了仿真计算,并通过具体算例验证了模型的正确性,为作战系统的匹配分析提供了一种新的思路.     

基于能量分级和位置预测的高效路由算法

针对车载传感器网络节点移动速度快、网络拓扑结构不稳定、终端传感器节点能量不确定性等特点,提出了一种能量分级和位置预测的高效路由算法ERLP(Energy Rank and Location Prediction based routing)。该算法根据具有不同能量等级的节点将消息传递距离的不同选择那些能量高的节点作为中转节点,并结合节点的分布区域和当前速度,尽量将多个消息副本传递给覆盖不同方向的节点,避免消息传递的局部性。仿真结果表明,与当前典型延迟容忍网络的路由算法相比,ERLP算法在传输成功率、平均延迟时间上具有较大提升。     

基于改进协方差控制的传感器管理算法

针对传统的基于协方差控制的传感器管理算法使用全遍历方法所造成的计算量大,以及传感器切换频繁的问题,提出了一种基于改进协方差控制的传感器管理算法。该算法在每一时刻首先判断前一时刻所用传感器组是否能够满足目标跟踪需求,以滤波协方差与期望协方差的偏差作为参考,结合量纲变换和特征值求取,为协方差偏差矩阵经过量纲变换后得到的量纲一致阵的所有特征值设定一个精度阈值,然后判断滤波协方差是否满足期望,从而决定是否维持当前选择的传感器组。在目标作匀速、匀加速、协同转弯等多种场景下进行了算法性能测试分析,仿真结果表明,该算法不仅在大部分场景下满足目标跟踪精度,而且能够提高传感器管理算法的实时性,同时降低传感器的切换频率。