Periodic Freight Demand Forecasting for Large-scale Tactical Planning

• URL: http://arxiv.org/abs/2105.09136v1
• Date: Wed, 19 May 2021 13:55:24 GMT
• Title: Periodic Freight Demand Forecasting for Large-scale Tactical Planning
• Authors: Greta Laage and Emma Frejinger and Gilles Savard
• Abstract summary: We focus on large-scale tactical planning problems that require deterministic models for computational tractability. Problem of estimating periodic demand in this setting has hitherto been overlooked in the literature. Report results in an extensive empirical study of a real large-scale application from the Canadian National Railway Company.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Crucial to freight carriers is the tactical planning of the service network. The aim is to obtain a cyclic plan over a given tactical planning horizon that satisfies predicted demand at a minimum cost. A central input to the planning process is the periodic demand, that is, the demand expected to repeat in every period in the planning horizon. We focus on large-scale tactical planning problems that require deterministic models for computational tractability. The problem of estimating periodic demand in this setting broadly present in practice has hitherto been overlooked in the literature. We address this gap by formally introducing the periodic demand estimation problem and propose a two-step methodology: Based on time series forecasts obtained in the first step, we propose, in the second step, to solve a multilevel mathematical programming formulation whose solution is a periodic demand estimate that minimizes fixed costs, and variable costs incurred by adapting the tactical plan at an operational level. We report results in an extensive empirical study of a real large-scale application from the Canadian National Railway Company. We compare our periodic demand estimates to the approach commonly used in practice which simply consists in using the mean of the time series forecasts. The results clearly show the importance of the periodic demand estimation problem. Indeed, the planning costs exhibit an important variation over different periodic demand estimates, and using an estimate different from the mean forecast can lead to substantial cost reductions. For example, the costs associated with the period demand estimates based on forecasts were comparable to, or even better than those obtained using the mean of actual demand.

Related papers

• One Global Model, Many Behaviors: Stockout-Aware Feature Engineering and Dynamic Scaling for Multi-Horizon Retail Demand Forecasting with a Cost-Aware Ordering Policy (VN2 Winner Report) [0.0]
  This report presents the winning solution for the VN2 Inventory Planning Challenge.<n>It combines a single global multi-horizon forecasting model with a cost-aware ordering policy.<n>Although developed for the VN2 setting, the proposed approach can be extended to real-world applications.
  arXiv  Detail & Related papers  (2026-01-26T19:36:52Z)
• TAT: Temporal-Aligned Transformer for Multi-Horizon Peak Demand Forecasting [51.37167759339485]
  We propose Temporal-Aligned Transformer (TAT), a multi-horizon forecaster leveraging apriori-known context variables for improving predictive performance.<n>Our model consists of an encoder and decoder, both embedded with a novel Temporal Alignment Attention (TAA) designed to learn context-dependent alignment for peak demand forecasting.<n>We demonstrate that TAT brings up to 30% accuracy on peak demand forecasting while maintaining competitive overall performance compared to other state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-07-14T14:51:24Z)
• Cost-Optimal Active AI Model Evaluation [71.2069549142394]
  Development of generative AI systems requires continual evaluation, data acquisition, and annotation.<n>We develop novel, cost-aware methods for actively balancing the use of a cheap, but often inaccurate, weak rater.<n>We derive a family of cost-optimal policies for allocating a given annotation budget between weak and strong raters.
  arXiv  Detail & Related papers  (2025-06-09T17:14:41Z)
• Decision-Focused Learning to Predict Action Costs for Planning [6.729103498871947]
  Decision-Focused Learning (DFL) has been successful in learning to predict the parameters of optimization problems. This paper investigates the challenges of implementing DFL for automated planning in order to learn to predict the action costs.
  arXiv  Detail & Related papers  (2024-08-13T13:14:54Z)
• F-FOMAML: GNN-Enhanced Meta-Learning for Peak Period Demand Forecasting with Proxy Data [65.6499834212641]
  We formulate the demand prediction as a meta-learning problem and develop the Feature-based First-Order Model-Agnostic Meta-Learning (F-FOMAML) algorithm. By considering domain similarities through task-specific metadata, our model improved generalization, where the excess risk decreases as the number of training tasks increases. Compared to existing state-of-the-art models, our method demonstrates a notable improvement in demand prediction accuracy, reducing the Mean Absolute Error by 26.24% on an internal vending machine dataset and by 1.04% on the publicly accessible JD.com dataset.
  arXiv  Detail & Related papers  (2024-06-23T21:28:50Z)
• Learning with Posterior Sampling for Revenue Management under Time-varying Demand [36.22276574805786]
  We discuss the revenue management problem to maximize revenue by pricing items or services. One challenge in this problem is that the demand distribution is unknown and varies over time in real applications such as airline and retail industries.
  arXiv  Detail & Related papers  (2024-05-08T09:28:26Z)
• How Much Data are Enough? Investigating Dataset Requirements for Patch-Based Brain MRI Segmentation Tasks [74.21484375019334]
  Training deep neural networks reliably requires access to large-scale datasets. To mitigate both the time and financial costs associated with model development, a clear understanding of the amount of data required to train a satisfactory model is crucial. This paper proposes a strategic framework for estimating the amount of annotated data required to train patch-based segmentation networks.
  arXiv  Detail & Related papers  (2024-04-04T13:55:06Z)
• Loss Shaping Constraints for Long-Term Time Series Forecasting [79.3533114027664]
  We present a Constrained Learning approach for long-term time series forecasting that respects a user-defined upper bound on the loss at each time-step. We propose a practical Primal-Dual algorithm to tackle it, and aims to demonstrate that it exhibits competitive average performance in time series benchmarks, while shaping the errors across the predicted window.
  arXiv  Detail & Related papers  (2024-02-14T18:20:44Z)
• Learning-assisted Stochastic Capacity Expansion Planning: A Bayesian Optimization Approach [3.124884279860061]
  Large-scale capacity expansion problems (CEPs) are central to costeffective decarbonization of regional energy systems. Here, we propose a learning-assisted approximate solution method to tractably solve two-stage CEPs. We show that our approach yields an estimated cost savings of up to 3.8% in comparison to series aggregation approaches.
  arXiv  Detail & Related papers  (2024-01-19T01:40:58Z)
• A Tale of Sampling and Estimation in Discounted Reinforcement Learning [50.43256303670011]
  We present a minimax lower bound on the discounted mean estimation problem. We show that estimating the mean by directly sampling from the discounted kernel of the Markov process brings compelling statistical properties.
  arXiv  Detail & Related papers  (2023-04-11T09:13:17Z)
• Planning with Dynamically Estimated Action Costs [2.8326418377665346]
  Information about action costs is critical for real-world AI planning applications. Recent approaches use black-box external action cost estimators, often learned from data, that are applied during the planning phase. We suggest a generalization of deterministic planning with action costs that allows selecting between multiple estimators for action cost.
  arXiv  Detail & Related papers  (2022-06-08T21:10:37Z)
• Bayesian Bilinear Neural Network for Predicting the Mid-price Dynamics in Limit-Order Book Markets [84.90242084523565]
  Traditional time-series econometric methods often appear incapable of capturing the true complexity of the multi-level interactions driving the price dynamics. By adopting a state-of-the-art second-order optimization algorithm, we train a Bayesian bilinear neural network with temporal attention. By addressing the use of predictive distributions to analyze errors and uncertainties associated with the estimated parameters and model forecasts, we thoroughly compare our Bayesian model with traditional ML alternatives.
  arXiv  Detail & Related papers  (2022-03-07T18:59:54Z)
• Low-Rank Temporal Attention-Augmented Bilinear Network for financial time-series forecasting [93.73198973454944]
  Deep learning models have led to significant performance improvements in many problems coming from different domains, including prediction problems of financial time-series data. The Temporal Attention-Augmented Bilinear network was recently proposed as an efficient and high-performing model for Limit Order Book time-series forecasting. In this paper, we propose a low-rank tensor approximation of the model to further reduce the number of trainable parameters and increase its speed.
  arXiv  Detail & Related papers  (2021-07-05T10:15:23Z)
• Reframing demand forecasting: a two-fold approach for lumpy and intermittent demand [0.9137554315375922]
  We show that competitive demand forecasts can be obtained through two models: predicting the demand occurrence and estimating the demand size. Our research shows that global classification models are the best choice when predicting demand event occurrence. We tested our approach on real-world data consisting of 516 three-year-long time series corresponding to European automotive original equipment manufacturers' daily demand.
  arXiv  Detail & Related papers  (2021-03-23T17:57:40Z)

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.