Freelance drivers with a decline choice: Dispatch menus in on-demand mobility services for assortment optimization

被引:1
|
作者
Yang, Yue [1 ]
Umboh, Seeun William [2 ,3 ]
Ramezani, Mohsen [1 ]
机构
[1] Univ Sydney, Sch Civil Engn, Sydney, Australia
[2] Univ Melbourne, Sch Comp & Informat Syst, Melbourne, Australia
[3] ARC Training Ctr Optimisat Technol Integrated Meth, Melbourne, Australia
基金
澳大利亚研究理事会;
关键词
Mobility on-demand; Submodular maximization; Point-to-point transport; Ride-sourcing; Ride-sharing; Crowd-shipping; RIDE; ALGORITHM; SYSTEMS;
D O I
10.1016/j.trb.2024.103082
中图分类号
F [经济];
学科分类号
02 ;
摘要
With the prosperity of sharing economy, more part-time and freelance suppliers (i.e., drivers) join on-demand mobility services. Because of suppliers' autonomy and behavioural heterogeneity, the platform cannot ensure that suppliers will accept a dispatch order. One approach to mitigate this supply uncertainty is to provide suppliers with personalized menus of dispatch recommendations. A key issue then is to determine which dispatch orders (that can be passenger or goods services) should be allocated into the assortment menu of each supplier. This paper probabilistically models the suppliers' order acceptance and choice behaviour, including a decline option. We propose two assortment optimization problems, disjoint and joint menus, to maximize the expected number of matches. We show that the objective function of the disjoint menu assortment problem is monotone non-decreasing submodular. In contrast, the objective function of the joint menu assortment problem is non-monotone and non-submodular. Accordingly, we present a standard greedy (SG) algorithm to solve the disjoint assortment problem, and gamma*-greedy and local search (LS) algorithms for the joint assortment problem. By bundling orders into consolidated routes, this paper extends the proposed menu assortment methods to the context of meal delivery services. A case study is presented based on the real- world demand in the Manhattan road network. The results show that drivers' autonomy to decline the dispatch orders creates substantial coexistence of idle drivers and unmatched orders in the market. The proposed menu assortment methods curb such matching friction. Moreover, the numerical results demonstrate that the proposed algorithms significantly outperform the traditional dispatching policies applied in practice, e.g., one-to-one matching, in terms of platform efficiency, e.g., achieving more matches, customers' experiences, e.g., reducing waiting time, and benefits for drivers, e.g., tapering off the income inequality among drivers.
引用
收藏
页数:33
相关论文
共 15 条
  • [1] Ride matching and vehicle routing for on-demand mobility services
    Lotfi, Sepide
    Abdelghany, Khaled
    JOURNAL OF HEURISTICS, 2022, 28 (03) : 235 - 258
  • [2] Simulation-based design and analysis of on-demand mobility services
    Markov, Iliya
    Guglielmetti, Rafael
    Laumanns, Marco
    Fernandez-Antolin, Anna
    de Souza, Ravin
    TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2021, 149 : 170 - 205
  • [3] Ride matching and vehicle routing for on-demand mobility services
    Sepide Lotfi
    Khaled Abdelghany
    Journal of Heuristics, 2022, 28 : 235 - 258
  • [4] Agent-based simulation testbed for on-demand mobility services
    Certicky, Michal
    Jakob, Michal
    Pibil, Radek
    Moler, Zbynek
    5TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT-2014), THE 4TH INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY INFORMATION TECHNOLOGY (SEIT-2014), 2014, 32 : 808 - 815
  • [5] Simulation Analysis on Benefits of Introducing Meeting Points Into On-Demand Shared Mobility Services
    Nishida, Ryo
    Kanamori, Ryo
    Onishi, Masaki
    Noda, Itsuki
    Hashimoto, Koichi
    IEEE ACCESS, 2022, 10 : 124114 - 124129
  • [6] A Predictive Fleet Management Strategy for On-Demand Mobility Services: A Case Study in Munich
    Wittmann, Michael
    Neuner, Lorenz
    Lienkamp, Markus
    ELECTRONICS, 2020, 9 (06) : 1 - 18
  • [7] Outsourcing service price for crowd-shipping based on on-demand mobility services
    Peng, Shouguo
    Park, Woo-Yong
    Eltoukhy, Abdelrahman E. E.
    Xu, Min
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2024, 183
  • [8] A latent class analysis to understand riders' adoption of on-demand mobility services as a complement to transit
    Wang, Yiyuan
    Shen, Qing
    TRANSPORTATION, 2024, 51 (03) : 1043 - 1061
  • [9] A Triple Bottom Line optimization model for assignment and routing of on-demand home services
    Biswas, Debajyoti
    Alfandari, Laurent
    Archetti, Claudia
    COMPUTERS & OPERATIONS RESEARCH, 2024, 167
  • [10] An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services
    Tuncel, Kerem
    Koutsopoulos, Haris N.
    Ma, Zhenliang
    COMPUTERS & OPERATIONS RESEARCH, 2023, 159