An efficient matheuristic for the robust multiple allocation <i>p</i>-hub median problem under polyhedral demand uncertainty

Ghaffarinasab N.

COMPUTERS & OPERATIONS RESEARCH, cilt.97, ss.31-47, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 97
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1016/j.cor.2018.04.021
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.31-47
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

This paper addresses the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Three variants of polyhedral uncertainty models are used in the problem, namely the hose, the hybrid, and the budget uncertainty models. The problems are formulated as linear mixed integer programming problems and a Tabu Search (TS) based matheuristic approach is proposed to solve the three variants of the problem. Extensive computational experiments are conducted based on three well-known data sets in the hub location literature and the results show the capability of the proposed solution algorithm to obtain the optimal solutions in short computational times. (C) 2018 Elsevier Ltd. All rights reserved.