SPORD: A Simulation-Propose-then-OR-Dispose Approach for Supply Chain Planning

• URL: http://arxiv.org/abs/2607.21354v1
• Date: Thu, 23 Jul 2026 14:18:01 GMT
• Title: SPORD: A Simulation-Propose-then-OR-Dispose Approach for Supply Chain Planning
• Abstract summary: Supply chain planning at e-commerce firms has operated as a collection of isolated projects.<n>We propose and implement the Simulation-Propose-then-OR-Dispose method, deployed as JD.com's NetSim platform.
• Score: 5.862021250173885
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects. Each planning task from static network planning to dynamic warehouse assortment planning requires analysts to spend weeks building models from scratch, calibrating and persuading executives to act on outputs they cannot verify. Three barriers drive this: bespoke models proliferate because standardization is difficult (operational fragmentation); once unified, the combinatorial scale of millions of SKUs, thousands of nodes, and intricate routing logic exceeds what solvers can handle within a tight window (computational intractability); and a mathematically optimal solution still fails to be implemented if the executives do not trust it (implementation hurdle). To bridge this gap, we propose and implement the Simulation-Propose-then-OR-Dispose method, deployed as JD.com's NetSim platform. The central insight is decoupling: simulation proposes by generating and evaluating the full set of operationally valid candidate paths-absorbing all idiosyncratic business logic, while an integer program disposes by selecting the globally optimal subset. Computationally, matrix-vectorized CPU/GPU accelerated simulation achieves a 10-100 times speedup over serial methods, and a list scheduling algorithm reduces coupled-order processing from hours to minutes. Operationally, we establish a closed loop via an intelligent diagnosis engine. Since 2025, NetSim has optimized end to-end services for over 20,000 suppliers, the cross-regional fulfillment rate dropped from 6.1% to 4.9%, and the average monthly carbon reduction is approximately 5,745 tCO2e. SPORD moves simulation from monitoring to active planning. The transparent outputs turn skeptical executives into engaged collaborators, and the modular architecture ensures that the next planning requires just configuration, not reconstruction.

Related papers

• LLM-Guided Heuristic Design from Simulation Traces: A Case Study in Dynamic Production and AGV Scheduling [10.289256706393084]
  Simulation-based optimization (SBO) evaluates executable policies under dynamics.<n>Most methods treat the simulator as a black box: aggregate scores rank candidates without revealing why they fail or which policy logic should change.<n>We present an LLM-guided design framework that uses repeated simulation for selection and event-level traces for diagnosis.
  arXiv  Detail & Related papers  (2026-08-10T09:20:56Z)
• Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata [57.27430779838529]
  We present an exact and tractable algorithm for sampling from the constrained mean-field posterior under any constraint expressible as a finite automaton.<n>The approach guarantees constraint satisfaction by construction, supports both greedy and sampling-based decoding, and is compatible with parallel and block-wise decoding.<n> Empirical evaluations on Dream-7B and LLaDA-8 show substantial accuracy gains across various tasks.
  arXiv  Detail & Related papers  (2026-07-08T05:48:57Z)
• Learning Optimization Proxies for Sequential Contextual Stochastic Programs: An Order Fulfillment Application [12.486418828615077]
  Sequential contextual programs model real-time decision systems in which each time commits to an action under uncertainty.<n>Off-the-shelf optimization solvers achieve high decision quality offline but typically run in seconds to minutes per instance.<n>This paper develops a learning-based optimization proxy: a scenario-embedded neural network trained offline on solver-generated labels, paired online with a decoder that enforces feasibility.
  arXiv  Detail & Related papers  (2026-06-24T03:45:52Z)
• Frontier: Towards Comprehensive and Accurate LLM Inference Simulation [15.58999342618182]
  We present Frontier, a discrete-event simulator for modern LLM inference serving.<n>It captures the structure dynamics of modern serving systems by modeling co-location, Prefill-Decode Disaggregation (PDD), and Attention-FFN Disaggregation (AFD)<n>On 16-H800 GPU testbed, Frontier achieves an average error below 4%. Compared with state-of-the-art simulators, it reduces end-to-end latency error from 44.9% to6.4% under co-location and from 52.6% under disaggregation.
  arXiv  Detail & Related papers  (2026-05-20T15:40:18Z)
• Beyond Test-Time Training: Learning to Reason via Hardware-Efficient Optimal Control [86.63490309209378]
  We formulate reasoning as optimal control and introduce the Test-Time Control layer, which performs finite-horizon LQR planning over latent states at inference time.<n>We demonstrate that embedding optimal control as an architectural layer provides an effective and scalable mechanism for reasoning beyond test-time training.
  arXiv  Detail & Related papers  (2026-03-10T05:42:13Z)
• Agentic LLM Planning via Step-Wise PDDL Simulation: An Empirical Characterisation [1.2832858109291982]
  Large language models (LLMs) can serve as viable planners alongside classical symbolic methods.<n>We present PyPDDLEngine, an open-source Planning Domain Definition Language (PDDL) simulation engine.<n>We evaluate four approaches on 102 International Planning Competition (IPC) Blocksworld instances under a uniform 180-second budget.
  arXiv  Detail & Related papers  (2026-03-06T09:16:49Z)
• Para-B&B: Load-Balanced Deterministic Parallelization of Solving MIP [50.917107318582715]
  Mixed-integer programming (MIP) extends linear programming by incorporating both continuous and integer decision variables.<n>This paper presents the first fully open-source implementation of deterministic parallel branch-and-bound for HiGHS, a high-performance MIP solver.<n>Our approach introduces a novel data-parallel architecture ensuring strict determinism by replicating complete solver state across worker threads.
  arXiv  Detail & Related papers  (2026-02-10T14:17:53Z)
• Algorithms for dynamic scheduling in manufacturing, towards digital factories Improving Deadline Feasibility and Responsiveness via Temporal Networks [0.0]
  Traditional deterministic schedules break down when reality deviates from nominal plans.<n>This thesis combines offline constraint-programming with online temporal-network execution to create schedules that remain feasible under worst-case uncertainty.
  arXiv  Detail & Related papers  (2025-10-16T17:28:25Z)
• Optimization-based Learning for Dynamic Load Planning in Trucking Service Networks [14.972807276002465]
  This paper considers the Outbound Load Planning Problem (OLPP) that considers flow and load planning challenges jointly. The paper aims at developing a decision-support tool to inform planners making these decisions at terminals across the network.
  arXiv  Detail & Related papers  (2023-07-08T21:28:20Z)
• A Memetic Algorithm with Reinforcement Learning for Sociotechnical Production Scheduling [0.0]
  This article presents a memetic algorithm with applying deep reinforcement learning (DRL) to flexible job shop scheduling problems (DRC-FJSSP) From research projects in industry, we recognize the need to consider flexible machines, flexible human workers, worker capabilities, setup and processing operations, material arrival times, complex job paths with parallel tasks for bill of material manufacturing, sequence-dependent setup times and (partially) automated tasks in human-machine-collaboration.
  arXiv  Detail & Related papers  (2022-12-21T11:24:32Z)
• Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
  We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
  arXiv  Detail & Related papers  (2021-05-01T10:18:34Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints [52.58352707495122]
  We present a multi-robot allocation algorithm that decouples the key computational challenges of sequential decision-making under uncertainty and multi-agent coordination. We validate our results over a wide range of simulations on two distinct domains: multi-arm conveyor belt pick-and-place and multi-drone delivery dispatch in a city.
  arXiv  Detail & Related papers  (2020-05-27T01:10:41Z)

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.