کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479677 | 1446010 | 2015 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Approximation algorithms for hard capacitated k-facility location problems Approximation algorithms for hard capacitated k-facility location problems](/preview/png/479677.png)
• The first FPTAS for the single-sink capacitated k-facility location problem (CKFL).
• A polynomial time algorithm for the uniform CKFL with a fixed number of clients.
• Approximation algorithms for two variants of CKFL by utilizing the extreme solutions.
• An improved approximation algorithm for CFL with uniform opening costs.
We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a positive integer k. It costs fi to open facility i, and cij for facility i to serve one unit of demand from client j. The objective is to open at most k facilities serving all the demands and satisfying the capacity constraints while minimizing the sum of service and opening costs. In this paper, we give the first fully polynomial time approximation scheme (FPTAS) for the single-sink (single-client) capacitated k-facility location problem. Then, we show that the capacitated k-facility location problem with uniform capacities is solvable in polynomial time if the number of clients is fixed by reducing it to a collection of transportation problems. Third, we analyze the structure of extreme point solutions, and examine the efficiency of this structure in designing approximation algorithms for capacitated k-facility location problems. Finally, we extend our results to obtain an improved approximation algorithm for the capacitated facility location problem with uniform opening costs.
Journal: European Journal of Operational Research - Volume 242, Issue 2, 16 April 2015, Pages 358–368