Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane

골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획

  • 노명일 (울산대학교 조선해양공학부) ;
  • 이규열 (서울대학교 조선해양공학과)
  • Published : 2010.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

Keywords

References

  1. Daganzo, C. F., "The Crane Scheduling Problem", Transportation Research B, Vol. 23, No.3, pp. 159-175, 1989. https://doi.org/10.1016/0191-2615(89)90001-5
  2. Daganzo, C. F., "Crane Productivity and Ship Delay in Ports", Transportation Research Record, Vol. 1251,pp. 1-9, 1990.
  3. Peterkofsky, R. I. and Daganzo, C. F., "A Branch and Bound Solution Method for the Crane Scheduling Problem", Transportation, Research B, Vol. 24, No.3, pp. 159-172, 1990. https://doi.org/10.1016/0191-2615(90)90014-P
  4. Kim, K. H. and Kim, K. Y., "An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals", Transportation Science, Vol. 33, No.1, pp. 17-33, 1999. https://doi.org/10.1287/trsc.33.1.17
  5. Ng, W. C. and Mak, K. L., "An Effective Heuristic for Scheduling a Yard Crane to Handle Jobs with Different Ready Times", Engineering Optimization, Vol. 37, No.8, pp. 867-877, 2005. https://doi.org/10.1080/03052150500323849
  6. Kim, K. H. and Park, K. T., "A Dynamic Space Allocation Method for Outbound Containers in Carrier- Direct System", Proceedings of the Third Annual International Conference on Industrial Engineering Theories, Applications and Practice, Hong Kong,Vol. 2, pp. 859-867, 1998.12 .28-31.
  7. 김후곤, 김철한, "컨테이너 터미널에서의 트랜스퍼 크레인의 최적 운영 방안에 관한 연구", 한국경영학회지, Vol. 33, No.1, pp. 35-49 , 2009.
  8. Cohon, J. L., Multiobjective Programming and Planning, Academic Press, New York, 1978.
  9. Gill, P. E., Murray, W. and Wright, M. H., Practical Optimization, Academic Press, New York, 1981.
  10. Reklaitis, G. V., Ravindran, A. and Ragsdell, K. M., Engineering Optimization: Methods and Applications, John Wiley and Sons , New York, 1983.
  11. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley,Reading, MA, 1989.
  12. Davis, L., Handbook of Genetic Algorithms, Van Nostrand-Reinhold, New York, 1991.
  13. 한성남, 이규열, 노명일, "개선된 유전자 알고리즘을 이용한 최적 공간 배치 설계에 관한 연구" 한국 CAD/CAM학회 논문집, Vol. 6, No.3, pp. 174-183, 2001.