Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper studies a flow hub location problem (FHLP) stemming from recent trends in network design for e-commerce businesses. Specifically, e-commerce companies are flexible and agile in reoptimizing their logistics networks, including supplier (origin) and customer zone (destination) decisions. Furthermore, a large number of commodities (flows) and a relatively small sales volume for each product incentivize e-commerce retailers to lease warehouse spaces as hubs, yielding a large number of hub location candidates. As such, the proposed FHLP determines the origin and destination of each flow simultaneously with the hub location and flow routing decisions in contrast to the classical hub location problems, where the origins and destinations of all flows are predetermined. To solve this large-scale optimization problem, we propose an optimization algorithm that combines Lagrangian relaxation and Benders decomposition. Novel acceleration techniques, such as a clustering-empowered multicommodity Benders reformulation, learning-empowered elimination tests, and variable reduction techniques, are further developed to improve the performance and convergence of the algorithm. The efficiency of the proposed algorithm is evaluated via extensive computational experiments. The numerical results show that when compared with five other benchmark methods, the proposed algorithm can achieve optimal solutions faster for small-sized test instances and reduce optimality gaps for large-sized ones. For example, the proposed method achieves optimal solutions for a set of 10 test instances, with node sizes ranging from 225 to 450, within 20 minutes on average. In comparison, the automatic Benders decomposition method implemented in the commercial CPLEX solver achieves an average optimality gap of 2% within one hour. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms & Applications. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0367 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0367 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it