[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v17y1969i5p812-826.html
   My bibliography  Save this article

One-Dimensional Space Allocation: An Ordering Algorithm

Author

Listed:
  • Donald M. Simmons

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

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.

Suggested Citation

  • Donald M. Simmons, 1969. "One-Dimensional Space Allocation: An Ordering Algorithm," Operations Research, INFORMS, vol. 17(5), pages 812-826, October.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:5:p:812-826
    DOI: 10.1287/opre.17.5.812
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.5.812
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.5.812?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:17:y:1969:i:5:p:812-826. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.