Volume 41, Number 1, January-March 2007
|Page(s)||83 - 93|
|Published online||15 June 2007|
Improved approximation of the general soft-capacitated facility location problem
ESSEC, BP 105 95021 Cergy-Pontoise, France,
also LIPN, CNRS UMR-7030, Université Paris XIII, France;
Accepted: 18 October 2006
The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time approximation scheme based on cost scaling and dynamic programming, achieves a logaritmic approximation ratio of (1 + ε)H(n) for the problem, where n is the number of customers to be served and H is the harmonic series. This improves the previous bound of 2H(n) for this problem.
Mathematics Subject Classification: 90B80 / 90C59 / 90C27
Key words: Facility location / set covering / dynamic programming / FPTAS.
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.