Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce
研究电子商务中的流枢纽选址问题，提出结合拉格朗日松弛和Benders分解的优化算法，并利用聚类、学习等技术加速求解，实验表明该方法比基准方法更快获得最优解或更小最优性差距。
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/ .