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

  • 제35권1호
  • /
  • Pages.63-70
  • /
  • 2011
  • /
  • 1598-5725(pISSN)
  • /
  • 2093-8470(eISSN)
한국항해항만학회 (Korean Institute of Navigation and Port Research)
권호 표지
DOI QR코드

DOI QR Code

크레인 대수의 제약을 고려한 선석계획 문제에 대한 발견적 해법

A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes

  • 박영만 (해군사관학교 국방경영과학과) ;
  • 김갑환 (부산대학교 산업공학과,)
  • Park, Young-Man (Department of Management Science, Korea Naval Academy) ;
  • Kim, Kap-Hwan (Department of Industrial Engineering, Pusan National University)
  • 투고 : 2010.10.07
  • 심사 : 2011.01.13
  • 발행 : 2011.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구는 컨테이너 터미널에서 선박의 선적작업을 위한 선석배정 및 크레인 할당문제를 동시에 결정하는 문제를 다루고 있다. 실제 컨테이너 터미널에서 고려하고 있는 다양한 형태의 제약을 고려하여 선석계획 및 크레인할당 문제에 대한 혼합정수모델을 제시하였다. 제안된 문제에 대해 좋은 해를 짧은 시간 안에 구하기 위하여 발견적 해법을 제시하였다. 또한 수치예제를 이용하여 제시된 발견적 기법의 수행도를 비교분석하였다. 분석결과 제시된 기법은 짧은 시간 안에 좋은 해를 제공하는 것으로 나타났다.

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.

키워드

참고문헌

  1. Brown, G. G., Lawphongpanich, S., and Thurman, K.P.(1994), “Optimizing Ship Berthing,” Naval ResearchLogistics 41, pp. 1-15. https://doi.org/10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L
  2. Daganzo, C. F.(1990), “The Crane Scheduling Problem,”Transportation Research, Vol. 24B, No. 3 , pp. 159-172.
  3. Geoffrion, A. M.(1974), “Lagrangean Relaxation forInteger Programming,” Mathematical ProgrammingStudy 2, pp. 82-114. https://doi.org/10.1007/BFb0120690
  4. Held, M., Wolfe, P., and Crowder, H. P.(1974),“Validation of Sub-gradient Optimization,”Mathematical. Programming 6, pp. 62-88. https://doi.org/10.1007/BF01580223
  5. Imai, A., Nishimura, E., and Papadimitriou, S.(2001),“The Dynamic Berth Allocation Problem for aContainer Port,” Transportation Research Part B 35,pp.401-417. https://doi.org/10.1016/S0191-2615(99)00057-0
  6. Lai, K. K. and Shih, K.(1992), “A Study of ContainerBerth Allocation,” Journal of Advanced Transportation26 (1), pp. 45-60. https://doi.org/10.1002/atr.5670260105
  7. Li, C-L., Cai, X., and Lee, C-Y.(1998), “Schedulingwith Multiple-Job-on-One-Processor Pattern,” IIETransactions 30, pp. 433-445.
  8. Lim, A.(1998), “The Berth Planning Problem,”Operation Research Letters 22 , pp. 105-110. https://doi.org/10.1016/S0167-6377(98)00010-8
  9. Meisel, F. and Bierwirth, C.(2006), "Integration of BerthAllocation and Crane Assignment to Improve theResource Utilization at a Seaport Container Terminal.In: Haasis, H-D., H.-D., Kopker, H., Schonberger,J.(Eds.), Operations Research Proceedings 2005.Springer, Berlin, pp.105-110.
  10. Meisel, F. and Bierwirth, C.(2009), "Heuristics for theIntegration of Crane Productivity in the BerthAllocation Problems," Transportation Research Part E45, pp. 196-209. https://doi.org/10.1016/j.tre.2008.03.001
  11. Murty, K. G.(1992), Network Programming, Prentice Hall, United States.
  12. Nishimura, E., Imai, A., and Papadimitriou, S.(2001),“Berth Allocation Planning in the Public Berth Systemby Genetic Algorithms,” European Journal ofOperational Research 131, pp. 282-292. https://doi.org/10.1016/S0377-2217(00)00128-4
  13. Park, Y.-M. and Kim, K. H.(2003), “A SchedulingMethod for Berth and Quay Cranes,” OR Spectrum,Vol. 25, No. 1, pp. 1-23. https://doi.org/10.1007/s00291-002-0109-z
  14. Peterkofsky, R. I. and Daganzo, C. F.(1989), “A Branchand Bound Solution Method for the Crane SchedulingProblem,” Transportation Research, Vol. 23B, No. 3, pp.159-175.