Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements

作者：

Highlights：

• An incomplete hub location problem with service time requirements is addressed.

• Assuming that travel time is uncertain, a robust optimization problem is proposed.

• Two effective specialized Benders decomposition frameworks are devised.

• The robust model renders good assurance of not violating time requirements.

摘要

•An incomplete hub location problem with service time requirements is addressed.•Assuming that travel time is uncertain, a robust optimization problem is proposed.•Two effective specialized Benders decomposition frameworks are devised.•The robust model renders good assurance of not violating time requirements.

论文关键词：Hub location problem with service requirements,Robust optimization,Travel time uncertainty,Benders decomposition

论文评审过程：Received 25 May 2017, Revised 2 October 2017, Accepted 3 October 2017, Available online 6 October 2017, Version of Record 12 October 2017.

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