운송 경로 손상을 고려한 트랜스포터의최적 블록 운송 경로 계획
Optimal Block Transportation Path Planning of Transporters considering the Damaged Path
1
조회
0
다운로드
7
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (10)
- Barbehenn, M., "A Note on the Complexity of Dijkstra’s Algorithm for Graphs with Weighted Vertices", IEEE Transaction on computers, 47(2), pp.263~ (1998)
- Bock, S., "Detailed Layout Planning for Irregularly-Shaped Machines with Transportation Path Design", European Journal of Operational Research, 177(2), pp.693~718 (2007)
- Cha, J.H., "Development and application of optimal block transportation simulation system of transporters in shipyard", Proceedings of the Society of CAD, 2012, ~
- Dijkstra, E.W., "A Note on Two Problems in Connxion with Graphs", Numerische Mathematik, 1(1), pp.269~271 (1959)
- Hart, P.E., "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", IEEE Transactions on Systems Science and Cybernetics SSC4, 4(2), pp.100~107 (1968)
- Hofner, C., "Path Planning and Guidance Techniques for an Autonomous Mobile Cleaning Robot", Robotics and Autonomous Systems, 14(2-3), pp.199~212 (1995)
- Joo, C.M., "Transporter scheduling for block transportation in the shipyard", Conference of Korean Operations Research and Management Science (2005)
- 주영훈, "작업환경 모델 기반 AGV의 최단 경로 탐색 알고리즘", 한국지능시스템학회 논문지, 17(5), pp.654~659 (2007), 한국지능시스템학회
- Roh, M.I., "A block transportation scheduling system considering a minimisation of travel distance without loading of and interference between multiple transporters", INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 49(11), pp.3231~3250 (2011), TAYLOR & FRANCIS LTD, 4 PARK SQUARE, MILTON PARK, ABINGDON, ENGLAND, OXON, OX14 4RN
- 임선빈, "트랜스포터의 공주행(空走行) 최소화를 고려한블록 운반 계획 최적화", 대한조선학회 논문집, 45(6), pp.646~655 (2008), 대한조선학회