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

M. Hakan Akyüz (), Temel Öncan () and İ. Kuban Altınel ()
Additional contact information
M. Hakan Akyüz: Galatasaray University
Temel Öncan: Galatasaray University
İ. Kuban Altınel: Boğaziçi University

Annals of Operations Research, 2019, vol. 279, issue 1, No 1, 42 pages

Abstract: Abstract 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.

Keywords: Facility location–allocation; Branch-and-bound algorithm; Multi-commodity transportation; 90B06; 90B85; 90C26 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-3026-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-018-3026-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-3026-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().