Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem

AKYÜZ M. H., ÖNCAN T., Altinel I. K.

ANNALS OF OPERATIONS RESEARCH, cilt.279, ss.1-42, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 279
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1007/s10479-018-3026-5
  • Dergi Adı: ANNALS OF OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1-42
  • Galatasaray Üniversitesi Adresli: Evet

Özet

The Multi-commodity Capacitated Multi-facility Weber Problem is concerned with locating I capacitated facilities in the plane in order to satisfy the demands of J customers for K commodities such that the total transportation cost is minimized. This is a multi-commodity extension of the well-known Capacitated Multi-facility Weber Problem and difficult to solve. In this work, we propose two branch-and-bound algorithms for exactly solving this nonconvex optimization problem. One of them considers partitioning of the allocation space while the other one considers partitioning of the location space. We have implemented two lower bounding schemes for both algorithms and tested several branching strategies. The results of an extensive computational study are also included.