Exploring Deep Reinforcement Learning for Task Dispatching in Autonomous On-Demand Services

Author:

Yang Lei1,Yu Xi1,Cao Jiannong2,Liu Xuxun3,Zhou Pan4

Affiliation:

1. School of Software Engineering, South China University of Technology, Guangzhou, Guangdong, China

2. Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong

3. School of Electronic and Information Engineering, South China University of Technology, Guangzhou, Guangdong, China

4. Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, and Huazhong University of Science and Technology, Wuhan, Hubei, China

Abstract

Autonomous on-demand services, such as GOGOX (formerly GoGoVan) in Hong Kong, provide a platform for users to request services and for suppliers to meet such demands. In such a platform, the suppliers have autonomy to accept or reject the demands to be dispatched to him/her, so it is challenging to make an online matching between demands and suppliers. Existing methods use round-based approaches to dispatch demands. In these works, the dispatching decision is based on the predicted response patterns of suppliers to demands in the current round, but they all fail to consider the impact of future demands and suppliers on the current dispatching decision. This could lead to taking a suboptimal dispatching decision from the future perspective. To solve this problem, we propose a novel demand dispatching model using deep reinforcement learning. In this model, we make each demand as an agent. The action of each agent, i.e., the dispatching decision of each demand, is determined by a centralized algorithm in a coordinated way. The model works in the following two steps. (1) It learns the demand’s expected value in each spatiotemporal state using historical transition data. (2) Based on the learned values, it conducts a Many-To-Many dispatching using a combinatorial optimization algorithm by considering both immediate rewards and expected values of demands in the next round. In order to get a higher total reward, the demands with a high expected value (short response time) in the future may be delayed to the next round. On the contrary, the demands with a low expected value (long response time) in the future would be dispatched immediately. Through extensive experiments using real-world datasets, we show that the proposed model outperforms the existing models in terms of Cancellation Rate and Average Response Time.

Funder

National Natural Science Foundation of China

Hong Kong RGC General Research Fund

Guangdong Basic and Applied Basic Research Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference32 articles.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A survey on applications of reinforcement learning in spatial resource allocation;Computational Urban Science;2024-06-07

2. Non-Rejection Aware Online Task Assignment in Spatial Crowdsourcing;IEEE Transactions on Services Computing;2023-11

3. Long-Term Matching Optimization With Federated Neural Temporal Difference Learning in Mobility-on-Demand Systems;IEEE Internet of Things Journal;2023-01-15

4. Demand management for smart transportation: A review;Multimodal Transportation;2022-12

5. Multi-agent reinforcement learning for fleet management: a survey;2nd International Conference on Artificial Intelligence, Automation, and High-Performance Computing (AIAHPC 2022);2022-11-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3