ITSC 2024 Paper Abstract

Close

Paper WeBT11.5

JINGFENG, YANG (Singapore Institute of Manufacturing Technology (SIMTech), Agenc), Zhiqin, Zhang (Singapore Management University), Lau, Hoong Chuin (Singapore Management University)

Learning to Optimize the Dispatch Time Interval for On-Demand Food Delivery Service

Scheduled for presentation during the Regular Session "Intelligent Logistics" (WeBT11), Wednesday, September 25, 2024, 15:50−16:10, Salon 19/20

2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC), September 24- 27, 2024, Edmonton, Canada

This information is tentative and subject to change. Compiled on December 26, 2024

Keywords Intelligent Logistics, Simulation and Modeling, Other Theories, Applications, and Technologies

Abstract

In recent years, the rapid advancement of mobile and wireless communication technologies has enabled real-time connectivity for on-demand delivery platforms, facilitating efficient door-to-door services like online food delivery. This study addresses a practical challenge faced by a food delivery platform, where customer orders must be allocated to drivers responsible for collecting food from designated centers and delivering it to customers within specific time windows. This dynamic pickup and delivery problem emphasizes prompt delivery as the critical objective. Our research focuses on optimizing the dispatch intervals for orders on such platforms. We tackle this by formulating the problem as a Markov decision process (MDP) and introducing a two-stage framework that combines a multi-agent reinforcement learning (RL) approach for order dispatching with a heuristic method for driver routing. The RL algorithm determines the optimal timing for each order's entry into the matching pool, while the routing method integrates orders into drivers' delivery routes. Extensive experiments, using real-world data and a simulator, show our results surpass benchmark methods, enhancing the efficiency of order dispatching in on-demand food delivery services.

 

 

All Content © PaperCept, Inc.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-12-26  13:12:42 PST  Terms of use