Host: The Japan Society of Mechanical Engineers
Name : [in Japanese]
Date : September 03, 2023 - September 06, 2023
In the wiring design of electrical equipment construction such as buildings, it is necessary to design the optimal cable route by considering various conditions such as constraints on the building structure and constraints due to the electrical equipment itself. Concretely, it is necessary to determine the shortest possible wiring route in order to prevent voltage drop while avoiding structures such as beams and pillars. In this study, we propose a graph algorithm for searching for the shortest route by modeling the candidate paths of cable routes on architectural drawings as a Steiner tree in order to search for the shortest route whose total length is minimized for one floor of a building. First, candidates for switchboards and wiring routes are modeled in a graph structure, and the shortest route is searched by applying an algorithm that is an extension of the KMB method. In order to validate the effectiveness of the proposed algorithm, we conducted the numerical experiments on one floor of the actual building.
