Stochastic hub location problems with Bernoulli demands

Ghaffarinasab N.

COMPUTERS & OPERATIONS RESEARCH, cilt.145, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 145
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1016/j.cor.2022.105851
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, PASCAL, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

This paper introduces the hub location problem with Bernoulli demands (HLPBD). The problem is a variant of capacitated stochastic hub location problems in which demands for transportation service are assumed to be Bernoulli random variables. We address the problem under single and multiple allocation settings, and for each case, a two-stage stochastic programming model is presented. Further, assuming a homogeneous demand probability, a closed-form expression for the recourse function is presented, and deterministic equivalent formulations are developed for the original stochastic problems. To solve large instances, exact solution algorithms based on Benders decomposition and Lagrangian relaxation are proposed. An extensive set of computational experiments on three well-known data sets is conducted to test the efficiency of the proposed models and solution algorithms, and also to evaluate the effect of different input parameters on the optimal solutions.