Abstract
We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between \(3+2\sqrt{2}-\epsilon\) and \(3+2\sqrt{2}+\epsilon\) for any given constant ε> 0. Previously known best approximation ratio for the CFLP is 7.88, due to Mahdian and Pál (2003), based on the operations proposed by Pál, Tardos and Wexler (2001). Our upper bound \(3+2\sqrt{2}+\epsilon\) also matches the best known ratio, obtained by Chudak and Williamson (1999), for the CFLP with uniform capacities. In order to obtain the tight bound of our new algorithm, we make interesting use of the notion of exchange graph of Pál et al. and techniques from the area of parallel machine scheduling.
A full version of this paper including all the proofs is available at: www.stanford.edu/~ jiazhang/ZhChYe.ps.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Information Processing Letters 72(5-6), 161–167 (1999)
Ageev, A., Ye, Y., Zhang, J.: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 145–156. Springer, Heidelberg (2003)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 21–29 (2001)
Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of the 40th IEEE Foundations of Computer Science, pp. 378–388 (1999)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642–651 (2001)
Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. Wiley, New York (1990)
Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. on Computing (to appear)
Chudak, F.A., Williamson, D.: Improved approximation algorithms for capacitated facility location problems. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 99–113. Springer, Heidelberg (1999)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. Journal of Algorithms, 228–248 (1999)
Guha, S., Meyerson, A., Munagala, K.: Improved algorithms for fault tolerant facility location. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 636–641 (2001)
Khuller, S., Sussmann, Y.J.: The Capacitated K-Center Problem. SIAM Journal on Discrete Mathematics 13(3), 403–418 (2000)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a Local Search Heuristic for Facility Location Problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1–10 (1998)
Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Management Science 9, 643–666 (1963)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 731–740 (2002)
Mahdian, M., Pál, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409–421. Springer, Heidelberg (2003)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002)
Mahdian, M., Ye, Y., Zhang, J.: A 2-approximation algorithm for the softcapacitated facility location problem. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 129–140. Springer, Heidelberg (2003)
Pál, M., Tardos, É., Wexler, T.: Facility location with hard capacities. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 329–338 (2001)
Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)
Shmoys, D.B., Tardos, É., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 265–274 (1997)
Sviridenko, M.: cited as personal communication in [8] (July 1998)
Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 735–736 (2003)
Zhang, J.: Approximating the two-level facility location problem via a quasigreedy approach. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 801–810 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Chen, B., Ye, Y. (2004). A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive