Optimized Ballast Water Exchange Management for Bulk Carriers

벌크 화물선용 자동 밸러스트수 교환계획 시스템 개발

  • HONG CHUNG-YOU (Department of Advanced Marine Transportation Plan and Production Management, Chosun University) ;
  • PARK JE-WOONG (Department of Advanced Marine Transportation Plan and Production Management, Chosun University)
  • 홍충유 (조선대학교 첨단해상운송시스템설계 및 생산관리학과) ;
  • 박제웅 (조선대학교 첨단해상운송시스템설계 및 생산관리학과)
  • Published : 2004.08.01

Abstract

Many port states, such as New Zealand, U.S.A., Australia, and Canada, have strict regulations to prevent arriving ships from discharging polluted ballast water that contains harmful aquatic organisms and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, ballast exchange in deep sea is perceived as the most effective method of emptying ballast water. The ballast management plan contains the effective exchange method, ballast system, and safety considerations. In this study, we pursued both nautical engineering analysis and optimization of the algorithm, in order to generate the sequence of stability and rapidity. A heuristic algorithm was chosen on the basis of optimality and applicability to a sequential exchange problem. We have built an optimized algorithm for the automatic exchange of ballast water, by redefining core elements of the A$\ast$ algorithm, such as node, operator, and evaluation function. The final version of the optimized algorithm has been applied to existing bulk carrier, and the performance of the algorithm has been successfully verified.

Keywords

References

  1. 이성찬 (1998). A Study on the Computer Aided Process Planning System for Tuming Using Heurisdc SearchAlgorithm, 박사학위논문, 한국과학기술원, pp 39-47
  2. 최재홍 (1992). A Heuhstic Graph Search Based Collision Free Path Planning Strategy for Robot Manipulators, 석사학위논문, 한양대학교, pp 5-12
  3. 홍충유 (2003). 'Optimized Ballast Water Exchange Management for Tanker', 한국해양공학회 춘계학술대회논문집 , PP 1-4
  4. IMO (1997). Resolution A.868(20)