透過您的圖書館登入
IP:18.216.94.152
  • 期刊

網路區位模式應用於建築內部設備空間位置選擇之研究

The Application of Network Location Models to the Building Facility Allocation

摘要


在建築物中某些特殊設備空間,如各樓層負荷中心、管道間及電梯等的配置位置十分重要。以負荷中心為例,若配置得當往往可對樓層中各相關管線(如水、電、空調及網路等管線)的動線安排更具效率。以往此類設備空間的配置設計,多憑設計者的經驗而定。本文希望從一設施區位(facility location)問題的角度來對建築物內部設備空間的位置選擇做一探討,並期望能透過學理性的理論分析,將以往僅依據經驗法則所做的設計結果與其相較之。本研究將以一棟建築物的管道間及各樓層的負荷中心為例,應用網路理論為基礎,針對其設備空間的區位位置考量,並配合其他空間需求使用狀況的合理設計以做出適當位置選擇的安排。如此,在從事建築設計時對建築物設備空間區位配置的設計考慮,將可產生較佳的結果,同時也可達到設備管線資源更為經濟及充分的利用。基於此一目的,本文將對設備空間的配置提供具體的研究及建議,以做為建築設計決定設備空間區位的參考。本文将針對此設備空間中心問題特性加以討論,然後提出目前最佳的解題方法。每一種解題方法除理論探討外,並將計算步驟寫成電腦程式,同時並以實際的建築平面為案例加以驗證之,其結果顯示本文所建議的方法具有可行性及實用價値。

並列摘要


The location choices of some specific building facilities, such as the electrical loading center, facility conduit room and elevator etc., are very important while designing the plans of buildings. A major concern in location models is to find the optimal placement of facilities on a network-wide building design plan such that the cost of locating, operating, and providing service is minimized. The cost of serving each node (e.g., electrical switch or outlet etc.) can be defined as the cost incurred between node and the assigned node, say, electrical loading center. It refers to the direct cost that is primarily due to the distance to and from the facility location. Therefore, the back and forth distance between two nodes is an important component in determining the location of any new facilities. In this paper, we complete a study on the location choice design of building facilities from the viewpoint of location theory rather than the experience-based design concepts. We try to find the best location of conduit room in a design plan. The single center location problem of a building is to locate a new specific facility such as an electrical loading center or an elevator and so forth existing in a site plan, which can serve all other nodes (e.g., electrical switches) with the minimum distance or cost. There are two types of single center location problems that can be applied in building facility location choice design. One is the vertex 1-center problem and another is the absolute 1-center problem. In order to make a consistent comparison, the two different location problems have been programmed and tested with several architectural building facility plans.

參考文獻


Dijkstra, E. W.(1959).A note on two problems in connection with graphics.Numerische Mathematik.1(3)
Floyd, R. W.(1962).Algorithm 97, Shortest Path.Communications of the Association for Computing Machinery.5
Glover, F., Glover, R., Klingman, D.(1981).Computational Study of An Improved Shortest Path Algorithm.University of Texas.
Hakimi, S. L.(1964).Optimum Locations of Switching Centers and the Absolute Centers and Medians of A Graph.Operations Research.12
Hu, Te Chiang(1969).Integer Programming and Network Flows.Addison-Wesley Publishing Co..

延伸閱讀