Abstract-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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.