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

References

• Agrawal S, Devanur AR (2015) Fast algorithms for online stochastic convex programming. Indyk P, ed. Proc. 26th Annual ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 1405–1424.Google Scholar
• Angrist JD, Caldwell S, Hall JV (2021) Uber vs. taxi: A driver’s eye view. Amer. Econom. J. Appl. Econom. 13(3):272–308.Crossref, Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Baccara M, Lee S, Yariv L (2020) Optimal dynamic matching. Theoretical Econom. 15(3):1221–1278.Crossref, Google Scholar
• Bai J, So KC, Tang CS, Chen X, Wang H (2019) Coordinating supply and demand on an on-demand service platform with impatient customers. Manufacturing Service Oper. Management 21(3):556–570.Link, Google Scholar
• Benjaafar S, Hu M (2020) Operations management in the age of the sharing economy: What is old and what is new? Manufacturing Service Oper. Management 22(1):93–101.Link, Google Scholar
• Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Link, Google Scholar
• Busa-Fekete R, Szörényi B, Weng P, Mannor S (2017) Multi-objective bandits: Optimizing the generalized gini index. Precup D, Teh YW, eds. Proc. Internat. Conf. on Machine Learn. (PMLR), 625–634.Google Scholar
• Castro F, Nazerzadeh H, Yan C (2020) Matching queues with reneging: A product form solution. Queueing Systems 96(3–4):359–385.Crossref, Google Scholar
• Chen MK (2016) Dynamic pricing in a labor market: Surge pricing and flexible work on the Uber platform. Conitzer V, Bergemann D, Chen Y, eds. Proc. 2016 ACM Conf. Economics and Computation (EC ’16) (Association for Computing Machinery, New York), 455.Google Scholar
• Ehrgott M (2005) Multicriteria Optimization, vol. 491 (Springer Science & Business Media, Boston).Google Scholar
• Feng G, Kong G, Wang Z (2021) We are on the way: Analysis of on-demand ride-hailing systems. Manufacturing Service Oper. Management 23(5):1237–1256.Link, Google Scholar
• Gearhart WB (1979) Compromise solutions and estimation of the noninferior set. J. Optim. Theory Appl. 28(1):29–47.Crossref, Google Scholar
• Hu M (2021) From the classics to new tunes: A neoclassical view on sharing economy and innovative marketplaces. Production Oper. Management 30(6):1668–1685.Crossref, Google Scholar
• Hu M, Zhou Y (2022) Dynamic type matching. Manufacturing Service Oper. Management 24(1):125–142.Link, Google Scholar
• Jiang J, Wang S, Zhang J (2023) Achieving high individual service levels without safety stock? Optimal rationing policy of pooled resources. Oper. Res. 71(1):358–377.Link, Google Scholar
• Jiang Z-Z, Kong G, Zhang Y (2021) Making the most of your regret: Workers’ relocation decisions in on-demand platforms. Manufacturing Service Oper. Management 23(3):695–713.Link, Google Scholar
• Johari R, Kamble V, Kanoria Y (2021) Matching while learning. Oper. Res. 69(2):655–681.Link, Google Scholar
• Ke J, Yang H, Li X, Wang H, Ye J (2020) Pricing and equilibrium in on-demand ride-pooling markets. Transportation Res. Part B: Methodological 139:411–431.Crossref, Google Scholar
• Li X, Rong Y, Zhang RP, Zheng H (2021a) Online advertisement allocation in the presence of customer choices. Preprint, submitted March 16, https://dx.doi.org/10.2139/ssrn.3538755.Google Scholar
• Li X, Ke J, Yang H, Wang H, Zhou Y (2021b) A general matching model for on-demand mobility services. Preprint, submitted September 3, https://dx.doi.org/10.2139/ssrn.3915450.Google Scholar
• Liang J, Lyu G, Teo C-P, Gao Z (2023) Online passenger flow control in metro lines. Oper. Res. 71(2):768–775.Link, Google Scholar
• Lyu G, Chou MC, Teo CP, Zheng Z, Zhong Z (2022) Stochastic knapsack revisited: The service level perspective. Oper. Res. 70(2):729–747.Link, Google Scholar
• Lyu G, Cheung WC, Chou MC, Teo CP, Zheng Z, Zhong Y (2019) Capacity allocation in flexible production networks: Theory and applications. Management Sci. 65(11):5091–5109.Link, Google Scholar
• Mahdavi M, Yang T, Jin R (2013) Stochastic convex optimization with multiple objectives. Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems 26 (Curran Associates Inc., Red Hook, NY), 1115–1123.Google Scholar
• Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Structural Multidisciplinary Optim. 26(6):369–395.Crossref, Google Scholar
• Marler RT, Arora JS (2010) The weighted sum method for multi-objective optimization: New insights. Structural Multidisciplinary Optim. 41(6):853–862.Crossref, Google Scholar
• Nesterov Yu (2005) Smooth minimization of non-smooth functions. Math. Programming 103(1):127–152.Crossref, Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Serafini P (2014) Mathematics of Multiobjective Optimization, vol. 289 (Springer, Berlin).Google Scholar
• Steuer RE (1986) Multiple Criteria Optimization (Wiley, New York).Google Scholar
• Sun H, Wang H, Wan Z (2019) Model and analysis of labor supply for ride-sharing platforms in the presence of sample self-selection and endogeneity. Transportation Res. Part B: Methodological 125:76–93.Crossref, Google Scholar
• Uziel G, El-Yaniv R (2017) Multi-objective non-parametric sequential prediction. von Luxburg U, Guyon I, Bengio S, Wallach H, Fergus R, eds. Adv. Neural Inform. Processing Systems 30 (Curran Associates Inc., Red Hook, NY), 3372–3380.Google Scholar
• Wang H (2022) Transportation-enabled urban services: A brief discussion. Multimodal Transportation 1(2):100007.Crossref, Google Scholar
• Wang H, Yang H (2019) Ridesourcing systems: A framework and review. Transportation Res. Part B: Methodological 129:122–155.Crossref, Google Scholar
• Wang X, Agatz N, Erera A (2018) Stable matching for dynamic ride-sharing systems. Transportation Sci. 52(4):850–867.Link, Google Scholar
• White DJ (1984) Multiobjective programming and penalty functions. J. Optim. Theory Appl. 43(4):583–599.Crossref, Google Scholar
• Xu Z, Li Z, Guan Q, Zhang D, Li Q, Nan J, Liu C, et al. (2018) Large-scale order dispatch in on-demand ride-hailing platforms: A learning and planning approach. Proc. 24th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, 905–913.Google Scholar
• Yan C, Zhu H, Korolko N, Woodard D (2020) Dynamic pricing and matching in ride-hailing platforms. Naval Res. Logist. 67(8):705–724.Crossref, Google Scholar
• Yu H, Neely MJ, Wei X (2017) Online convex optimization with stochastic constraints. von Luxburg U, Guyon I, Bengio S, Wallach H, Fergus R, eds. Adv. Neural Inform. Processing Systems 30 (Curran Associates Inc., Red Hook, NY), 1428–1438.Google Scholar
• Yu P-L (1973) A class of solutions for group decision problems. Management Sci. 19(8):936–946.Link, Google Scholar
• Yu P-L (2013) Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions, vol. 30 (Springer Science & Business Media, Boston).Google Scholar
• Zhang L, Hu T, Min Y, Wu G, Zhang J, Feng P, Gong P, et al. (2017) A taxi order dispatch model based on combinatorial optimization. Matwin S, Yu S, Farooq F, eds. Proc. 23rd ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (Association for Computing Machinery, New York), 2151–2159.Google Scholar
• Zhong Y, Zheng Z, Chou MC, Teo CP (2018) Resource pooling and allocation policies to deliver differentiated service. Management Sci. 64(4):1555–1573.Link, Google Scholar
• Zhou Y, Yang H, Ke J, Wang H, Li X (2022) Competition and third-party platform-integration in ride-sourcing markets. Transportation Res. Part B: Methodological 159:76–103.Crossref, Google Scholar
• Zhu Z, Ke J, Wang H (2021) A mean-field Markov decision process model for spatial-temporal subsidies in ride-sourcing markets. Transportation Res. Part B: Methodological 150:540–565.Crossref, Google Scholar