The Optimal Assignment of Facilities to Locations by Branch and Bound

J. W. Gavett and Norman V. Plyter
Additional contact information
J. W. Gavett: The University of Rochester, Rochester, New York
Norman V. Plyter: The University of Rochester, Rochester, New York

Operations Research, 1966, vol. 14, issue 2, 210-232

Abstract: The problem of assigning facilities to locations consists of the following: in the general case there are n fixed locations to which n facilities must be assigned. Each facility may be assigned to one and only one location. There are n ! feasible assignments. The “distance” between any pair of locations is the cost of transporting a unit of material between the locations. The “traffic intensity” is the rate at which units of material are transferred between a given pair of facilities in both directions. An optimal assignment is one in which the sum of the product of distance times traffic intensity for all pairs of facility-location assignments is a minimum. The branch-and-bound technique with modifications is used to give an optimal assignment.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.2.210 (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:14:y:1966:i:2:p:210-232

Access Statistics for this article

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