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算法能够在控制剖面敏感性和随负载变化的流量工程自适应性上达到合理的折衷.     

空间引力波探测无拖曳技术现状与趋势

航天器无拖曳控制是实现引力波空间探测科学平台超静超稳运行的核心关键技术之一。目前,国内外各研究机构对航天器系统的动力学与控制进行了深入研究,并针对不同的探测频段需求提出了不同的探测任务。根据探测任务进行了航天器编队设计与控制的详细介绍和分析,对涉及的无拖曳与姿态控制、高精度惯性传感器与执行机构等原理和理论方法进行了深入的剖析。针对现已开展的空间引力波探测无拖曳航天器在轨飞行的演示验证整体情况进行详述和分析。在此基础上,提出后续开展相关研究中亟待解决的关键问题,指出未来无拖曳航天器系统动力学与控制的研究热点和趋势。     

雷达组网系统责任区抗干扰优化部署

针对有源压制干扰对雷达组网系统的威胁,深入分析了雷达组网系统的抗干扰优化部署问题,建立了雷达组网系统责任区抗干扰优化布站决策模型,并给出了具体的算法和求解分析.仿真结果验证了该方法的有效性,可为雷达组网系统的实际优化部署提供参考.     

空地多目标序贯攻击三维最优航迹实现

单机或多机协同执行对地多目标攻击任务将成为未来空地战争的一种重要形式。制定了合适的分段规划策略,建立了水平面和垂直面的空地多目标序贯攻击最优航迹模型,应用经典的可行方向法对模型求解。根据水平面和垂直面规划的相互关系及规划结果,得到三维最优航迹,为飞行导航提供有效依据。最后通过实例验证了所建模型及方法的有效性。     

基于遗传算法的无线传感器网络路由研究

无线传感器网络路由算法面临着节省能量、延长网络寿命、提高可靠性等方面的挑战。提出了一种基于遗传的无线传感器网络路由算法。对算法中的算子编码、适应度函数设计、编码方式及参数选取进行了细致研究。仿真结果表明,本算法减少了能耗、延长了网络生存时间并提高了网络的可靠性。     

高超声速飞行器俯冲机动最优制导方法

为解决高超声速飞行器俯冲段精确制导与机动突防问题,研究了机动突防最优制导方法。针对零化视线角速率降低突防性能的问题,在俯冲平面及转弯平面内分别设计了正弦形式的视线角参考运动,同时为进一步实现俯冲精确制导,以落速最大为性能指标利用最优控制对其进行跟踪,引入了伪控制量以简化最优制导问题的求解,最后分析了该方法的稳定性及制导性能。以CAV-H为例进行仿真分析,仿真结果表明该方法能够实现机动飞行,且能够高精度地满足终端落角及落点约束,可为高超声速飞行器俯冲段精确制导及机动突防提供参考。     

基于频率优化组合的KBR系统时标误差校正

时标误差是K波段精密测距仪(KBR)的一个重要测距误差源,现有的时标误差校正方法依赖于对星间时标偏差的精确测量。针对目前我国星间时标偏差测量精度不能满足校正需求的问题,提出了基于双频优化组合的时标误差校正方法,推导了优化频率之间应该满足的定量关系。研究了双频优化组合的实现,指出原有的KBR系统无法实现频率优化,在此基础上设计实现了一种改进频率流程的KBR系统,并对新的时标误差校正方法进行了实验验证。实验结果表明,基于双频优化组合的时标误差校正方法和改进的KBR系统有效降低了对星间时标偏差测量精度的要求。     

自适应LMS和相关算法在GMI磁传感器信号检测中的应用

在GMI磁传感器的研制中,微弱磁场信号经常淹没于电路固有噪声中。当非晶丝GMI(GiantMagneto-Impedance)磁传感器的输出信噪比小于0dB时,常规的峰值检波方法无法检出传感器信号。针对此问题,提出了一种新的微弱信号(信噪比小于0dB)检测方法,利用LMS自适应滤波算法提取非晶丝GMI磁传感器输出信号的特征参数,将该特征参数与理想参数进行相关运算,并根据相关值的大小来确定信号大小,从而实现对微弱磁信号的测量。仿真结果表明,采用LMS自适应滤波算法和相关分析相结合的方法,对于传感器输出信噪比等于-10dB的微弱信号,根据相关值与外磁场大小的对应关系,仍然可以确定外磁场大小。