Metraipolis › archive › dc_57c2d35ecd69

Learning-Augmented Optimization for Strategic Two-Echelon Spare Parts Network Design — arXiv:2609.12524

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12524
License (as archived)
CC0-1.0
Archived
2026-10-16T03:16:08.275Z
SHA-256 of the archived text
3ccdcce42131043b4bb9c24648a738941276e2b56c39a4a1a59308ca32f1f6fc
Stable URL of this page
https://metraipolis.com/documento/dc_57c2d35ecd69

How to cite

Learning-Augmented Optimization for Strategic Two-Echelon Spare Parts Network Design — arXiv:2609.12524 — arXiv (en), https://arxiv.org/abs/2609.12524 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57c2d35ecd69 (Metraipolis archive dc_57c2d35ecd69, sha256 3ccdcce42131043b4bb9c24648a738941276e2b56c39a4a1a59308ca32f1f6fc)
BibTeX
@misc{dc57c2d35ecd69,
  title = {Learning-Augmented Optimization for Strategic Two-Echelon Spare Parts Network Design — arXiv:2609.12524},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12524},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57c2d35ecd69; sha256 3ccdcce42131043b4bb9c24648a738941276e2b56c39a4a1a59308ca32f1f6fc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12524. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the strategic design of a two-echelon spare-parts inventory network where evaluating each candidate topology requires an expensive inventory optimization model. The design partitions hundreds of sites into feasible clusters and selects a central replenishment site for each cluster to reduce costs while maintaining service levels. Because the optimizer favors candidates with high predicted savings, it can exploit optimistic surrogate errors. We develop a conservative framework combining a graph neural network ensemble, variable neighborhood search, and set-partitioning recombination. The surrogate is trained on exact cluster evaluations, while a lower quantile of ensemble-predicted savings guides the search to limit optimism. Clusters found during the search are recombined through set partitioning using surrogate-based objective coefficients. The resulting network is evaluated with the exact inventory model, and only this evaluation is used to report performance. In a case study of 246 fulfillment centers in Amazon's North American network, the framework improves combined savings by 30.5% over an optimization baseline based entirely on exact cluster evaluations, while maintaining approximately 99.8% service across six independent replications. Under equal computational budgets, graph-surrogate-guided search achieves higher mean exact savings than a tabular alternative under both scoring schemes. Conservative scoring improves mean savings for both surrogate classes and reduces the share of final-network clusters overestimated by the graph surrogate from 68% to 28%. Predictive and ranking accuracy deteriorate among search-generated candidates with high surrogate scores, indicating that random holdout performance can incompletely characterize surrogate quality during optimization.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-14 in cs.LG).
Categorie arXiv: Optimization and Control (math.OC) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.12524 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T03:05:44.107Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).