메뉴 건너뛰기




Volumn 38, Issue 11, 2011, Pages 14136-14147

An enriched model for the integrated berth allocation and quay crane assignment problem

Author keywords

Berth allocation; Container terminal; Mathematical modeling; Quay cranes

Indexed keywords

ASSIGNMENT PROBLEMS; BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; CONTAINER TERMINAL; CONTAINER TERMINAL OPERATION; HANDLING TIME; HYBRID HEURISTICS; MATHEMATICAL MODELING; MILP MODEL; QUAY CRANES; REAL LIFE DATA; REAL-LIFE APPLICATIONS; RESEARCH EFFORTS; VESSEL SIZE;

EID: 79960006751     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.04.224     Document Type: Article
Times cited : (78)

References (31)
  • 3
    • 70350568773 scopus 로고    scopus 로고
    • A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals
    • DOI
    • Bierwirth, C.; & Meisel, F. (2009). A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals. European Journal of Operational Research, DOI 10.1016/j.ejor.2009.05.031
    • (2009) European Journal of Operational Research
    • Bierwirth, C.1    Meisel, F.2
  • 7
    • 79959943852 scopus 로고    scopus 로고
    • Drewry Shipping Consultants London
    • Drewry Shipping Consultants, (2008). Container Forecaster 1Q08, London, p. 218
    • (2008) Container Forecaster 1Q08 , pp. 218
  • 9
    • 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
  • 10
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K'.I. Nagaiwa, and C.W. Tat Efficient planning of berth 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
  • 13
    • 11244320709 scopus 로고    scopus 로고
    • Corrigendum to "the dynamic berth allocation problem for a container port
    • Transportation Research Part B 35 (2001) 401-417
    • 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 2005 197
    • (2005) Transportation Research Part B , vol.39 , pp. 197
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 14
    • 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, 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
  • 15
    • 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-container ships 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
  • 18
    • 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.M. 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
  • 20
    • 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
  • 21
    • 33645678746 scopus 로고    scopus 로고
    • Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
    • J. Liu, Y.-W. Wan, and L. Wang Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures Naval Research Logistics 53 2006 60 74
    • (2006) Naval Research Logistics , vol.53 , pp. 60-74
    • Liu, J.1    Wan, Y.-W.2    Wang, L.3
  • 22
    • 33750729896 scopus 로고    scopus 로고
    • Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents
    • DOI 10.1016/j.ejor.2005.12.016, PII S0377221705008489
    • P. Lokuge, and D. Alahakoon Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents European Journal of Operational Research 177 2007 1985 2015 (Pubitemid 44709463)
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 1985-2015
    • Lokuge, P.1    Alahakoon, D.2
  • 23
    • 33748672706 scopus 로고    scopus 로고
    • Berth management in container terminal: The template design problem
    • DOI 10.1007/s00291-006-0036-5
    • R. Moorthy, and C. 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
  • 24
    • 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
  • 25
    • 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
  • 26
    • 0025436513 scopus 로고
    • A branch and bound solution method for the crane scheduling problem
    • R.I. Peterkofsky, and C.F. Daganzo A branch and bound solution method for the crane scheduling problem Transportation Research Part B 24 1990 159 172
    • (1990) Transportation Research Part B , vol.24 , pp. 159-172
    • Peterkofsky, R.I.1    Daganzo, C.F.2
  • 27
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Voß Operations research at container terminals: A literature update OR Spectrum 30 2008 1 52
    • (2008) OR Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 28
    • 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 Int. Trans. Oper. Res. 16 2009 87 107
    • (2009) Int. Trans. Oper. Res. , vol.16 , pp. 87-107
    • Tang, L.1    Li, S.2    Liu, J.3
  • 29
    • 59049093348 scopus 로고    scopus 로고
    • An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
    • R. Tavakkoli-Moghaddam, A. Makui, S. Salahi, M. Bazzazi, and F. Taheri An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports Computers & Industrial Engineering 56 2009 241 248
    • (2009) Computers & Industrial Engineering , vol.56 , pp. 241-248
    • Tavakkoli-Moghaddam, R.1    Makui, A.2    Salahi, S.3    Bazzazi, M.4    Taheri, F.5
  • 30
    • 35348887711 scopus 로고    scopus 로고
    • Schedule unreliability in liner shipping: Origins and consequences for the hinterland supply chain
    • B. Vernimmen, W. Dullaert, and S. Engelen Schedule unreliability in liner shipping: Origins and consequences for the hinterland supply chain Maritime Economics and Logistics 9 2007 193 213
    • (2007) Maritime Economics and Logistics , vol.9 , pp. 193-213
    • Vernimmen, B.1    Dullaert, W.2    Engelen, S.3
  • 31
    • 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가 분석하여 추출한 것입니다.