A comparison of separation routines for benders optimality cuts for two-level facility location problems

作者：

Highlights：

• The two-level uncapacitated facility location problem is computationally studied.

• Single and multiple allocation variants are analyzed.

• Benders cut specialized separation procedures are devised for the problem variants.

• Near Pareto-optimal cuts outperform the other proposed cut separation methods.

• Large scale instances with up to 20,000 client nodes are solved to optimality.

摘要

•The two-level uncapacitated facility location problem is computationally studied.•Single and multiple allocation variants are analyzed.•Benders cut specialized separation procedures are devised for the problem variants.•Near Pareto-optimal cuts outperform the other proposed cut separation methods.•Large scale instances with up to 20,000 client nodes are solved to optimality.

论文关键词：Discrete location,Multi-level facility location,Benders decomposition,Pareto-optimal cuts

论文评审过程：Received 18 October 2018, Revised 21 August 2019, Accepted 4 September 2019, Available online 5 September 2019, Version of Record 12 September 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.112928