A Two-step Heuristic for the Periodic Demand Estimation Problem

by   Greta Laage, et al.

Freight carriers rely on tactical plans to satisfy demand in a cost-effective way. For computational tractability in real large-scale settings, such plans are typically computed by solving deterministic and cyclic formulations. An important input is the periodic demand, i.e., the demand that is expected to repeat in each period of the planning horizon. Motivated by the discrepancy between time series forecasts of demand in each period and the periodic demand, Laage et al. (2021) recently introduced the Periodic Demand Estimation (PDE) problem and showed that it has a high value. However, they made strong assumptions on the solution space so that the problem could be solved by enumeration. In this paper we significantly extend their work. We propose a new PDE formulation that relaxes the strong assumptions on the solution space. We solve large instances of this formulation with a two-step heuristic. The first step reduces the dimension of the feasible space by performing clustering of commodities based on instance-specific information about demand and supply interactions. The formulation along with the first step allow to solve the problem in a second step by either metaheuristics or the state-of-the-art black-box optimization solver NOMAD. In an extensive empirical study using real data from the Canadian National Railway Company, we show that our methodology produces high quality solutions and outperforms existing ones.


Periodic Freight Demand Forecasting for Large-scale Tactical Planning

Crucial to freight carriers is the tactical planning of the service netw...

A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics

We consider an NP-hard selective and periodic inventory routing problem ...

Service Network Design Problem with Capacity-Demand Balancing

This paper addresses developing cost-effective strategies to respond to ...

Faster Recovery of Approximate Periods over Edit Distance

The approximate period recovery problem asks to compute all approximate ...

A Heuristic Method for Solving the Problem of Partitioning Graphs with Supply and Demand

In this paper we present a greedy algorithm for solving the problem of t...

Critical Distribution System

Distribution crises are manifested by a great discrepancy between the de...

Large-scale Ridesharing DARP Instances Based on Real Travel Demand

Accurately predicting the real-life performance of algorithms solving th...

Please sign up or login with your details

Forgot password? Click here to reset