IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i2p210-232.html
   My bibliography  Save this article

The Optimal Assignment of Facilities to Locations by Branch and Bound

Author

Listed:
  • J. W. Gavett

    (The University of Rochester, Rochester, New York)

  • Norman V. Plyter

    (The University of Rochester, Rochester, New York)

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.

Suggested Citation

  • J. W. Gavett & Norman V. Plyter, 1966. "The Optimal Assignment of Facilities to Locations by Branch and Bound," Operations Research, INFORMS, vol. 14(2), pages 210-232, April.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:2:p:210-232
    DOI: 10.1287/opre.14.2.210
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.2.210
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.2.210?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Chen, Bintong, 1995. "Special cases of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 410-419, March.
    3. A Diponegoro & B R Sarker, 2003. "Machine assignment in a nonlinear multi-product flowline," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 472-489, May.
    4. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    5. D. J. White, 1993. "A parametric‐based heuristic program for the quadratic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 553-568, June.
    6. Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L. & Han, Min-Hong, 1995. "Backtracking of jobs in one-dimensional machine location problems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 593-609, September.
    7. Liming Yao & Zhongwen Xu & Ziqiang Zeng, 2020. "A Soft‐Path Solution to Risk Reduction by Modeling Medical Waste Disposal Center Location‐Allocation Optimization," Risk Analysis, John Wiley & Sons, vol. 40(9), pages 1863-1886, September.
    8. Jerzy Grobelny & Rafal Michalski, 2015. "Comparative analysis of regular grid based algorithms in the design of graphical control panels," WORking papers in Management Science (WORMS) WORMS/15/03, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.

    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:14:y:1966:i:2:p:210-232. 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.