Journal of Navigation and Port Research (한국항해항만학회지)

Korean Institute of Navigation and Port Research (한국항해항만학회)
권호 표지
DOI QR코드

DOI QR Code

PPGA for the Optimal Load Planning of Containers

컨테이너의 최적 적하계획을 위한 PPGA

  • 김길태 ((주)토탈소프트뱅크) ;
  • 조석제 (한국해양대학교 기계ㆍ정보공학) ;
  • 진강규 (한국해양대학교 기계ㆍ정보공학) ;
  • 김시화 (한국해양대학교 해사수송과학부)
  • Published : 2004.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

The container load planning is one of key factors for efficient operations of handling equipments at container ports. When the number of containers are large, finding a good solution using the conventional genetic algorithm is very time consuming. To obtain a good solution with considerably small effort, in this paper a pseudo-parallel genetic algorithm(PPGA) based on both the migration model and the ring topology is developed The performance of the PPGA is demonstrated through a test problem of determining the optimal loading sequence of the containers.

컨테이너 적하계획은 항만 장비운용의 효율성을 결정짖는 주요 요인 중 하나이다. 적하계획 문제에 유전알고리즘을 응용할 때 처리 작업 수가 많게 되면, 기존의 방법으로 많은 시간이 걸린다. 이 문제를 해결하기 위하여 본 논문에서는 이주모델과 링구조 기반의 의사병렬 유전알고리즘을 개발하고 컨테이너의 최적 적하순서를 결정하는 문제에 적용하여 그 유효성을 밝힌다.

Keywords

References

  1. 진강규(2000), '유전알고리즘과 그 응용' , 교우사.
  2. Chan, W. T. and Imai, A. (1996), 'The berth allocation problem: heuhstic method using genetic algorithm', Proc. of the 1st JSPS-NUS Seminar on Integrated Engineering, pp. 109-114
  3. Chipperfield, A. J., Fleming, P. J. and Zomaya, A. Y. (1996), 'Parallel Genetic Algorithms,Parallel & Distributed Computing Handbook', McGraw-Hill
  4. Cho, D. W. (1982), 'Development of a methodology for containership load planning', PhD Thesis, Oregon State University
  5. De Jong, K. A.(1975), 'An analysis of the behavior of a class of genetic adaptive systems', Doctoral Dissertation, The University of Michigan, Ann Arbor, Michigan
  6. Gifford, L. A. (1981), 'Containership load planning heuristic for a transtainer based container port', MSc Thesis, Oregon State University
  7. Grefenstette, J. J.(1986), 'Optimization of controlparameters for genetic algorithms, IEEE Trans', Syst.,Man, Cybern., Vol. SMC-16, No.1, pp. 122-128 https://doi.org/10.1109/TSMC.1986.289288
  8. Kim, K. H., Kim, K. Y. and Ko, C. S.(1997), 'Loadscheduling using a genetic algorithm in port container terminals' J. of the Korean Institute of Industrial Engineers, Vol. 23, No. 4, pp. 546-660
  9. Kim, K. Y. (1998), Mathematical models and search techniques for containership load planning', PhD Thesis, Pusan National University
  10. Kozan, E. and Preston, P.(1999), 'Genetic algorithm to schedule container transfers at multimodal terminals',Int. Trans. in Operation Research, Vol. 6, pp. 311-329 https://doi.org/10.1111/j.1475-3995.1999.tb00158.x
  11. Nishmura, E., Imai, A. and Papadimitriou, S.(2001), 'Berth allocation planning in the public berth system by genetic algorithms', European J. of Operation Research, Vol. 131, pp. 282-292 https://doi.org/10.1016/S0377-2217(00)00128-4
  12. Peterkofsky, R. I. and Daganzo, C. F.(1990), 'A branch-and-bound solution method for fhe crane scheduling problem', Transportation Research, Vol. 24B, pp. 159-172