计算机科学
二部图
GSM演进的增强数据速率
集合(抽象数据类型)
订单(交换)
钥匙(锁)
强迫(数学)
共享单车
图形
最优化问题
数学优化
分布式计算
理论计算机科学
算法
计算机安全
人工智能
运输工程
工程类
地质学
经济
气候学
数学
程序设计语言
财务
作者
Yue Yang,Shyan-Ming Yuan,Dejian Wang,Qi-Sheng Chen,Lei Xu,Hanqian Li,Zhouyu Fu,Xin Li,Hao Zhang
出处
期刊:Knowledge Discovery and Data Mining
日期:2021-08-14
被引量:1
标识
DOI:10.1145/3447548.3467062
摘要
Nowadays, the ubiquity of sharing economy and the booming of ride-sharing services prompt Mobility-on-Demand (MoD) platforms to explore and develop new business modes. Different from forcing full-time drivers to serve the dispatched orders, these modes usually aim to attract part-time drivers to share their vehicles and employ a 'driver-choose-order' pattern by displaying a sequence of orders to drivers as a candidate set. A key issue here is to determine which orders should be displayed to each driver. In this work, we propose a novel framework to tackle this issue, known as the Information Disclosure problem in MoD systems. The problem is solved in two steps combining estimation with optimization: 1) in the estimation step, we investigate the drivers' choice behavior and estimate the probability of choosing an order or ignoring the displayed candidate set. 2) in the optimization step, we transform the problem into determining the optimal edge configuration in a bipartite graph, then we develop a Minimal-Loss Edge Cutting (MLEC) algorithm to solve it. Through extensive experiments on both the simulation and the real-world data from Huolala business, the proposed method remarkably improves users experience and platform efficiency. Based on these promising results, the proposed framework has been successfully deployed in the real-world MoD system in Huolala.
科研通智能强力驱动
Strongly Powered by AbleSci AI