Multiple allocation tree of hubs location problem for non-complete networks

KAYIŞOĞLU B., AKGÜN İ.

Computers and Operations Research, cilt.136, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 136
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1016/j.cor.2021.105478
  • Dergi Adı: Computers and 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
  • Anahtar Kelimeler: Hub location problem, Multiple allocation, Tree of hubs location problem, Benders decomposition, Benders-type heuristic, BENDERS DECOMPOSITION ALGORITHM, MEDIAN PROBLEM, HEURISTIC ALGORITHMS, DESIGN PROBLEM, FORMULATIONS, OPTIMIZATION, MODEL
  • Abdullah Gül Üniversitesi Adresli: Evet

Özet

© 2021 Elsevier LtdWe study the Multiple Allocation Tree of Hubs Location Problem where a tree topology is required among the hubs and transportation cost of sending flows between OD pairs is minimized. Unlike most studies in the literature that assume a complete network with costs satisfying the triangle inequality to formulate the problem, we define the problem on non-complete networks and develop a modeling approach that does not require any specific cost and network structure. The proposed approach may provide more flexibility in modeling several characteristics of real-life hub networks. Moreover, the approach may produce better solutions than the classical approach, which may result from the differences in the selected hubs, the flow routes between origin–destination points, and the assignment of non-hub nodes to hub nodes. We solve the proposed model using CPLEX-based branch-and-bound algorithm and Gurobi-based branch-and-bound algorithm with Norel heuristic and develop Benders decomposition-based heuristic algorithms using two acceleration strategies, namely, strong cut generation and cut disaggregation. We conduct computational experiments using problem instances defined on non-complete networks with up to 500 nodes. The results indicate that the Benders-type heuristics are especially effective in finding good feasible solutions for large instances.