Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service 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.