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

• URL: http://arxiv.org/abs/2202.10695v1
• Date: Tue, 22 Feb 2022 06:52:34 GMT
• Title: A Framework for Multi-stage Bonus Allocation in meal delivery Platform
• Authors: Zhuolin Wu, Li Wang, Fangsheng Huang, Linjun Zhou, Yu Song, Chengpeng Ye, Pengyu Nie, Hao Ren, Jinghua Hao, Renqing He, Zhizhao Sun
• Abstract summary: We propose a framework to deal with the multi-stage bonus allocation problem for a meal delivery platform. The proposed framework consists of a semi-black-box acceptance probability model, a Lagrangian dual-based dynamic programming algorithm, and an online allocation algorithm. Our results show that using the proposed framework, the total order cancellations can be decreased by more than 25% in reality.
• Score: 14.64089765133449
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling [12.160403526724476]
  We propose a novel End-to-End Cost-Effective Incentive Recommendation (E3IR) model under budget constraints. Specifically, our methods consist of two modules, i.e., the uplift prediction module and the differentiable allocation module. Our E3IR improves allocation performance compared to existing two-stage approaches.
  arXiv  Detail & Related papers  (2024-08-21T13:48:00Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation [51.687404103375506]
  We partner with a non-profit organization in the state of Indiana that leads emphFood Drop, a program that is designed to redirect rejected truckloads of food away from landfills and into food banks. Our goal in this partnership is to completely automate Food Drop. In doing so, we need a matching algorithm for making real-time decisions that strikes a balance between ensuring fairness for the food banks that receive the food and optimizing efficiency for the truck drivers.
  arXiv  Detail & Related papers  (2024-06-10T15:22:41Z)
• Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Processes [0.0]
  This paper presents the Cloud Kitchen platform as a decision-making tool for restaurants with food delivery. The platform contains a Technology-Specific Bridge (TSB) that provides an interface for communicating with restaurants or a simulator. We show that decisions made by our platform can improve customer satisfaction by reducing the number of delayed deliveries using a real-world historical dataset.
  arXiv  Detail & Related papers  (2024-02-16T14:31:33Z)
• Multi-Agent Learning of Efficient Fulfilment and Routing Strategies in E-Commerce [11.421159751635667]
  paper presents an integrated algorithmic framework for minimising product delivery costs in e-commerce. One of the major challenges in e-commerce is the large volume of-temporally diverse orders from multiple customers. We propose an approach that combines graph neural networks and reinforcement learning to train the node selection and vehicle agents.
  arXiv  Detail & Related papers  (2023-11-20T10:32:28Z)
• DeliverAI: Reinforcement Learning Based Distributed Path-Sharing Network for Food Deliveries [1.474723404975345]
  Existing food delivery methods are sub-optimal because each delivery is individually optimized to go directly from the producer to the consumer via the shortest time path. We propose DeliverAI - a reinforcement learning-based path-sharing algorithm. Our results show that DeliverAI can reduce the delivery fleet size by 12%, the distance traveled by 13%, and achieve 50% higher fleet utilization compared to the baselines.
  arXiv  Detail & Related papers  (2023-11-03T16:23:22Z)
• Learning Multi-Agent Intention-Aware Communication for Optimal Multi-Order Execution in Finance [96.73189436721465]
  We first present a multi-agent RL (MARL) method for multi-order execution considering practical constraints. We propose a learnable multi-round communication protocol, for the agents communicating the intended actions with each other. Experiments on the data from two real-world markets have illustrated superior performance with significantly better collaboration effectiveness.
  arXiv  Detail & Related papers  (2023-07-06T16:45:40Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Meta-Learning the Search Distribution of Black-Box Random Search Based Adversarial Attacks [62.769451246845065]
  Aversarial attacks based on randomized search schemes have obtained state-of-the-art results in black-box robustness evaluation. We study how this issue can be addressed by adapting the proposal distribution online based on the information obtained during the attack.
  arXiv  Detail & Related papers  (2021-11-02T16:28:08Z)
• Low-Latency Federated Learning over Wireless Channels with Differential Privacy [142.5983499872664]
  In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
  arXiv  Detail & Related papers  (2021-06-20T13:51:18Z)
• The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems [7.433931244705934]
  We consider a data-driven setting in which the reward and resource consumption of each request are generated using an input model unknown to the decision maker. We design general class of algorithms that attain good performance in various input models without knowing which type of input they are facing. Our algorithms operate in the Lagrangian dual space: they maintain a dual multiplier for each resource that is updated using online mirror descent.
  arXiv  Detail & Related papers  (2020-11-18T18:39:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.