Shmoys, D.B., Tardos, E. and Aardal, K. (1998) Approximation Algorithms for Facility Location Problems (Extended Abstract). Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, 4-6 May 1997, 1-21.

has been cited by the following article:

• TITLE: Facility Location Decisions Based on Driving Distances on Spherical Surface

  AUTHORS: Han Shih

  KEYWORDS: Facility Location, Spherical Surface, Euclidean Distance, Great Circle Distance, Clustering, Heuristic Method

  JOURNAL NAME: American Journal of Operations Research, Vol.5 No.5, September 29, 2015

  ABSTRACT: Facility location problems are concerned with the location of one or more facilities in a way that optimizes a certain objective such as minimizing transportation cost, providing equitable service to customers, capturing the largest market share, etc. Many facility location decisions involving distance objective functions on Spherical Surface have been approached using algorithmic, metaheuristic algorithms, branch-and-bound algorithm, approximation algorithms, simulation, heuristic techniques, and decomposition method. These approaches are most based on Euclidean distance or Great circle distance functions. However, if the location points are widely separated, the difference between driving distance, Euclidean distance and Great circle distance may be significant and this may lead to significant variations in the locations of the corresponding optimal source points. This paper presents a framework and algorithm to use driving distances on spherical surface and explores its use as a facility location decision tool and helps companies assess the optimal locations of facilities.