Revenue-maximizing online stable task assignment on taxi-dispatching platforms

Jingwei Lv; Ze Zhao; Shuzhen Yao; Weifeng Lv

doi:10.1007/s11704-021-0363-3

Revenue-maximizing online stable task assignment on taxi-dispatching platforms

Jingwei Lv^*
, Ze Zhao
, Shuzhen Yao
, Weifeng Lv

^*此作品的通讯作者

计算机学院

Beihang University

科研成果: 期刊稿件 › 快报 › 同行评审

1 引用（Scopus）

摘要

We identify a problem about dynamic task assignment, called RMOSM Problem, then introduce the concept Substitutable and design a novel algorithm Equation-Substitutable Online Matching (ESOM). Finally we conduct experiments that verify the efficiency and effectiveness of the proposed approaches.

源语言	英语
文章编号	166208
期刊	Frontiers of Computer Science
卷	16
期	6
DOI	https://doi.org/10.1007/s11704-021-0363-3
出版状态	已出版 - 12月 2022

访问文件

10.1007/s11704-021-0363-3

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{52d0140613da4766a37e7c9fed23fda7,

title = "Revenue-maximizing online stable task assignment on taxi-dispatching platforms",

abstract = "We identify a problem about dynamic task assignment, called RMOSM Problem, then introduce the concept Substitutable and design a novel algorithm Equation-Substitutable Online Matching (ESOM). Finally we conduct experiments that verify the efficiency and effectiveness of the proposed approaches.",

author = "Jingwei Lv and Ze Zhao and Shuzhen Yao and Weifeng Lv",

note = "Publisher Copyright: {\textcopyright} 2022, Higher Education Press.",

year = "2022",

month = dec,

doi = "10.1007/s11704-021-0363-3",

language = "英语",

volume = "16",

journal = "Frontiers of Computer Science",

issn = "2095-2228",

publisher = "Higher Education Press Limited Company",

number = "6",

}

TY - JOUR

T1 - Revenue-maximizing online stable task assignment on taxi-dispatching platforms

AU - Lv, Jingwei

AU - Zhao, Ze

AU - Yao, Shuzhen

AU - Lv, Weifeng

PY - 2022/12

Y1 - 2022/12

N2 - We identify a problem about dynamic task assignment, called RMOSM Problem, then introduce the concept Substitutable and design a novel algorithm Equation-Substitutable Online Matching (ESOM). Finally we conduct experiments that verify the efficiency and effectiveness of the proposed approaches.

AB - We identify a problem about dynamic task assignment, called RMOSM Problem, then introduce the concept Substitutable and design a novel algorithm Equation-Substitutable Online Matching (ESOM). Finally we conduct experiments that verify the efficiency and effectiveness of the proposed approaches.

UR - https://www.scopus.com/pages/publications/85123777591

U2 - 10.1007/s11704-021-0363-3

DO - 10.1007/s11704-021-0363-3

M3 - 快报

AN - SCOPUS:85123777591

SN - 2095-2228

VL - 16

JO - Frontiers of Computer Science

JF - Frontiers of Computer Science

IS - 6

M1 - 166208

ER -