Metraipolis › archive › dc_dac11b17bdcf

Dimensional Decomposition and Column Generation for Bin Dimensioning in E-Commerce Fulfillment Centers — arXiv:2609.16272

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.16272
License (as archived)
CC0-1.0
Archived
2026-10-15T20:43:21.466Z
SHA-256 of the archived text
00ea031f70a91023808917854bcc0e376d4d21443ef39cea9eae4e0ec50f35d5
Stable URL of this page
https://metraipolis.com/documento/dc_dac11b17bdcf

How to cite

Dimensional Decomposition and Column Generation for Bin Dimensioning in E-Commerce Fulfillment Centers — arXiv:2609.16272 — arXiv (en), https://arxiv.org/abs/2609.16272 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dac11b17bdcf (Metraipolis archive dc_dac11b17bdcf, sha256 00ea031f70a91023808917854bcc0e376d4d21443ef39cea9eae4e0ec50f35d5)
BibTeX
@misc{dcdac11b17bdcf,
  title = {Dimensional Decomposition and Column Generation for Bin Dimensioning in E-Commerce Fulfillment Centers — arXiv:2609.16272},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.16272},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dac11b17bdcf; sha256 00ea031f70a91023808917854bcc0e376d4d21443ef39cea9eae4e0ec50f35d5},
  year = {2026}
}

Archived text

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

A fulfillment center (FC) is a specialized logistics facility where e-commerce inventory is received, stored, and processed. Its internal organization directly impacts space utilization and the performance of put-away and picking operations. Items are stored in bins following strict operational guidelines to ensure productivity in both activities, so bin dimensions must be tailored to the product profile of each facility to maximize space utilization. % We address the bin dimensioning problem arising in e-commerce fulfillment centers: given a set of candidate bin types and a large, heterogeneous inventory, determine the number of bins of each type and assign all items so as to minimize total bin volume, subject to operational constraints governing how products may be combined within a single bin. We develop a dimensional decomposition that exploits these constraints to reduce the three-dimensional packing problem to a one-dimensional block-positioning problem. Building on this decomposition, we formulate the problem as a mixed-integer linear program and propose two solution methods: a Best-Fit-Decreasing (BFD) heuristic and a column generation scheme that produces tight LP lower bounds. Computational experiments on four synthetic datasets, calibrated on proprietary data from an American e-commerce fintech and ranging from 1.5 thousand to 1.5 million SKUs, show that the BFD heuristic scales to instances with up to 1.7 million blocks, and that column generation certifies a BFD--LP gap of 2.26\% on the smallest dataset. The experiments further reveal a structural divide in solution quality across datasets, driven by the interaction between operational constraints and each facility's product profile.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-16 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.16272 — 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-15T19:36:35.839Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).