The Solution of Distance Constrained Mini-Sum Location Problems

C. D. T. Watson-Gandy
Additional contact information
C. D. T. Watson-Gandy: Imperial College, London, England

Operations Research, 1985, vol. 33, issue 4, 784-802

Abstract: The problem considered in this paper requires determining the location of a given number of centers or facilities to minimize the sum of weighted distances to customers being served, subject to the constraint that no customer receives inadequate service. The method proposed is a partial enumerative procedure that employs both a graph-coloring algorithm (to generate feasible partitions) and an iterative location procedure with feasibility tests (to determine optimal locations). The procedure ensures the global optimum to this otherwise non-convex location-allocation problem. The procedure has been programmed and computational results are presented.

Keywords: 185 distance constrained mini-sum location; 633 mini-sum location (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.4.784 (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:oropre:v:33:y:1985:i:4:p:784-802

Access Statistics for this article

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