A globally convergent algorithm for facility location on a sphere

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

In this paper, we study the problem of facility location on a sphere. This is a generalization of the planar Euclidean facility location problem. This problem was first studied by Katz and Cooper and by Drezner and Wesolowsky where Weiszfeld-like algorithms were proposed. However, convergence has never been proved. In this paper, we first prove a hull property of the problem, i.e., every global minimizer is in the spherical convex hull of the existing facilities. We then study the relationship between the spherical facility location problem and a planar Euclidean facility location problem corresponding to each approximate solution to the spherical facility location problem. Optimality conditions for the spherical facility location problem are established in terms of optimality conditions for the corresponding planar Euclidean facility location problem and a gradient algorithm is proposed to solve the spherical facility location problem. We prove that our algorithm always converges to a global minimizer of the spherical facility location problem. Computational results are also given.

Original languageEnglish (US)
Pages (from-to)37-50
Number of pages14
JournalComputers and Mathematics with Applications
Volume27
Issue number6
DOIs
StatePublished - Mar 1994
Externally publishedYes

    Fingerprint

Keywords

  • Global convergence
  • Gradient algorithms
  • Iterative algorithms without line search
  • Open problems
  • Optimality conditions
  • Spherical facility location

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this