Exact algorithms for the robust uncapacitated multiple allocation <i>p</i>-hub median problem

Ghaffarinasab N.

OPTIMIZATION LETTERS, cilt.16, sa.6, ss.1745-1772, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 16 Sayı: 6
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1007/s11590-021-01799-w
  • Dergi Adı: OPTIMIZATION LETTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, INSPEC, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.1745-1772
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

This paper addresses the robust uncapacitated multiple allocation p-hub median problem where the demand traffic between origin-destination pairs are subject to uncertainty. The employed robust optimization approach adjusts the level of conservatism by using a parameter called the budget of uncertainty. A mixed-integer programming linear formulation is proposed for the problem and two exact solution procedures based on Benders decomposition are developed to solve large-scale instances of the problem. Extensive computational experiments are conducted to study the effect of incorporating uncertainty into the problem and to evaluate the performance of the proposed mathematical models as well as the solution algorithms.