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.     

单一基窃听方式下B92协议的安全性研究

从概率论和信息论两个角度对单一基窃听方式下B92协议的安全性进行了研究,得出了最佳窃听角度和信源概率分布之间的关系;以马尔柯夫串联信道模型计算了Alice和Eve之间及Alice和Bob之间的信息量,并与广义量子测量窃听进行了比较,结果表明,Eve采用单一基窃听不仅能以较高概率猜中Alice发出的量子态,并且能获得较高平均互信息.得出的结论为合法通信者的安全通信和对窃听者的检测提供了标准.     

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

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

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

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     

基于高斯伪谱法的弹道跟踪制导律

针对拦截临近空间高超声速飞行器的弹道跟踪过程，设计了一种基于高斯伪谱法的跟踪制导律。为了对标称弹道进行精确跟踪，基于线性二次型跟踪问题，应用最优控制理论推导最优解的充要条件，得到带时变增益的线性状态反馈控制量的表达式；基于高斯伪谱法，在离散的勒让德-高斯(LG)点上利用标称弹道数据计算差分矩阵和系数矩阵，求得状态扰动反馈控制律。仿真结果表明，该方法能够快速、有效的消除跟踪误差，满足在线实施要求。     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

Equivalent accelerated life testing plans for log‐location‐scale distributions

Accelerated life testing (ALT) is widely used to determine the failure time distribution of a product and the associated life‐stress relationship in order to predict the product's reliability under normal operating conditions. Many types of stress loadings such as constant‐stress, step‐stress and cyclic‐stress can be utilized when conducting ALT. Extensive research has been conducted on the analysis of ALT data obtained under a specified stress loading. However, the equivalency of ALT experiments involving different stress loadings has not been investigated. In this article, a log‐location‐scale distribution under Type I censoring is considered in planning ALT. An idea is provided for the equivalency of various ALT plans involving different stress loadings. Based on this idea, general equivalent ALT plans and some special types of equivalent ALT plans are explored. For demonstration, a constant‐stress ALT and a ramp‐stress ALT for miniature lamps are presented and their equivalency is investigated. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一种实用的提高景象匹配可靠性的方法

景象匹配导航具有高准确性和高可靠性,因此被应用于诸多领域。从景象匹配适配区的选择出发,提出了一种实用的提高景象匹配可靠性的方法,在匹配前对参考图提取出高概率匹配区,然后再用NPROD算法进行匹配,实验证明该方法能够有效地提高景象匹配的可靠性。     

信号相位匹配法检测正弦信号的高阶统计量方法

为了能对提高高斯色噪声中正弦信号的检测能力,提出了二阶自相关和四阶累积量预处理的信号相位匹配检测法.仿真结果表明,高斯色噪声中四阶累积量预处理的信号相位匹配检测法的检测性能接近于高斯白噪声下匹配滤波器,优于二阶自相关的信号相位匹配检测法的检测性能,更优于的信号相位匹配的最小二乘检测器.