Reduction of Drag Resistance by Pressure Drop in Pipeline with 3-Dimensional Design Optimization
Keywords:Optimal Pipeline Route, Drag Reduction, Pressure Drop, Dijkstra’s Algorithm, 3-Dimensional Projections
The searching for the most optimal pipeline route is a crucial problem in the maritime world because it consumes total designing time by 50%. Also, with different types of ships increases the design complexity. The usual design process has not considered the aspect of distance, cost, obstacles, drag, and pressure reduction in the pipeline very accurately. However, along with algorithms' development to optimize pipeline design, the time can be cut by 40%. This research uses computer-generated Dijkstra's algorithm to optimize pipeline design by considering several constraints in pipe spacing, the number of bends, crossings, pipeline stacks to improve drag reduction, and reducing pressure. This research was conducted to see the effect of pipe mapping on pressure drop, which is too influenced by human decisions that cannot consider bending, crossing, pipe piling, and bending of pipes that are too many to be considered by humans. Helping humans choose pipe mappings with various considerations that can affect pressure drop is advantageous because mapping helps to cut production times and produce a more efficient flow. In this study, this research aims to produce pressure drop by mapping pipes using the Djikstra algorithm by considering bending, crossing, and stacking, which are presented based on the 2-dimensional and 3-dimensional mapping. The data generated in the way of a comparison between drag reduction and pressure drop in pipe design optimization utilizing Dijkstra's and without using the Dijkstra's algorithm with 3-dimensional projections. The result shows the improvement of the drag reduction rate by 8% by decreasing pressure drop by 13%.