Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons

Tom M. Cavalier and Hanif D. Sherali
Additional contact information
Tom M. Cavalier: The Pennsylvania State University, University Park, Pennsylvania
Hanif D. Sherali: Virginia Polytechnic Institute and State University, Blacksburg, Virginia

Transportation Science, 1986, vol. 20, issue 2, 107-116

Abstract: In this paper we consider location-allocation problems in which the region to be served is a convex polygon having a uniform demand distribution. Both single and multifacility formulations are considered. For the single facility problem, an algorithm which uses an efficient implementation of the Weiszfeld technique is developed and is shown to converge to a global optimal solution. This analysis is extended to the nonconvex multifacility case. However, although global optimality of the fixed point that the algorithm converges to is not guaranteed, a method suggested for finding a good starting solution increases the likelihood of finding an optimal solution. Extensions of the above problems to include discrete demand points and computational experience are also provided.

Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.20.2.107 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:20:y:1986:i:2:p:107-116

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().