A Framework for Multi-stage Bonus Allocation in meal delivery Platform

02/22/2022
by   Zhuolin Wu, et al.
0

Online meal delivery is undergoing explosive growth, as this service is becoming increasingly popular. A meal delivery platform aims to provide excellent and stable services for customers and restaurants. However, in reality, several hundred thousand orders are canceled per day in the Meituan meal delivery platform since they are not accepted by the crowd soucing drivers. The cancellation of the orders is incredibly detrimental to the customer's repurchase rate and the reputation of the Meituan meal delivery platform. To solve this problem, a certain amount of specific funds is provided by Meituan's business managers to encourage the crowdsourcing drivers to accept more orders. To make better use of the funds, in this work, we propose a framework to deal with the multi-stage bonus allocation problem for a meal delivery platform. The objective of this framework is to maximize the number of accepted orders within a limited bonus budget. This framework consists of a semi-black-box acceptance probability model, a Lagrangian dual-based dynamic programming algorithm, and an online allocation algorithm. The semi-black-box acceptance probability model is employed to forecast the relationship between the bonus allocated to order and its acceptance probability, the Lagrangian dual-based dynamic programming algorithm aims to calculate the empirical Lagrangian multiplier for each allocation stage offline based on the historical data set, and the online allocation algorithm uses the results attained in the offline part to calculate a proper delivery bonus for each order. To verify the effectiveness and efficiency of our framework, both offline experiments on a real-world data set and online A/B tests on the Meituan meal delivery platform are conducted. Our results show that using the proposed framework, the total order cancellations can be decreased by more than 25% in reality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2018

Online Variant of Parcel Allocation in Last-mile Delivery

We investigate the problem of last-mile delivery, where a large pool of ...
research
02/04/2019

A Unified Framework for Marketing Budget Allocation

While marketing budget allocation has been studied for decades in tradit...
research
08/23/2020

Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection

Online electronic coupon (e-coupon) is becoming a primary tool for e-com...
research
07/27/2021

Multiperiod Dispatching and Routing for On-Time Delivery in a Dynamic and Stochastic Environment

On-demand delivery has become increasingly popular around the world. Bri...
research
03/22/2022

A Decentralised Multi-Agent Reinforcement Learning Approach for the Same-Day Delivery Problem

Same-Day Delivery services are becoming increasingly popular in recent y...
research
01/05/2023

Playing hide and seek: tackling in-store picking operations while improving customer experience

The evolution of the retail business presents new challenges and raises ...
research
01/25/2022

Probability estimation and structured output prediction for learning preferences in last mile delivery

We study the problem of learning the preferences of drivers and planners...

Please sign up or login with your details

Forgot password? Click here to reset