최적 경로 알고리즘들의 계산비용 비교 및 트랜스포터의 최적 블록 운송 계획 적용

• Published in: 大韓造船學會 論文集 Vol. 53; no. 2; pp. 115 - 126
• Main Authors: 문종헌(Jong-Heon Moon), 유원선(Won-Sun Ruy), 차주환(Ju-Hwan Cha)
• Format: Journal Article
• Language: Korean
• Published: 대한조선학회 2016
• Subjects: 조선공학; Floyd algorithm(플로이드 알고리즘); Shortest path(최단경로); 시뮬레이티드 어닐링; Block transportation(블록 운송); Dijkstra algorithm(다익스트라 알고리즘); Simulated annealing(SA; A algorithm(에이스타 알고리즘); Transporter(트랜스포터)
• ISSN: 1225-1143; 2287-7355

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.