Advanced Search
MyIDEAS: Login

A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem

Contents:

Author Info

  • Christopher J. Picone

    (Mare Island Naval Shipyard)

  • Wilbert E. Wilhelm

    (Department of Industrial & Systems Engineering, Ohio State University, Columbus, Ohio 43210)

Registered author(s):

    Abstract

    This paper describes a new heuristic, the Revised Hillier procedure, for solving the facilities layout problem. It incorporates the effective features of the well-known Hillier procedure in combination with 3-way and 4-way exchanges to extend the neighborhood over which the search for a solution is conducted. Performance of the new heuristic is compared with that of CRAFT and the original Hillier procedure using a set of "standard" test problems; the Revised Hillier procedure yields solutions of higher quality while requiring only modest increases in computer run time.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.30.10.1238
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 30 (1984)
    Issue (Month): 10 (October)
    Pages: 1238-1249

    as in new window
    Handle: RePEc:inm:ormnsc:v:30:y:1984:i:10:p:1238-1249

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: facilities/equipment planning: layout; programming: heuristic; programming: quadratic;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    2. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.
    3. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:10:p:1238-1249. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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