arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.04056math.DScs.LGmath.COmath.OC
收藏

动态订单履行操作的策略分解框架

A Policy Decomposition Framework for Dynamic Order Fulfillment Operations

Massachusetts Institute of Technology(麻省理工学院);School of Industrial and Intelligent Systems Engineering, Tel Aviv University(特拉维夫大学工业与智能系统工程学院);Otto-von-Guericke Universitat Magdeburg(马格德堡奥托·冯·格里克大学)

Gal Neria, Michal Tzur, Marlin W. Ulmer

AI总结:

介绍动态订单履行问题(DOFP),将其建模为马尔可夫决策过程。提出分解驱动框架DDF-VFA,通过策略级分解将搜索分为交付和准备子问题,经反馈迭代优化,数值示例显示其性能优于基准方法。

摘要:

现代供应链运营环境多样,订单准备和下游交付需协调。引入动态订单履行问题(DOFP)统一此前单独研究的物流挑战,建模为马尔可夫决策过程。提出DDF-VFA框架,通过策略分解优化下游交付策略,数值示例表明其优于其他方法,且能适应更多现实复杂性。

英文摘要:

Modern supply chains span diverse operational environments, ranging from e-commerce distribution networks to customized production-to-order manufacturing lines. Across these settings, operational efficiency depends on coordinating two highly interdependent stages: order preparation and downstream delivery. Although these stages are traditionally managed in isolation, real-world fulfillment systems must satisfy stringent delivery expectations under dynamic stochastic order arrivals. To bridge this gap, we introduce the Dynamic Order Fulfillment Problem (DOFP), a new problem class unifying logistical challenges previously studied separately. We model DOFP as a Markov decision process whose state and decision spaces are partitioned into preparation and delivery sub-spaces, linked by synchronization constraints. While recent approaches attempt to optimize both fulfillment stages simultaneously over myopic rolling horizons, our framework isolates and optimizes the downstream delivery policy, treating preparation strictly as a state-level constraint filter. To solve this, we develop the Decomposition-Driven Framework with Value Function Approximation (DDF-VFA), which utilizes a novel policy-level decomposition. This design partitions the search into a delivery-stage master problem and a preparation-stage compatibility subproblem, iteratively refined via feedback loops. DDF-VFA executes this strategy by combining a large-neighborhood search over partial delivery decisions with a neural-network value function approximation for the cost-to-go. Numerical illustrations on two example variants using real-world datasets show that DDF-VFA consistently outperforms benchmarks that optimize the two stages independently or jointly without decomposition. Finally, the framework naturally scales to accommodate additional real-world complexities such as batched or multi-stage preparation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑