Browse > Article
http://dx.doi.org/10.5394/KINPR.2011.35.1.63

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)
Publication Information
Journal of Navigation and Port Research / v.35, no.1, 2011 , pp. 63-70 More about this Journal
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.
Keywords
scheduling; berth planning; container crane; optimization; container terminal;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Lim, A.(1998), “The Berth Planning Problem,”Operation Research Letters 22 , pp. 105-110.   DOI   ScienceOn
2 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.
3 Meisel, F. and Bierwirth, C.(2009), "Heuristics for theIntegration of Crane Productivity in the BerthAllocation Problems," Transportation Research Part E45, pp. 196-209.   DOI   ScienceOn
4 Murty, K. G.(1992), Network Programming, Prentice Hall, United States.
5 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.   DOI   ScienceOn
6 Park, Y.-M. and Kim, K. H.(2003), “A SchedulingMethod for Berth and Quay Cranes,” OR Spectrum,Vol. 25, No. 1, pp. 1-23.   DOI
7 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.
8 Brown, G. G., Lawphongpanich, S., and Thurman, K.P.(1994), “Optimizing Ship Berthing,” Naval ResearchLogistics 41, pp. 1-15.   DOI   ScienceOn
9 Daganzo, C. F.(1990), “The Crane Scheduling Problem,”Transportation Research, Vol. 24B, No. 3 , pp. 159-172.
10 Geoffrion, A. M.(1974), “Lagrangean Relaxation forInteger Programming,” Mathematical ProgrammingStudy 2, pp. 82-114.   DOI
11 Held, M., Wolfe, P., and Crowder, H. P.(1974),“Validation of Sub-gradient Optimization,”Mathematical. Programming 6, pp. 62-88.   DOI
12 Imai, A., Nishimura, E., and Papadimitriou, S.(2001),“The Dynamic Berth Allocation Problem for aContainer Port,” Transportation Research Part B 35,pp.401-417.   DOI   ScienceOn
13 Lai, K. K. and Shih, K.(1992), “A Study of ContainerBerth Allocation,” Journal of Advanced Transportation26 (1), pp. 45-60.   DOI
14 Li, C-L., Cai, X., and Lee, C-Y.(1998), “Schedulingwith Multiple-Job-on-One-Processor Pattern,” IIETransactions 30, pp. 433-445.