论文信息 - Computerized Layout Design: A Branch and Bound Approach

Computerized Layout Design: A Branch and Bound Approach

Abstract This paper presents a computerized procedure for layout design. The layout problem is formulated as a quadratic set covering problem. A branch and bound method for optimizing the resulting problem is devised. As a result, optimal and suboptimal layouts can be provided to the layout engineer for consideration and modification.

M. Bazaraa

[1] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[2] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[3] R. C. Lee,et al. CORELAP: Computerized relationship layout planning , 1967 .

[4] Andrew Whinston,et al. An Algorithm for the Quadratic Assignment Problem , 1970 .

[5] Maurice Hanan,et al. A review of the placement and quadratic assignment problems , 1972 .

[6] Klaus Zoller,et al. Layout Planning by Computer Simulation , 1972 .

[7] Charles H. Heider,et al. An n-step, 2-variable search algorithm for the component placement problem , 1973 .

[8] Mokhtar S. Bazaraa,et al. A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem , 1975, Oper. Res..