운송 경로 손상을 고려한 트랜스포터의 최적 블록 운송 경로 계획

• Published in: 大韓造船學會 論文集 Vol. 50; no. 5; pp. 298 - 306
• Main Authors: 허예지(Ye-Ji Heo), 차주환(Ju-Hwan Cha), 조두연(Doo-Yeoun Cho), 송하철(Ha-Cheol Song)
• Format: Journal Article
• Language: Korean
• Published: 대한조선학회 2013
• Subjects: Optimal path planning(최적 경로 계획); Block transportation(블록 운송); Transporter(트랜스포터); Shortest path(최단 경로)
• ISSN: 1225-1143; 2287-7355

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.