Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.     

Dynamic pricing and matching in ride-hailing platforms

Ride-hailing platforms such as Uber, Lyft, and DiDi have achieved explosive growth and reshaped urban transportation. The theory and technologies behind these platforms have become one of the most active research topics in the fields of economics, operations research, computer science, and transportation engineering. In particular, advanced matching and dynamic pricing (DP) algorithms—the two key levers in ride-hailing—have received tremendous attention from the research community and are continuously being designed and implemented at industrial scales by ride-hailing platforms. We provide a review of matching and DP techniques in ride-hailing, and show that they are critical for providing an experience with low waiting time for both riders and drivers. Then we link the two levers together by studying a pool-matching mechanism called dynamic waiting (DW) that varies rider waiting and walking before dispatch, which is inspired by a recent carpooling product Express Pool from Uber. We show using data from Uber that by jointly optimizing DP and DW, price variability can be mitigated, while increasing capacity utilization, trip throughput, and welfare. We also highlight several key practical challenges and directions of future research from a practitioner's perspective.     

空间双体系绳系统展开阶段末端星姿态动力学分析

为了研究空间系绳系统展开过程中末端星的姿态运动,采用第二类拉格朗日方程建立系统展开及末端星角运动的数学模型,分析展开阶段末端星的姿态动力学特性。建模时将系绳末端连接的母星与子星视为尺寸不可忽略的刚体,且母星质量远大于子星质量,系绳视为有质量的刚性杆。利用该数学模型可以分析系绳系统的展开过程,研究影响末端星姿态运动的主要因素,包括姿态角初始扰动以及末端星动/静不对称性。仿真结果表明,系绳展开时末端星姿态角初始扰动及动静不对称性可能会导致姿态角失稳,出现系绳缠绕星体的情况。仿真结果可以为展开阶段末端星姿态控制提供参考。     

The dynamic transshipment problem

We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001     

骑自行车的力学技巧分析及合理设计

依据自行车的行驶原理,从力学角度分析骑自行车遇到的如何省力、刹车问题,并对自行车的设计进行了讨论.     

关于算子方程Tx=y扰动分析的一些结果

在Banach空间中给出了一种相容算子方程解的误差估计 ,推广了矩阵扰动分析中的相应结果 .此外 ,利用Hilbert空间中算子M -P广义逆与算子的约化极小模之间的关系 ,给出了一些估计式 ,这些估计式对于分析不相容算子方程Tx =y的极小范数最小二乘解的扰动误差是有用的     

积分方程法计算舰船感应磁场

积分方程法是取得舰船感应磁场的有效方法 ,且简便易行 .以某型舰船为算例 ,介绍了积分方程法在舰船感应磁场计算中的应用 ,给出了剖分方法 .算例结果与工程实际测量结果相吻合 ,可应用于工程实际 .     

EP/PVB半-互穿聚合物网络的动态力学谱

制备了EP/PVB半 互穿聚合物网络 .动态力学谱结果表明 ,适量的PVB对环氧树脂有较好的增韧作用 ,而环氧树脂对PVB的增硬作用不明显 .     

时变线性微分方程的稳定性

研究了二维和三维时变线性微分方程的稳定性 ,给出了利用系数直接判定稳定性的若干结论     

气泡输运方程及其应用

舰船尾流中含有大量的不同直径的气泡 ,尾流的几何特性与产生它的舰船大小、航行速度、海面风速等因素有很大的关系 ,对气泡规律的研究无论在理论还是在应用中都具有重要的意义。介绍了水中气泡分布函数 ,推导了分布函数所满足的输运方程 ,并给出了气泡输运方程的特征解。对影响分布函数的因素作了探讨 ,并利用输运方程对具体问题进行了计算。结果表明 ,运用气泡输运方程可解决气泡的分布、输运问题 ,并可对气泡分布与气泡半径、气泡所处深度的关系作出定量分析