One-Dimensional Space Allocation: An Ordering Algorithm

Donald M. Simmons
Additional contact information
Donald M. Simmons: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1969, vol. 17, issue 5, 812-826

Abstract: The space-allocation problem arises when an architect tries to arrange rooms of fixed area but unspecified shape on a floor plan in such a way as to minimize a given linear combination of the distances between all pairs of rooms. In one dimension, this is the problem of ordering line segments along a simple axis or rooms along one side of a corridor. This paper devises an efficient branch-and-bound algorithm for finding the optimal ordering, and shows that the algorithm can solve one special type of facilities-to-locations assignment problem. Space allocation in two dimensions is also discussed briefly.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.5.812 (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:17:y:1969:i:5:p:812-826

Access Statistics for this article

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