Journal of the Society of Naval Architects of Korea (대한조선학회논문집)

The Society of Naval Architects of Korea (대한조선학회)
권호 표지
DOI QR코드

DOI QR Code

Optimal Block Transportation Path Planning of Transporters considering the Damaged Path

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

  • Heo, Ye-Ji (Graduate School, Dept. of Naval Architecture and Marine Engineering, Mokpo National University) ;
  • Cha, Ju-Hwan (Dept. of Ocean Engineering, Mokpo National University) ;
  • Cho, Doo-Yeoun (Dept. of Naval Architecture and Marine Engineering, Mokpo National University) ;
  • Song, Ha-Cheol (Dept. of Naval Architecture and Marine Engineering, Mokpo National University)
  • 허예지 (국립목포대학교 선박해양공학과 대학원) ;
  • 차주환 (국립목포대학교 해양시스템공학과) ;
  • 조두연 (국립목포대학교 조선공학과) ;
  • 송하철 (국립목포대학교 조선공학과)
  • Received : 2012.09.04
  • Accepted : 2013.08.27
  • Published : 2013.10.20
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. Barbehenn, M., 1998. A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices. IEEE Transaction on computers, 47(2), p.263. https://doi.org/10.1109/12.663776
  2. Bock, S. & Hoberg, K., 2007. Detailed Layout Planning for Irregularly-Shaped Machines with Transportation Path Design. European Journal of Operational Research, 177(2), pp.693-718. https://doi.org/10.1016/j.ejor.2005.11.011
  3. Cha, J.H. Cho, D.Y. Song, H.C. & Roh, M.I., 2012. Development and application of optimal block transportation simulation system of transporters in shipyard. Proceedings of the Society of CAD/CAM Engineers Conference, Pyeongchang, Korea, 1-3 February 2012.
  4. Dijkstra, E.W., 1959. A Note on Two Problems in Connxion with Graphs. Numerische Mathematik, 1(1), pp.269-271. https://doi.org/10.1007/BF01386390
  5. Hart, P.E. Nilsson, N.J. & Raphael, B., 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics SSC4, 4(2), pp.100-107. https://doi.org/10.1109/TSSC.1968.300136
  6. Hofner, C. & Schmidt, G.K., 1995. Path Planning and Guidance Techniques for an Autonomous Mobile Cleaning Robot. Robotics and Autonomous Systems, 14(2-3), pp.199-212. https://doi.org/10.1016/0921-8890(94)00034-Y
  7. Joo, C.M. Lee, W.S. & Lee, K.B., 2005. Transporter scheduling for block transportation in the shipyard. Conference of Korean Operations Research and Management Science, Cheongju, Korea, 13-14 May 2005.
  8. Joo, Y.H. & Kim, J.S., 2007. Shortest Path Searching Algorithm for AGV Based on Working Environmental Model. Journal of Fuzzy Logic and Intelligent Systems, 17(5), pp.654-659. https://doi.org/10.5391/JKIIS.2007.17.5.654
  9. Roh, M.I. & Cha, J.H., 2011. 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. https://doi.org/10.1080/00207543.2010.484427
  10. Yim, S.B. Roh, M.I. Cha, J.H. & Lee, K.Y., 2008. Optimal Block Transportation Scheduling considering the Minimization of the Travel Distance without Overload of a Transporter. Journal of the Society of Naval Architects of Korea, 45(6), pp.646-655. https://doi.org/10.3744/SNAK.2008.45.6.646

Cited by

  1. Development of Optimal Planning System for Operating Transporters in Shipyard vol.21, pp.2, 2016, https://doi.org/10.7315/CADCAM.2016.177
  2. Comparison of Optimal Path Algorithms and Implementation of Block Transporter Planning System vol.53, pp.2, 2016, https://doi.org/10.3744/SNAK.2016.53.2.115