Multiobjective Stochastic Optimization: A Case of Real-Time Matching in Ride-Sourcing Markets

• 成果类型: Article
• 署名作者: Lyu, Guodong; Cheung, Wang Chi; Teo, Chung-Piaw; Wang, Hai
• 署名单位: Hong Kong University of Science & Technology; National University of Singapore; National University of Singapore; National University of Singapore; Singapore Management University
• 刊物名称: M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
• ISSN/ISSBN: 1523-4614
• DOI: 10.1287/msom.2020.0247
• 发表日期: 2024
• 关键词: multiobjective optimization; compromise solution; Online algorithms; ride-sourcing

摘要

Problem definition: The job of any marketplace is to facilitate the matching of supply with demand in real time. Success is often measured using various metrics. The challenge is to design matching algorithms to balance the tradeoffs among multiple objectives in a stochastic environment, to arrive at a compromise solution, which minimizes say the lp-norm-based distance function between the attained performance metrics and the target performances. Methodology/results: We observe that the sample average approximation formulation of this multiobjective stochastic optimization problem can be solved by an online algorithm that uses only gradient information from historical (i.e., past) sample information and not on the current state of the system. The online algorithm relies on a set of weight functions, which are updated adaptively over time, based on realtime tracking of the gaps in attained performance and the performance target. This allows us to recast the online algorithm as a randomized algorithm to solve the original stochastic problem. When the predetermined performance targets are attainable, our randomized policy achieves the targets with a near-optimal performance guarantee (measured by regret, or deviation away from the optimal performance). When the targets are not attainable, our policy generates a compromise solution to the multiobjective stochastic optimization problem, even when the efficient frontier for this stochastic optimization problem cannot be explicitly characterized a priori. We implement our model to address a challenge faced by a ride-sourcing platform that matches passengers and drivers in real time. Four performance metrics-platform revenue, driver service score, pick-up distance, and number of matched pairs-are simultaneously considered in the design of ride-matching algorithm, without prespecifying the weight on each performance metric. This mechanism has been extensively tested using synthetic and real data. Managerial implications: We show that, under appropriate conditions, all parties in the ride-sourcing ecosystem, from drivers, passengers, to the platform, can be better off under our compromise matching policy compared with other popular policies currently in use. In particular, the platform can obtain higher revenue and ensure better drivers (with higher service scores) are assigned more orders, and passengers are more likely to be matched to better drivers (albeit with a slight increase in the waiting time) compared with existing policies that focus on pick-up distance minimization. The ability to balance the conflicting goals in multiple objectives in a stochastic operating environment has the potential to contribute to the long-term sustainable growth of ride-sourcing platforms.