On-Time Delivery in Crowdshipping Systems: An Agent-Based Approach Using Streaming Data

• URL: http://arxiv.org/abs/2401.12108v1
• Date: Mon, 22 Jan 2024 16:45:15 GMT
• Title: On-Time Delivery in Crowdshipping Systems: An Agent-Based Approach Using Streaming Data
• Authors: Jeremias D\"otterl, Ralf Bruns, J\"urgen Dunkel, Sascha Ossowski
• Abstract summary: We present an agent-based approach to on-time parcel delivery with crowds. Our system performs data stream processing on the couriers' smartphone sensor data to predict delivery delays. Our experiments show that through accurate delay predictions and purposeful task transfers many delays can be prevented.
• Score: 0.7865191493201839
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In parcel delivery, the "last mile" from the parcel hub to the customer is costly, especially for time-sensitive delivery tasks that have to be completed within hours after arrival. Recently, crowdshipping has attracted increased attention as a new alternative to traditional delivery modes. In crowdshipping, private citizens ("the crowd") perform short detours in their daily lives to contribute to parcel delivery in exchange for small incentives. However, achieving desirable crowd behavior is challenging as the crowd is highly dynamic and consists of autonomous, self-interested individuals. Leveraging crowdshipping for time-sensitive deliveries remains an open challenge. In this paper, we present an agent-based approach to on-time parcel delivery with crowds. Our system performs data stream processing on the couriers' smartphone sensor data to predict delivery delays. Whenever a delay is predicted, the system attempts to forge an agreement for transferring the parcel from the current deliverer to a more promising courier nearby. Our experiments show that through accurate delay predictions and purposeful task transfers many delays can be prevented that would occur without our approach.

Related papers

• Enhancing Courier Scheduling in Crowdsourced Last-Mile Delivery through Dynamic Shift Extensions: A Deep Reinforcement Learning Approach [0.0]
  This study focuses on the problem of dynamically adjusting the offline schedule through shift extensions for committed couriers. The objective is to maximize platform profit by determining the shift extensions of couriers and the assignments of requests to couriers.
  arXiv  Detail & Related papers  (2024-02-15T14:15:51Z)
• Algorithmic Persuasion Through Simulation [51.23082754429737]
  We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action, such as purchasing a product. The sender is informed about the (binary) state of the world, such as whether the quality of the product is high or low, but only has limited information about the receiver's beliefs and utilities. Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver by querying an oracle that simulates the receiver's behavior.
  arXiv  Detail & Related papers  (2023-11-29T23:01:33Z)
• 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)
• Streaming Motion Forecasting for Autonomous Driving [71.7468645504988]
  We introduce a benchmark that queries future trajectories on streaming data and we refer to it as "streaming forecasting" Our benchmark inherently captures the disappearance and re-appearance of agents, which is a safety-critical problem yet overlooked by snapshot-based benchmarks. We propose a plug-and-play meta-algorithm called "Predictive Streamer" that can adapt any snapshot-based forecaster into a streaming forecaster.
  arXiv  Detail & Related papers  (2023-10-02T17:13:16Z)
• Implicit Occupancy Flow Fields for Perception and Prediction in Self-Driving [68.95178518732965]
  A self-driving vehicle (SDV) must be able to perceive its surroundings and predict the future behavior of other traffic participants. Existing works either perform object detection followed by trajectory of the detected objects, or predict dense occupancy and flow grids for the whole scene. This motivates our unified approach to perception and future prediction that implicitly represents occupancy and flow over time with a single neural network.
  arXiv  Detail & Related papers  (2023-08-02T23:39:24Z)
• Towards Autonomous and Safe Last-mile Deliveries with AI-augmented Self-driving Delivery Robots [4.671260337086703]
  Last-mile delivery (LMD) is notorious for being the most time-consuming and costly stage of the shipping process. This paper introduces a customer-centric and safety-conscious LMD system for small urban communities based on AI-assisted autonomous delivery robots.
  arXiv  Detail & Related papers  (2023-05-28T12:25:40Z)
• Sinkhorn-Flow: Predicting Probability Mass Flow in Dynamical Systems Using Optimal Transport [89.61692654941106]
  We propose a new approach to predicting such mass flow over time using optimal transport. We apply our approach to the task of predicting how communities will evolve over time in social network settings.
  arXiv  Detail & Related papers  (2023-03-14T07:25:44Z)
• ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference [54.17205151960878]
  We introduce a sampling-free approach that is generic and easy to deploy. We produce reliable uncertainty estimates on par with state-of-the-art methods at a significantly lower computational cost.
  arXiv  Detail & Related papers  (2022-11-21T13:23:09Z)
• Dynamic Resource Management for Providing QoS in Drone Delivery Systems [2.578242050187029]
  We study the dynamic UAV assignment problem for a drone delivery system with the goal of providing measurable Quality of Service (QoS) guarantees. We take a deep reinforcement learning approach to obtain a dynamic policy for the re-allocation of the UAVs. We evaluate the performance of our proposed algorithm by considering three broad arrival classes, including Bernoulli, Time-Varying Bernoulli, and Markov-Modulated Bernoulli arrivals.
  arXiv  Detail & Related papers  (2021-03-06T03:11:07Z)
• Learning to Communicate and Correct Pose Errors [75.03747122616605]
  We study the setting proposed in V2VNet, where nearby self-driving vehicles jointly perform object detection and motion forecasting in a cooperative manner. We propose a novel neural reasoning framework that learns to communicate, to estimate potential errors, and to reach a consensus about those errors.
  arXiv  Detail & Related papers  (2020-11-10T18:19:40Z)
• End-to-End Prediction of Parcel Delivery Time with Deep Learning for Smart-City Applications [19.442685015494316]
  We study the use of deep learning for solving a real-world case of last-mile parcel delivery time prediction. We focus on a large-scale parcel dataset provided by Canada Post, covering the Greater Toronto Area. We utilize an origin-destination (OD) formulation, in which routes are not available, but only the start and end delivery points.
  arXiv  Detail & Related papers  (2020-09-23T21:35:25Z)

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.