IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v20y1973i4p699-724.html
   My bibliography  Save this article

An n‐step, 2‐variable search algorithm for the component placement problem

Author

Listed:
  • Charles H. Heider

Abstract

The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer‐aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question‐ how close to optimal are the near optimal solutions‐ is examined.

Suggested Citation

  • Charles H. Heider, 1973. "An n‐step, 2‐variable search algorithm for the component placement problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(4), pages 699-724, December.
    • Handle: RePEc:wly:navlog:v:20:y:1973:i:4:p:699-724
    DOI: 10.1002/nav.3800200409
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800200409
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800200409?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:wly:navlog:v:20:y:1973:i:4:p:699-724. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.