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.
| Original language | English |
|---|---|
| Pages (from-to) | 45-71 |
| Number of pages | 27 |
| Journal | Annals of Operations Research |
| Volume | 222 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 31 Oct 2014 |
| Externally published | Yes |
Funding
This research is supported by the Turkish Scientific and Technological Research Council (TÜB˙TAK) Research Grant No: 107M462, and Galatasaray University Scientific Research Projects Grant Nos: 07.402.014, 10.402.001 and 10.402.019. The first author acknowledges the partial support of National Graduate Scholarship Program for PhD Students awarded by TÜB˙TAK.
Keywords
- Branch and bound
- Discrete approximation
- Facility location–allocation
- Transportation