Facility location problem

From Wikipedia, the free encyclopedia
  (Redirected from Facility location)
Jump to: navigation, search

The facility location problem, also known as location analysis or k center problem, is a branch of operations research and computational geometry concerned with the optimal placement of facilities to minimize transportation costs while considering factors like avoiding placing hazardous materials near housing and competitors' facilities. The techniques also apply to cluster analysis.

Minisum facility location[edit]

A simple facility location problem is the Weber problem, in which a single facility is to be placed, with the only optimization criterion being the minimization of the weighted sum of distances from a given set of point sites. More complex problems considered in this discipline include the placement of multiple facilities, constraints on the locations of facilities, and more complex optimization criteria.

In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities.

The facility location problem on general graphs is NP-hard to solve optimally, by reduction from (for example) the set cover problem. A number of approximation algorithms have been developed for the facility location problem and many of its variants.

Without assumptions on the set of distances between clients and sites (in particular, without assuming that the distances satisfy the triangle inequality), the problem is known as non-metric facility location and can be approximated to within a factor O(log(n)).[1] This factor is tight, via an approximation-preserving reduction from the set cover problem.

If we assume distances between clients and sites are undirected and satisfy the triangle inequality, we are talking about a Metric Facility Location problem (MFL). The MFL is still NP-hard and hard to approximate within factor better than 1.46. The currently best known approximation algorithm achieves approximation ratio of 1.488.[2]

Minimax facility location[edit]

The minimax facility location problem seeks a location which minimizes the maximum distance to the sites, where the distance from one point to the sites is the distance from the point to its nearest site. A formal definition is as follows: Given a point set P ⊂ ℝd, find a point set S ⊂ ℝd, |S|=k, so that maxpP(minqS(d(p,q)) ) is minimized.

In the case of the Euclidean metric for k=1, it is known as the smallest enclosing sphere problem or 1-center problem. Its study traced at least to the year of 1860. see smallest enclosing circle and bounding sphere for more details.

NP Hardness[edit]

It's proved that exact solution of k center problem is NP hard.[3] [4] [5] Approximation to the problem was found to be also NP hard when the error is small. The error level in Approximation algorithm is measured as approximation factor, which is defined as the ratio between the approximation and the optimum. It's proved that the k center problem approximation is NP hard when approximation factor is less than 1.822 (dimension = 2)[6] or 2 (dimension >2).[5]

Algorithms[edit]

Exact solver

There exist algorithms to produce exact solutions to this problem. One exact solver runs in time O(n^{\sqrt{k}}) [7] .[8]

1 + ε Approximation

1+ε approximation is to find an solution with approximation factor no greater than 1+ε. This approximation is NP hard as ε is arbitrary. One approach based on core-set concept is proposed with execution complexity of O(2^{O(\frac{k \log{k}}{\epsilon^{2}}))}dn)[9] . As an alternative, another algorithm also based on core-set is available. It runs in O(k^n)>.[10] The author claims that the running time is much less than the worst case and thus it's possible to solve some problems when k is small (say k<5).

Farthest Point Clustering

For the hardness of the problem, it's impractical to get an exact solution or precise approximation. Instead, an approximation with factor=2 is widely used for large k cases. The approximation is referred the Farthest Point Clustering (FPC) algorithm.[5] The algorithm is quite simple: pick any point from the set as one center; search for the farthest point from remaining set as another center; repeat the process until k centers are found.

It's easy to see that this algorithm runs in linear time. As approximation with factor less than 2 is proved to be NP hard, FPC was regarded as the best approximation one can find.

As per the performance of execution, the time complexity is later improved to O(n \log{k}) with box decomposition technique.[6]

Maxmin facility location[edit]

The maxmin facility location or obnoxious facility location problem seeks a location which maximizes the minimum distance to the sites. In the case of the Euclidean metric, it is known as the largest empty sphere problem. The planar case (largest empty circle problem) may be solved in optimal time \Theta(n\, \log\, n)\,. [11][12]

See also[edit]

References[edit]

  1. ^ Hochbaum, D. S. (1982). "Heuristics for the fixed cost median problem". Mathematical Programming 22: 148–162. doi:10.1007/BF01581035.  edit
  2. ^ Li, S. (2011). "A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem". Automata, Languages and Programming. Lecture Notes in Computer Science 6756. pp. 77–88. doi:10.1007/978-3-642-22012-8_5. ISBN 978-3-642-22011-1.  edit
  3. ^ Fowler, R.J.; Paterson, M.S.; Tanimoto, S.L. (1981), "Optimal packing and covering in the plane are NP-complete", Information processing letters 12: 133–137, doi:10.1016/0020-0190(81)90111-3 .
  4. ^ Megiddo, Nimrod; Tamir, Arie (1982), "On the complexity of locating linear facilities in the plane", Operations Research Letters 1 (5): 194–197 .
  5. ^ a b c Gonzalez, Teofilo (1985), "Clustering to minimize the maximum intercluster distance", Theoretical Computer Science 38: 293–306 .
  6. ^ a b Feder, Tomás; Greene, Daniel (1988), "Optimal algorithms for approximate clustering", Proceedings of the twentieth annual ACM symposium on Theory of computing: 434–444 
  7. ^ HWang, R. Z.; Lee, R. C. T.; Chang, R. C. (1993), "The slab dividing approach to solve the Euclidean p-center problem", Algorithmica 9 (1): 1–22 
  8. ^ HWang, R. Z.; Chang, R. C.; Lee, R. C. T. (1993), "The generalized searching over separators strategy to solve some NP-Hard problems in subexponential time", Algorithmica 9 (4): 398–423, doi:10.1007/bf01228511 
  9. ^ Bādoiu, Mihai; Har-Peled, Sariel; Indyk, Piotr (2002), "Approximate clustering via core-sets", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing: 250–257 
  10. ^ Kumar, Pankaj; Kumar, Piyush (2010), "Almost optimal solutions to k-clustering problems", International Journal of Computational Geometry & Applications 20 (04) 
  11. ^ Franco P. Preparata and Michael Ian Shamos (1985). Computational Geometry - An Introduction. Springer-Verlag. 1st edition: ISBN 0-387-96131-3; 2nd printing, corrected and expanded, 1988: ISBN 3-540-96131-3; Russian translation, 1989: ISBN 5-03-001041-6. , p. 256
  12. ^ G. T. Toussaint, "Computing largest empty circles with location constraints," International Journal of Computer and Information Sciences, vol. 12, No. 5, October, 1983, pp. 347-358.

External links[edit]