STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN

被引:20
作者
SMITH, JM
LIEBMAN, JS
机构
[1] Operations Research Laboratory, Department of Mechanical and Industrial Engineering, University of Illinois
关键词
D O I
10.1080/03052157908902401
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Buildings contain enormously complex configurations of corridors. pipes, ducts. conduits and related building system components. In many cases, the configuration and analysis of these component systems can be formulated as the Steiner tree problem with and without obstacles. Certain building systems can be represented with a Euclidean metric while others are best defined with a rectilinear (Manhattan) metric. The paper describes heuristic algorithms for the interactive development of minimal Steiner trees and circuits. The interactive approach enables architects and engineers to design these systems in ways consistent with the designed arrangement of building activities in two and three dimensions. © 1979, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码:15 / 36
页数:22
相关论文
共 39 条
[1]  
Aho A.V., Garey M.R., Hwang F.K., Rectilinear Steiner trees: efficient special-case algorithms, Networks, 7, pp. 37-58, (1977)
[2]  
Bertschi R.L., A computer program to optimize the lifecycle cost of a fan-duct system, (1976)
[3]  
Bindschedler A.E., Moore J.E., Optimal location of new machines in existing plant layouts, J. Industrial Eng, 12, 1, pp. 41-48, (1961)
[4]  
Bondy J.A., Murty U.S.R., Graph Theory With Applications, (1976)
[5]  
Boyce D.E., Sobranes J.L., Solutions to the optimal network problem with shipments related to transportation costs, (1977)
[6]  
Chang S.K., The generation of minimal trees with a Steiner topology, JACM, 19, 4, pp. 699-711, (1972)
[7]  
Christofides N., Graph theory: an algorithmic approach, (1975)
[8]  
Chu Y.J., Liu T.H., On the shortest arborescence of a directed graph, Sci. Sinicia, 14, pp. 1396-1400, (1965)
[9]  
Coxeter H.S.M., Introduction to geometry, (1961)
[10]  
Dreyfus S.E., Wagner R.A., The Steiner problem in graphs, Networks, 1, pp. 195-207, (1971)