Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
- 191 Downloads
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.
KeywordsFacility location–allocation Branch-and-bound algorithm Multi-commodity transportation
Mathematics Subject Classification90B06 90B85 90C26
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.
- Al-Loughani, L. (1997). Algorithmic approaches for solving the Euclidean distance location-allocation problems. Ph.D. Thesis, Virginia Polytechnic Institute and State University, USA.Google Scholar
- Brimberg, J., Chen, R., & Chen, D. (1998). Accelerating convergence in the Fermat–Weber location problem. Operations Research, 22(4–5), 151–157.Google Scholar
- Brimberg, J., Hansen, P., Mladenović, N., & Salhi, S. (2008). A survey of solution methods for the continuous location–allocation problem. International Journal of Operations Research, 5(1), 1–12.Google Scholar
- Hansen, P., Peeters, D., & Thisse, J. (1981). On the location of an obnoxious facility. Sistemi Urbani, 3, 299–317.Google Scholar
- Korovkin, P. P. (1986). Inequalities. Moskow: Mir Publishers.Google Scholar
- Weiszfeld, E. (1937). Sur le point lequel la somme des distances de n points donné est minimum. Tôhoku Mathematical Journal, 43, 355–386.Google Scholar
- Witzgall, C., & Goldman, A. J. (1964). Optimal location of a central facility: Mathematical models and concepts. US Department of Commerce: National Bureau of Standards.Google Scholar