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

摘要

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.