A multiexchange local search algorithm for the capacitated facility location problem

• 成果类型: Article
• 署名作者: Zhang, JW; Chen, B; Ye, YY
• 署名单位: New York University; University of Warwick; Stanford University
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.1040.0125
• 发表日期: 2005
• 页码: 389-403
• 关键词: improved approximation algorithms

摘要

We present a multiexchange 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 root 2- epsilon and 3 + 2 root 2- + epsilon for any given constant epsilon > 0. The previously known best approximation ratio for the CFLP is 7.88, as shown by Mahdian and Pal (2003. Universal facility location. Proc. 11th Annual Eur. Sympos. Algorithms (ESA), 409-421), based on the operations proposed by Pal et al. (2001. Facility location with hard capacities. Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (FOCS), 329-338). Our upper bound 3+2 root 2-+epsilon also matches the best-known ratio, obtained by Chudak and Williamson (1999. Improved approximation algorithm for capacitated facility location problems. Proc. 7th Conf Integer Programming Combin. Optim. (IPCO), 99-113), 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 Pal et al. and techniques from the area of parallel machine scheduling.