Robust intermodal hub location under polyhedral demand uncertainty

In this study, the authors consider the robust uncapacitated multiple allocation p-hub median problem under polyhedral demand uncertainty. The authors model the demand uncertainty in two different ways. The hose model assumes that the only available information is the upper limit on the total flow adjacent at each node, while the hybrid model additionally imposes lower and upper bounds on each pairwise demand. The authors propose linear mixed integer programming formulations using a minmax criteria and devise two Benders decomposition based exact solution algorithms in order to solve large-scale problems. The authors report the results of our computational experiments on the effect of incorporating uncertainty and on the performance of our exact approaches.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01598183
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 15 2016 12:19PM