Optimal design of accelerated life testing plans for periodical replacement with penalty

Accelerated life testing (ALT), enhanced by optimal test plans, has been widely accepted in practice as a quick approach for estimating the reliability of a product. From the estimation result, preventive maintenance schedules can be determined to ensure the performance of the product under its normal operating conditions. By default, maintenance decision‐making is regarded as the last and least rewarding step. However, sometimes the maintenance schedules, such as preventive maintenance intervals, are predetermined due to customer concerns and/or by various mandatory regulations and rules. Under such circumstances, how to accurately estimate the expenditure (e.g., on maintenance or spare parts management) associated with these maintenance requirements becomes an important issue. A viable solution is to incorporate the maintenance requirements into ALT plans. This paper provides an approach for the optimal design of ALT plans oriented by a mandatory periodical replacement schedule subject to a discounted penalty. The objective is to improve the estimation accuracy of the economic impact of this maintenance requirement. A numerical experiment is provided to demonstrate the approach in practical use. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

气动力/推力矢量复合控制空空导弹最佳转弯规律

针对气动力/推力矢量复合控制空空导弹大离轴角发射的快速转弯问题,根据bang-bang控制理论,给出了导弹终端弹道角受限情况下,以最大末速为性能指标的最佳转弯规律.针对空空导弹纯气动力控制和复合控制两种情况,分别进行了初制导弹道的设计和仿真.结果显示,在中空低速发射时,采用后者转弯性能明显高于纯气动力控制导弹,而当初速高于1.2 Ma时,二者转弯性能非常接近.     

空投设备缓冲气囊的优化设计

简述了气囊缓冲的机理及工作过程,建立了气囊缓冲过程的理论分析模型及气囊参数优化数学模型。利用ISIGHT建立气囊优化模型,选择遗传算法对空投设备缓冲气囊的主辅气囊排气孔面积、气囊高度和主辅气囊体积比进行优化。优化后的结果对空投试验具有很好的指导意义,可减少气囊设计试验次数从而降低试验成本。     

弹着时间可控的机动目标多弹协同制导律*

针对机动目标的多导弹齐射攻击,运用最优控制和卡尔曼滤波理论探索机动目标下弹着时间可控制导律问题。设计了一种最优弹着时间可控的制导律,它由指定弹着时间和预计弹着时间的误差作为反馈信号与传统比例制导律结合推导得出,称之为弹着时间可控制导律（Impact-time-control Guidance Law,简称ITCG）,同时利用卡尔曼滤波估计了目标加速度。通过对作战模型情况的仿真,可以看出这种新型的制导律应用于引导多发导弹以指定时间同时攻击目标时的有效性和可行性。     

基于声自导鱼雷发现概率的本艇机动优化指标

针对纯方位被动定位与跟踪,以提高武器打击效能为目的,提出鱼雷武器发现概率最大的本艇机动优化指标。对指标进行寻优,得到本艇最优轨迹,通过对轨迹形状、性质的分析以及与工程机动轨迹进行定位精度、鱼雷武器打击效能的比较,证明了该指标对处于理论研究阶段的本艇机动问题有积极的参考价值。     

布达拉宫古建筑灭火设施优化配置研究

为配合布达拉宫的消防工程改造,优化其建筑灭火设施的配置,针对现阶段布达拉宫建筑灭火设施现状,剖析了其存在的问题和缺陷,介绍了国外文物古建筑消防保护的理念,阐明了古建筑灭火设施优化配置应遵循的原则,通过对各类灭火设施保护宫殿的可行性和适用性分析,提出了布达拉宫古建筑灭火设施优化配置方案。     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal timing of switches between product sales for sports and entertainment tickets

Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

ATIE:一种自适应的可调域间出口选择算法

TIE算法能对域间出口的选择进行调节,但是该算法的参数计算过于复杂,并且出口选择的调节并不能随负载的变化而变化,因此提出了一种自适应的可调域间出口选择算法ATIE,该算法能够满足流量工程和网络健壮性要求,并通过参数T的改变随当前负载的变化而变化.实验表明,ATIE算法能够在控制剖面敏感性和随负载变化的流量工程自适应性上达到合理的折衷.     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010