当前位置: X-MOL 学术arXiv.cs.OH › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Two-step Heuristic for the Periodic Demand Estimation Problem
arXiv - CS - Other Computer Science Pub Date : 2021-08-18 , DOI: arxiv-2108.08331
Greta Laage, Emma Frejinger, Gilles Savard

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.

中文翻译:

周期性需求估计问题的两步启发式算法

货运公司依靠战术计划以具有成本效益的方式满足需求。对于真实大规模环境中的计算易处理性,此类计划通常通过求解确定性和循环公式来计算。一个重要的输入是周期性需求,即预期在计划范围的每个时期重复的需求。受每个时期需求的时间序列预测与周期性需求之间的差异的推动,Laage 等人。(2021) 最近介绍了周期需求估计 (PDE) 问题,并表明它具有很高的价值。然而,他们对解空间做了很强的假设,以便可以通过枚举来解决问题。在本文中,我们显着扩展了他们的工作。我们提出了一种新的 PDE 公式,它放宽了对解空间的强假设。我们用两步启发式方法解决了这个公式的大实例。第一步通过基于关于需求和供应交互的实例特定信息执行商品聚类来减少可行空间的维度。该公式连同第一步允许通过元启发式或最先进的黑盒优化求解器 NOMAD 在第二步中解决问题。在使用加拿大国家铁路公司的真实数据进行的广泛实证研究中,我们表明我们的方法产生了高质量的解决方案并优于现有的解决方案。该公式连同第一步允许通过元启发式或最先进的黑盒优化求解器 NOMAD 在第二步中解决问题。在使用加拿大国家铁路公司的真实数据进行的广泛实证研究中,我们表明我们的方法产生了高质量的解决方案并优于现有的解决方案。该公式连同第一步允许通过元启发式或最先进的黑盒优化求解器 NOMAD 在第二步中解决问题。在使用加拿大国家铁路公司的真实数据进行的广泛实证研究中,我们表明我们的方法产生了高质量的解决方案并优于现有的解决方案。
更新日期:2021-08-20
down
wechat
bug