메뉴 건너뛰기




Volumn 216, Issue 1, 2012, Pages 47-56

Berth allocation with time-dependent physical limitations on vessels

Author keywords

Berth allocation; Container terminals; Parallel machines; Scheduling; Tidal condition

Indexed keywords

ARRIVAL TIME; BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; COMPUTATIONAL EXPERIMENT; CONTAINER TERMINAL; CONTAINER TERMINALS; PARALLEL MACHINE; PHYSICAL LIMITATIONS; PROCESSING SET RESTRICTIONS; SCHEDULING PROBLEM; STATIC AND DYNAMIC; TIDAL CONDITIONS; TIME HORIZONS; TIME-DEPENDENT; WATER DEPTH;

EID: 80052782877     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.07.012     Document Type: Article
Times cited : (107)

References (45)
  • 2
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • C. Bierwirth, and F. Meisel A survey of berth allocation and quay crane scheduling problems in container terminals European Journal of Operational Research 202 3 2010 615 627
    • (2010) European Journal of Operational Research , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 8
    • 44649109639 scopus 로고    scopus 로고
    • A multi-objective multi-colony ant algorithm for solving the berth allocation problem
    • Y. Liu, A. Sun, H.T. Loh, W.F. Lu, E.-P. Lim, Springer-Verlag Berlin
    • C.Y. Cheong, and K.C. Tan A multi-objective multi-colony ant algorithm for solving the berth allocation problem Y. Liu, A. Sun, H.T. Loh, W.F. Lu, E.-P. Lim, A dvances of Computational Intelligence in Industrial Systems 2008 Springer-Verlag Berlin 333 350
    • (2008) A Dvances of Computational Intelligence in Industrial Systems , pp. 333-350
    • Cheong, C.Y.1    Tan, K.C.2
  • 9
  • 10
  • 11
    • 28244441388 scopus 로고    scopus 로고
    • Models and tabu search heuristics for the berth-allocation problem
    • DOI 10.1287/trsc.1050.0120
    • J.-F. Cordeau, G. Laporte, P. Legato, and L. Moccia Models and tabu search heuristics for the berth-allocation problem Transportation Science 39 4 2005 526 538 (Pubitemid 41706012)
    • (2005) Transportation Science , vol.39 , Issue.4 , pp. 526-538
    • Cordeau, J.-F.1    Laporte, G.2    Legato, P.3    Moccia, L.4
  • 12
    • 84954508726 scopus 로고    scopus 로고
    • Berth allocation planning optimization in container terminals
    • C.S. Tang, C.-P. Teo, K.-K. Wei, System and Optimization Springer New York
    • J. Dai, W. Lin, R. Moorthy, and C.-P. Teo Berth allocation planning optimization in container terminals C.S. Tang, C.-P. Teo, K.-K. Wei, Supply Chain Analysis: A Handbook on the Interaction of Information System and Optimization 2008 Springer New York 69 104
    • (2008) Supply Chain Analysis: A Handbook on the Interaction of Information , pp. 69-104
    • Dai, J.1    Lin, W.2    Moorthy, R.3    Teo, C.-P.4
  • 13
    • 17444376768 scopus 로고    scopus 로고
    • The berth allocation problem: Models and solution methods
    • DOI 10.1007/s00291-003-0140-8
    • Y. Guan, and R.K. Cheung The berth allocation problem: Models and solution methods OR Spectrum 26 1 2004 75 92 (Pubitemid 40549580)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 75-92
    • Guan, Y.1    Cheung, R.K.2
  • 14
    • 0036794414 scopus 로고    scopus 로고
    • A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
    • DOI 10.1016/S0167-6377(02)00147-5, PII S0167637702001475
    • Y. Guan, W.-Q. Xiao, R.K. Cheung, and C.-L. Li A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis Operations Research Letters 30 5 2002 343 350 (Pubitemid 35167682)
    • (2002) Operations Research Letters , vol.30 , Issue.5 , pp. 343-350
    • Guan, Y.1    Xiao, W.-Q.2    Cheung, R.K.3    Li, C.-L.4
  • 15
    • 44649179214 scopus 로고    scopus 로고
    • Variable neighborhood search for minimum cost berth allocation
    • DOI 10.1016/j.ejor.2006.12.057, PII S0377221707001221
    • P. Hansen, C. Oguz, and N. Mladenovic Variable neighborhood search for minimum cost berth allocation European Journal of Operational Research 191 3 2008 636 649 (Pubitemid 351778608)
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 636-649
    • Hansen, P.1    Oguz, C.2    Mladenovic, N.3
  • 17
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K. Nagaiwa, and W.T. Chan Efficient planning of berth allocation for container terminals in Asia Journal of Advanced Transportation 31 1 1997 75 94 (Pubitemid 127603112)
    • (1997) Journal of Advanced Transportation , vol.31 , Issue.1 , pp. 75-94
    • Imai, A.1    Nagaiwa, K.2    Tat, C.W.3
  • 18
    • 33751395932 scopus 로고    scopus 로고
    • Berth allocation at indented berths for mega-containerships
    • DOI 10.1016/j.ejor.2006.03.034, PII S0377221706001913
    • A. Imai, E. Nishimura, M. Hattori, and S. Papadimitriou Berth allocation at indented berths for mega-containerships European Journal of Operational Research 179 2 2007 579 593 (Pubitemid 44821619)
    • (2007) European Journal of Operational Research , vol.179 , Issue.2 , pp. 579-593
    • Imai, A.1    Nishimura, E.2    Hattori, M.3    Papadimitriou, S.4
  • 21
    • 11244320709 scopus 로고    scopus 로고
    • Erratum: ' The dynamic berth allocation problem for a container port' (Transportation Research Part B (2001) vol. 35 (401-417) 10.1016/S0191- 261599000570)
    • DOI 10.1016/j.trb.2004.03.004, PII S0191261599000570
    • A. Imai, E. Nishimura, and S. Papadimitriou Corrigendum to "The dynamic berth allocation problem for a container port [Transportation Research Part B 35 (2001) 401-417] Transportation Research Part B 39 3 2005 197 (Pubitemid 40058677)
    • (2005) Transportation Research Part B: Methodological , vol.39 , Issue.3 , pp. 197
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 23
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using a continuous location space approach
    • DOI 10.1016/j.trb.2004.04.004, PII S0191261504000505
    • A. Imai, X. Sun, E. Nishimura, and S. Papadimitriou Berth allocation in a container port: Using a continuous location space approach Transportation Research Part B 39 3 2005 199 221 (Pubitemid 40058678)
    • (2005) Transportation Research Part B: Methodological , vol.39 , Issue.3 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 27
    • 77954316066 scopus 로고    scopus 로고
    • The continuous berth allocation problem: A greedy randomized adaptive search solution
    • D.-H. Lee, J.H. Chen, and J.X. Cao The continuous berth allocation problem: A greedy randomized adaptive search solution Transportation Research Part E 46 6 2010 1017 1029
    • (2010) Transportation Research Part e , vol.46 , Issue.6 , pp. 1017-1029
    • Lee, D.-H.1    Chen, J.H.2    Cao, J.X.3
  • 28
    • 58149231340 scopus 로고    scopus 로고
    • An optimization heuristic for the berth scheduling problem
    • Y. Lee, and C.-Y. Chen An optimization heuristic for the berth scheduling problem European Journal of Operational Research 196 2 2009 500 508
    • (2009) European Journal of Operational Research , vol.196 , Issue.2 , pp. 500-508
    • Lee, Y.1    Chen, C.-Y.2
  • 31
    • 60549101050 scopus 로고    scopus 로고
    • A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    • C. Liang, Y. Huang, and Y. Yang A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning Computers and Industrial Engineering 56 3 2009 1021 1028
    • (2009) Computers and Industrial Engineering , vol.56 , Issue.3 , pp. 1021-1028
    • Liang, C.1    Huang, Y.2    Yang, Y.3
  • 32
    • 57149146833 scopus 로고    scopus 로고
    • Multiobjective hybrid genetic algorithm for quay crane scheduling in berth allocation planning
    • C. Liang, L. Lin, and J. Jo Multiobjective hybrid genetic algorithm for quay crane scheduling in berth allocation planning International Journal of Manufacturing Technology and Management 16 1-2 2009 127 146
    • (2009) International Journal of Manufacturing Technology and Management , vol.16 , Issue.12 , pp. 127-146
    • Liang, C.1    Lin, L.2    Jo, J.3
  • 33
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • PII S0167637798000108
    • A. Lim The berth planning problem Operations Research Letters 22 2-3 1998 105 110 (Pubitemid 128458164)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 34
    • 57149135986 scopus 로고    scopus 로고
    • Heuristics for the integration of crane productivity in the berth allocation problem
    • F. Meisel, and C. Bierwirth Heuristics for the integration of crane productivity in the berth allocation problem Transportation Research Part E 45 1 2009 196 209
    • (2009) Transportation Research Part e , vol.45 , Issue.1 , pp. 196-209
    • Meisel, F.1    Bierwirth, C.2
  • 35
    • 60449112191 scopus 로고    scopus 로고
    • The berth allocation problem: A strong formulation solved by a Lagrangian approach
    • M.F. Monaco, and M. Sammarra The berth allocation problem: A strong formulation solved by a Lagrangian approach Transportation Science 41 2 2007 265 280
    • (2007) Transportation Science , vol.41 , Issue.2 , pp. 265-280
    • Monaco, M.F.1    Sammarra, M.2
  • 36
    • 33748672706 scopus 로고    scopus 로고
    • Berth management in container terminal: The template design problem
    • DOI 10.1007/s00291-006-0036-5
    • R. Moorthy, and C.-P. Teo Berth management in container terminal: The template design problem OR Spectrum 28 4 2006 495 518 (Pubitemid 44386728)
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.-P.2
  • 37
    • 0035372166 scopus 로고    scopus 로고
    • Berth allocation planning in the public berth system by genetic algorithms
    • DOI 10.1016/S0377-2217(00)00128-4, PII S0377221700001284
    • E. Nishimura, A. Imai, and S. Papadimitriou Berth allocation planning in the public berth system by genetic algorithms European Journal of Operational Research 131 2 2001 282 292 (Pubitemid 32271744)
    • (2001) European Journal of Operational Research , vol.131 , Issue.2 , pp. 282-292
    • Nishimura, E.1    Imai, A.2    Papadimitriou, S.3
  • 38
    • 43949091833 scopus 로고    scopus 로고
    • Scheduling parallel machines with inclusive processing set restrictions
    • DOI 10.1002/nav.20286
    • J. Ou, J.Y.-T. Leung, and C.-L. Li Scheduling parallel machines with inclusive processing set restrictions Naval Research Logistics 55 4 2008 328 338 (Pubitemid 351702827)
    • (2008) Naval Research Logistics , vol.55 , Issue.4 , pp. 328-338
    • Ou, J.1    Leung, J.Y.-T.2    Li, C.-L.3
  • 39
    • 0036724291 scopus 로고    scopus 로고
    • Berth scheduling for container terminals by using a sub-gradient optimization technique
    • DOI 10.1057/palgrave.jors.2601412
    • K.T. Park, and K.H. Kim Berth scheduling for container terminals by using a sub-gradient optimization technique Journal of the Operational Research Society 53 9 2002 1054 1062 (Pubitemid 34964231)
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.9 , pp. 1054-1062
    • Park, K.T.1    Kim, K.H.2
  • 40
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for Berth and Quay cranes
    • Y.-M. Park, and K.H. Kim A scheduling method for berth and quay cranes OR Spectrum 25 1 2003 1 23 (Pubitemid 38260021)
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 42
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Voss Operations research at container terminals: A literature update OR Spectrum 30 1 2008 1 52
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 1-52
    • Stahlbock, R.1    Voss, S.2
  • 43
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - A classification and literature review
    • DOI 10.1007/s00291-003-0157-z
    • D. Steenken, S. Voss, and R. Stahlbock Container terminal operation and operations research - A classification and literature review OR Spectrum 26 1 2004 3 49 (Pubitemid 40549578)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 44
    • 85007330944 scopus 로고    scopus 로고
    • Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
    • L. Tang, S. Li, and J. Liu Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex International Transactions in Operational Research 16 1 2009 87 107
    • (2009) International Transactions in Operational Research , vol.16 , Issue.1 , pp. 87-107
    • Tang, L.1    Li, S.2    Liu, J.3
  • 45
    • 33845684733 scopus 로고    scopus 로고
    • A stochastic beam search for the berth allocation problem
    • DOI 10.1016/j.dss.2006.06.008, PII S016792360600090X, Decision Support Systems in Emerging Economies
    • F. Wang, and A. Lim A stochastic beam search for the berth allocation problem Decision Support Systems 42 4 2007 2186 2196 (Pubitemid 44969944)
    • (2007) Decision Support Systems , vol.42 , Issue.4 , pp. 2186-2196
    • Wang, F.1    Lim, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.