메뉴 건너뛰기




Volumn 212, Issue 1, 2011, Pages 54-68

A decision model for berth allocation under uncertainty

Author keywords

Berth allocation; Container terminals; Meta heuristic; Port operation; Scheduling

Indexed keywords

ARRIVAL TIME; BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; CONTAINER TERMINALS; DECISION MODELS; INITIAL SCHEDULE; META-HEURISTIC; META-HEURISTIC APPROACH; NUMERICAL EXPERIMENTS; OPERATION TIME; PENALTY COST; PORT OPERATION; REALISTIC ENVIRONMENTS; REALISTIC SCENARIO; RECOVERY STRATEGIES; TWO STAGE;

EID: 79952701728     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.01.021     Document Type: Article
Times cited : (164)

References (21)
  • 1
    • 0042270345 scopus 로고
    • The value of information and stochastic programming
    • M. Avriel, and A.C. Williams The value of information and stochastic programming Operations Research 18 1970 947 954
    • (1970) Operations Research , vol.18 , pp. 947-954
    • Avriel, M.1    Williams, A.C.2
  • 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
  • 3
    • 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 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
  • 4
    • 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 2004 75 92 (Pubitemid 40549580)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 75-92
    • Guan, Y.1    Cheung, R.K.2
  • 5
    • 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 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
  • 6
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K. Nagaiwa, and W. Chan Efficient planning of berthing allocation for container terminals in Asia Journal of Advanced Transportation 31 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
  • 8
    • 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 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
  • 9
    • 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 intended berths for mega-containerships European Journal of Operational Research 179 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
  • 13
    • 0035899774 scopus 로고    scopus 로고
    • Berth planning and resources optimisation at a container terminal via discrete event simulation
    • DOI 10.1016/S0377-2217(00)00200-9, PII S0377221700002009
    • P. Legato, and R. Mazza Berth planning and resources optimization at a container terminal via discrete event simulation European Journal of Operational Research 133 2001 537 547 (Pubitemid 32594613)
    • (2001) European Journal of Operational Research , vol.133 , Issue.3 , pp. 537-547
    • Legato, P.1    Mazza, R.M.2
  • 14
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • PII S0167637798000108
    • A. Lim The berth planning problem Operations Research Letters 22 1998 105 110 (Pubitemid 128458164)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 15
    • 57149135986 scopus 로고    scopus 로고
    • Heuristics for the integration of crane productivity in berth allocation problem
    • F. Meisel, and C. Bierwirth Heuristics for the integration of crane productivity in berth allocation problem Transportation Research Part E 45 2009 196 209
    • (2009) Transportation Research Part e , vol.45 , pp. 196-209
    • Meisel, F.1    Bierwirth, C.2
  • 16
    • 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 2006 495 518 (Pubitemid 44386728)
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.-P.2
  • 17
    • 10644255568 scopus 로고    scopus 로고
    • A decision support system for operations in container terminal
    • K.G. Murty, J. Liu, Y.W. Wan, and R. Linn A decision support system for operations in container terminal Decision Support Systems 39 2005 309 332
    • (2005) Decision Support Systems , vol.39 , pp. 309-332
    • Murty, K.G.1    Liu, J.2    Wan, Y.W.3    Linn, R.4
  • 18
    • 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 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
  • 19
    • 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. Kim Berth scheduling for container terminals by using a sub-gradient optimization technique Journal of the Operational Research Society 53 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
  • 20
    • 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 2003 1 23 (Pubitemid 38260021)
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 21
    • 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 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가 분석하여 추출한 것입니다.