抄録
During the ship design, designers have to deal with all pipe-routes in order to generate practical piping layouts composed by the minimum cost value (i.e. interference with obstacles, the length of each pipe-parts, etc.). However, the routing task requires huge work hours because there are many regulations and functional design rules in the field. In this paper, we propose an automatic routing system for multiple pipe-routes. The proposed system aims to solve the complicated multiple routing problems and to improve the design work efficiency. In the routing problem for pipes, there are two major factors having the significant influence to final routing designs: the order of routing search and the selection from candidates of pipe-routes. The routing system is capable of handling these two factors by adopting Touch and Cross method and simulated annealing method. Touch and Cross method is routing algorithm to find candidates including no interference with each path. Simulated annealing method is one of the optimization methods to find a global optimum of a given function in a large search space. By combining these two methods, the routing system can reduce the influence of the search order and the selection problem. Therefore, it is able to find suitable pipe-routes automatically though there are no guarantees to find the best layouts. The routing system also uses Dijkstra's method as a routing method to find the optimal route efficiently. The performance of the system is demonstrated through several simulations.
