3D Piping Route Design Including Branch and Elbow Using Improvements for Dijkstra’s Algorithm
Hai Nguyen, Dong-Joon Kim, Jianke Gao
Available Online January 2016.
- https://doi.org/10.2991/icaita-16.2016.76How to use a DOI?
- piping route design; Dijkstra’s algorithm; optimum design; shortest paths
- In ship design problem, piping route design is the most complex stage because the internal spaces inside the ship are limited and the ship, in general, has many systems and subsystems that consist a large number of pipes. In order to optimize the piping cost as well as the construction time, so many methods have been considered and applied. But, most of methods just consider to problem of shortest path while the piping cost and the construction time also depend on the branch and number of bend & elbow. Dijkstra’s algorithm is one of the most famous method of deterministic approach methods because it is always for the best solution. But it takes a long calculation time, occupies much memory and just consider to problem of shortest path. To fix that disadvantage, in this paper, the Dijkstra’s algorithm with some improvements is used to reduce the calculation time, occupied memory and the shortest paths which are exported by this method will have a minimum number of bend & elbow. An example in a 3D simple engine room was used to show the results what are exported by using our method.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Hai Nguyen AU - Dong-Joon Kim AU - Jianke Gao PY - 2016/01 DA - 2016/01 TI - 3D Piping Route Design Including Branch and Elbow Using Improvements for Dijkstra’s Algorithm BT - Proceedings of the 2016 International Conference on Artificial Intelligence: Technologies and Applications PB - Atlantis Press SP - 309 EP - 312 SN - 1951-6851 UR - https://doi.org/10.2991/icaita-16.2016.76 DO - https://doi.org/10.2991/icaita-16.2016.76 ID - Nguyen2016/01 ER -