Obnoxious Facility Location Problem with Forbidden Regions

Shigehiro Osumi ； Hiroaki Ishii

《Asia Pacific Management Review》 10卷4期 (2005/08) Pp. 255-258

https://doi.org/10.6126/APMR.2005.10.4.04

並列摘要

In this paper, we consider an optimal location problem for an obnoxious facility such as disposal center. We formulate this problem as a single facility minimax location problem on the plane under the presence of forbidden regions where the facility is not permitted. The solution for a minimax location problem without forbidden regions is known to be a center of minimum covering circle, but we must consider the case where the solution is not feasible. First we seek the optimal feasible solution with Euclidean distance, secondary we consider it with rectilinear distance. In order to solve these problems, we derive some useful properties and fully utilizing them, we propose efficient algorithms to find the optimal location.

並列關鍵字

Location problem ； Obnoxious facility ； Non-linear optimization

參考文獻

Okabe, A.,Boots, B.,Sugihara, K.,Chiu, S.N.(2000).Spatial Tessellations-Concepts and Applications of Voronoi Diagrams.

Preparata, F.P.,Shamos, M.I.(1985).Springer-Verlag GmbH & Co. KG.

Shamos, M.I.,Hoey, D.(1975).Proc. 16th IEEE Annual Symposium on Foundation of Computer Science.

Elzinga, J. Hearn, D.W.(1972).Geometric Solutions for Some Minimax Location Problems.Transportation Science.6,379-394.

Hearn, D.W.,Vijay, J.(1982).Efficient Algorithms for the (Weighted) Minimum Circle Problem.Operation. Research.30,777-795.