Coordination of pricing and inventory control across products

We consider the joint pricing and inventory‐control problem for a retailer who orders, stocks, and sells two products. Cross‐price effects exist between the two products, which means that the demand of each product depends on the prices of both products. We derive the optimal pricing and inventory‐control policy and show that this policy differs from the base‐stock list‐price policy, which is optimal for the one‐product problem. We find that the retailer can significantly improve profits by managing the two products jointly as opposed to independently, especially when the cross‐price demand elasticity is high. We also find that the retailer can considerably improve profits by using dynamic pricing as opposed to static pricing, especially when the demand is nonstationary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于离散模糊动态贝叶斯网络的空战威胁估计

对空战中目标的各个特征因素进行了分析,建立了空战目标威胁估计的离散模糊动态贝叶斯网络模型,并利用离散动态贝叶斯网络的直接推理算法进行了仿真计算.仿真结果表明,该方法得到的推理结果与理论分析完全一致,而且能够将各种并不显著的特征因素进行综合,使得各个特征因素间及不同时间片的同一特征因素相互修正补充.为空战威胁估计提供了一种有效而准确的方法.     

接收机前端放大链与数字模块接口匹配分析

探讨了雷达数字化接收系统前端放大链与数字A/D模块级联后,接收系统的噪声系数、灵敏度和瞬时动态范围等参数的变化;研究了在工程上接收系统为获得最佳性能,前端放大链与数字A/D模块性能指标的折衷问题,推导了相应的设计公式并给出了实验验证.最后总结了在接收系统前端和A/D性能允许范围内,获得设计师希望得到的接收系统灵敏度和动态范围的方法及设计参考曲线.     

火控系统动态精度环绕测试设计方法

借鉴环绕BIT技术的思想,提出一种火控系统动态精度环绕测试的设计方法.该方法充分利用火控计算机的固有资源,通过增加少量接口转换电路(一组现在点坐标输出接口和一组射击诸元输入接口),来提高火控系统动态精度检查测试性水平.对于采用环绕测试设计的火控系统,只需使用两根外接电缆,无须外接检测计算机,即可完成动态精度检查的任务,从而显著降低了操作复杂性.该设计方法的一个优点是不会影响系统的可靠性.     

舰炮武器系统动态误差检测方法

舰炮武器系统动态误差是系统动态性能的重要指标,精确测量舰炮武器系统动态误差一直是比较困难的问题,提出一种比较先进的动态误差测量方法,可以按给定间隔时间连续测量和录取舰炮不稳定方向瞄准角和高低瞄准角动态误差,监测系统的动态过程.对舰炮武器系统动态检测和调试,提高系统射击精度有较大的现实意义.     

履带车辆动力性仿真研究

为仿真履带车辆动力性,建立了动力性评价指标的仿真模型,并以某型车为实例,应用Matlab语言编程计算得出理论值,通过与试验值比较验证了模型的有效性和准确性。     

考虑落角约束与驾驶仪特性的自适应RBF空间末制导律

为使大口径舰炮制导炮弹在打击近岸机动目标的末制导段满足落角约束,现考虑自动驾驶仪动态特性,基于自适应RBF逼近网络与动态面滑模提出一种空间末制导律。构建空间弹目相对运动模型,通过带改进微分跟踪器的扩张状态观测器估计目标加速度。为零化视线角跟踪误差与视线角速率,采用自适应指数趋近律设计非奇异终端滑模动态面,并运用自适应RBF逼近网络削弱控制指令抖振。通过Lyapunov第二法证明了全系统中视线角跟踪误差与视线角速率均最终一致有界。仿真实验表明：该末制导律使制导炮弹在空间中打击具有不同机动形式的近岸目标时,均具备良好的末制导性能。     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016