Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

M. Akyüz (), İ. Altınel () and Temel Öncan ()

Annals of Operations Research, 2014, vol. 222, issue 1, 45-71

Abstract: Given the locations of J customers, their demands and I capacitated facilities, the Capacitated Multi-facility Weber Problem (CMWP) is concerned with locating I facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost which is proportional to the distance between them. We propose two types of branch and bound algorithms for the ℓ r distance CMWP with 1≤r>∞. One of them is an allocation space based branch and bound algorithm for which a new branching variable selection strategy and new lower bounding procedures have been proposed. The other one is new and partitions the location space. Based on extensive computational experiments we can say that the proposed algorithms are promising and perform better than the existing ones. Copyright Springer Science+Business Media, LLC 2014

Keywords: Branch and bound; Discrete approximation; Facility location–allocation; Transportation (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1221-3 (text/html)
Access to full text is restricted to subscribers.

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:222:y:2014:i:1:p:45-71:10.1007/s10479-012-1221-3

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

DOI: 10.1007/s10479-012-1221-3

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 ().