Journal of Navigation and Port Research 2011;35(1):63-70.
Published online February 28, 2011.
크레인 대수의 제약을 고려한 선석계획 문제에 대한 발견적 해법
박영만, 김갑환
A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes
Young-Man Park, Kap Hwan Kim
Abstract
This paper discusses the problem of scheduling berth and container cranes simultaneously in port container terminals. A mixed-integer programming model is formulated by considering various practical constraints. A heuristic algorithm is suggested for solving the mathematical model. A numerical experiment was conducted to test the performance of the suggested heuristic algorithm.
Key Words: scheduling;berth planning;container crane;optimization;container terminal


ABOUT
BROWSE ARTICLES
FOR CONTRIBUTORS
Editorial Office
C1-327 Korea Maritime and Ocean University
727 Taejong-ro, Youngdo-gu, Busan 49112, Korea
Tel: +82-51-410-4127    Fax: +82-51-404-5993    E-mail: jkinpr@kmou.ac.kr                

Copyright © 2024 by Korean Institute of Navigation and Port Research.

Developed in M2PI

Close layer
prev next