Enhanced Parcel Arrival Forecasting for Logistic Hubs: An Ensemble Deep Learning Approach

• URL: http://arxiv.org/abs/2602.03135v1
• Date: Tue, 03 Feb 2026 05:44:31 GMT
• Title: Enhanced Parcel Arrival Forecasting for Logistic Hubs: An Ensemble Deep Learning Approach
• Authors: Xinyue Pan, Yujia Xu, Benoit Montreuil,
• Abstract summary: We propose a novel deep learning-based ensemble framework to forecast upcoming workloads at logistic hubs.<n>This approach not only facilitates the generation of short-term forecasts, but also improves the accuracy of future hub workload predictions.<n>Our findings highlight the significant potential of this method to improve operational efficiency in logistics hubs and advocate for its broader adoption.
• Score: 0.8195942215716886
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid expansion of online shopping has increased the demand for timely parcel delivery, compelling logistics service providers to enhance the efficiency, agility, and predictability of their hub networks. In order to solve the problem, we propose a novel deep learning-based ensemble framework that leverages historical arrival patterns and real-time parcel status updates to forecast upcoming workloads at logistic hubs. This approach not only facilitates the generation of short-term forecasts, but also improves the accuracy of future hub workload predictions for more strategic planning and resource management. Empirical tests of the algorithm, conducted through a case study of a major city's parcel logistics, demonstrate the ensemble method's superiority over both traditional forecasting techniques and standalone deep learning models. Our findings highlight the significant potential of this method to improve operational efficiency in logistics hubs and advocate for its broader adoption.

Related papers

• Streaming Real-Time Trajectory Prediction Using Endpoint-Aware Modeling [54.94692733670454]
  Future trajectories of neighboring traffic agents have a significant influence on the path planning and decision-making of autonomous vehicles.<n>We propose a lightweight yet highly accurate streaming-based trajectory forecasting approach.<n>Our approach significantly reduces inference latency, making it well-suited for real-world deployment.
  arXiv  Detail & Related papers  (2026-03-02T13:44:23Z)
• Uncertainty-Aware Delivery Delay Duration Prediction via Multi-Task Deep Learning [11.2212153491325]
  This paper introduces a multi-task deep learning model for delivery delay duration prediction in the presence of significant imbalanced data.<n>The proposed model is evaluated on a large-scale real-world dataset from an industrial partner.<n> Experimental results show that the proposed method achieves a mean absolute error of 0.67-0.91 days for delayed-shipment predictions.
  arXiv  Detail & Related papers  (2026-02-23T19:01:03Z)
• ACA-Net: Future Graph Learning for Logistical Demand-Supply Forecasting [3.6239659039661873]
  Logistical demand-supply forecasting is essential for the efficiency and quality of on-demand food delivery platforms.<n>Future order distribution information, which reflects the distribution of orders in on-demand food delivery, is crucial for the performance of logistical demand-supply forecasting.<n>This paper proposes an innovativetemporal learning model that utilizes only two graphs (ongoing and global) to learn future order distribution information.
  arXiv  Detail & Related papers  (2025-09-02T06:20:41Z)
• Agentic Predictor: Performance Prediction for Agentic Workflows via Multi-View Encoding [56.565200973244146]
  Agentic Predictor is a lightweight predictor for efficient agentic workflow evaluation.<n>By learning to approximate task success rates, Agentic Predictor enables fast and accurate selection of optimal agentic workflow configurations.
  arXiv  Detail & Related papers  (2025-05-26T09:46:50Z)
• A Short-Term Predict-Then-Cluster Framework for Meal Delivery Services [0.0]
  This study proposes a short-term predict-then-cluster framework for on-demand meal delivery services.<n>We introduce Constrained K-Means Clustering (CKMC) and Contiguity Constrained Hierarchical Clustering with Iterative Constraint Enforcement (CCHC-ICE)<n> Evaluations of European and Taiwanese case studies demonstrate that the proposed methods outperform traditional time series approaches in both accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2025-01-11T15:59:30Z)
• Multi-Step Traffic Prediction for Multi-Period Planning in Optical Networks [4.963536645449425]
  A multi-period planning framework is proposed that exploits multi-step traffic predictions to address service overprovisioning and improve adaptability to traffic changes. An encoder-decoder deep learning model is initially leveraged for multi-step ahead prediction by analyzing real-traffic traces.
  arXiv  Detail & Related papers  (2024-04-12T08:20:01Z)
• Towards a General Framework for Continual Learning with Pre-training [55.88910947643436]
  We present a general framework for continual learning of sequentially arrived tasks with the use of pre-training. We decompose its objective into three hierarchical components, including within-task prediction, task-identity inference, and task-adaptive prediction. We propose an innovative approach to explicitly optimize these components with parameter-efficient fine-tuning (PEFT) techniques and representation statistics.
  arXiv  Detail & Related papers  (2023-10-21T02:03:38Z)
• A Survey on Service Route and Time Prediction in Instant Delivery: Taxonomy, Progress, and Prospects [58.746820564288846]
  Route&Time Prediction (RTP) aims to estimate the future service route as well as the arrival time of a worker. Despite a plethora of algorithms developed to date, there is no systematic, comprehensive survey to guide researchers in this domain. We categorize these methods based on three criteria: (i) type of task, subdivided into only-route prediction, only-time prediction, and joint route&time prediction; (ii) model architecture, which encompasses sequence-based and graph-based models; and (iii) learning paradigm, including Supervised Learning (SL) and Deep Reinforcement
  arXiv  Detail & Related papers  (2023-09-03T14:43:33Z)
• ST-MLP: A Cascaded Spatio-Temporal Linear Framework with Channel-Independence Strategy for Traffic Forecasting [47.74479442786052]
  Current research on Spatio-Temporal Graph Neural Networks (STGNNs) often prioritizes complex designs, leading to computational burdens with only minor enhancements in accuracy. We propose ST-MLP, a concise cascaded temporal-temporal model solely based on Multi-Layer Perceptron (MLP) modules and linear layers. Empirical results demonstrate that ST-MLP outperforms state-of-the-art STGNNs and other models in terms of accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2023-08-14T23:34:59Z)
• 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)
• Deep Reinforcement Learning for Crowdsourced Urban Delivery: System States Characterization, Heuristics-guided Action Choice, and Rule-Interposing Integration [0.8099700053397277]
  This paper investigates the problem of assigning shipping requests to ad hoc couriers in the context of crowdsourced urban delivery. We propose a new deep reinforcement learning (DRL)-based approach to tackling this assignment problem.
  arXiv  Detail & Related papers  (2020-11-29T19:50:34Z)
• 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.