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

Charles H. Heider

Naval Research Logistics Quarterly, 1973, vol. 20, issue 4, 699-724

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.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800200409

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:wly:navlog:v:20:y:1973:i:4:p:699-724

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().