메뉴 건너뛰기




Volumn 39, Issue 2, 2012, Pages 299-309

A tree search procedure for the container relocation problem

Author keywords

Container relocation problem; Logistics; Seaport; Transportation; Tree search

Indexed keywords

CONTAINER RELOCATION; CONTAINER TERMINAL; GROUP INDEX; HEURISTIC TREE SEARCH; SEAPORT; SOLUTION APPROACH; TREE SEARCH;

EID: 79958103951     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.04.004     Document Type: Article
Times cited : (129)

References (21)
  • 1
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Voß Operations research at container terminals: a literature update Operations Research Spectrum 30 2007 1 52
    • (2007) Operations Research Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 2
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - A classification and literature review
    • DOI 10.1007/s00291-003-0157-z
    • D. Steenken, S. Voß, and R. Stahlbock Container terminal operation and operations research - a classification and literature overview Operations Research Spectrum 26 2004 3 49 (Pubitemid 40549578)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 4
    • 0032967843 scopus 로고    scopus 로고
    • Yard operations in the container terminal-a study in the 'unproductive moves'
    • T. Chen Yard operations in the container terminal - a study in the 'unproductive moves' Maritime Policy and Management 26 1999 27 38 (Pubitemid 29176107)
    • (1999) Maritime Policy and Management , vol.26 , Issue.1 , pp. 27-38
    • Chen, T.1
  • 6
    • 0031219807 scopus 로고    scopus 로고
    • Evaluation of the number of rehandles in container yards
    • PII S0360835297000247
    • K. Kim Evaluation of the number of rehandles in container yards Computers & Industrial Engineering 32 1997 701 711 (Pubitemid 127424613)
    • (1997) Computers and Industrial Engineering , vol.32 , Issue.4 , pp. 701-711
    • Kim, K.H.1
  • 7
    • 0032305735 scopus 로고    scopus 로고
    • Re-marshaling export containers in port container terminals
    • PII S036083529800182X
    • K. Kim, and J. Bae Re-marshaling export containers in port container terminals Computers & Industrial Engineering 35 1998 655 658 (Pubitemid 128674801)
    • (1998) Computers and Industrial Engineering , vol.35 , Issue.3-4 , pp. 655-658
    • Kim, K.H.1    Bae, J.W.2
  • 8
    • 0032306050 scopus 로고    scopus 로고
    • The optimal determination of the space requirement and the number of transfer cranes for import containers
    • PII S0360835298001259
    • K. Kim, and H. Kim The optimal determination of the space requirements and the number of transfer cranes for import containers Computers & Industrial Engineering 35 1998 427 430 (Pubitemid 128674745)
    • (1998) Computers and Industrial Engineering , vol.35 , Issue.3-4 , pp. 427-430
    • Kim, K.H.1    Kim, H.B.2
  • 9
    • 0344210402 scopus 로고    scopus 로고
    • Segregating space allocation models for container inventories in port container terminals
    • K. Kim, and H. Kim Segregating space allocation models for container inventories in port container terminals International Journal of Production Economics 59 1999 415 423
    • (1999) International Journal of Production Economics , vol.59 , pp. 415-423
    • Kim, K.1    Kim, H.2
  • 12
    • 34047098303 scopus 로고    scopus 로고
    • An optimization model for the container pre-marshalling problem
    • DOI 10.1016/j.cor.2005.12.006, PII S030505480500403X
    • Y. Lee, and N. Hsu An optimization model for the container pre-marshalling problem Computers and Operations Research 34 2007 3295 3313 (Pubitemid 46517858)
    • (2007) Computers and Operations Research , vol.34 , Issue.11 , pp. 3295-3313
    • Lee, Y.1    Hsu, N.-Y.2
  • 13
    • 58149234206 scopus 로고    scopus 로고
    • A neightborhood search heuristic for pre-marshalling export containers
    • Y. Lee, and S. Chao A neightborhood search heuristic for pre-marshalling export containers European Journal of Operational Research 196 2009 468 574
    • (2009) European Journal of Operational Research , vol.196 , pp. 468-574
    • Lee, Y.1    Chao, S.2
  • 14
    • 79958176398 scopus 로고    scopus 로고
    • A corridor-based algorithm for the pre-marshalling problem
    • Caserta M, Voß S. A corridor-based algorithm for the pre-marshalling problem. In: Proceedings of the EvoWorkshops 2009; 2008. p. 78897.
    • (2008) Proceedings of the EvoWorkshops 2009 , pp. 788-797
    • Caserta Voß, M.S.1
  • 15
    • 81855209013 scopus 로고    scopus 로고
    • A tree search procedure for the container pre-marshalling problem
    • submitted to publication
    • Bortfeldt A, Forster F. A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research, submitted to publication.
    • European Journal of Operational Research
    • Bortfeldt, A.1    Forster, F.2
  • 16
    • 27144527849 scopus 로고    scopus 로고
    • A heuristic rule for relocating blocks
    • DOI 10.1016/j.cor.2004.08.005, PII S0305054804001959, Part Special Issue: Optimization Days 2003
    • K. Kim, and G. Hong A heuristic rule for relocating blocks Computers & Operations Research 33 2006 940 954 (Pubitemid 41492058)
    • (2006) Computers and Operations Research , vol.33 , Issue.4 , pp. 940-954
    • Kim, K.H.1    Hong, G.-P.2
  • 18
    • 67650665352 scopus 로고    scopus 로고
    • A new binary description of the blocks relocation problem and benefits in a look ahead heuristic
    • Caserta M, Schwarze S, Voß S. A new binary description of the blocks relocation problem and benefits in a look ahead heuristic. In: Proceedings of the EvoCOP 2009; 2009. p. 3748.
    • (2009) Proceedings of the EvoCOP 2009 , pp. 37-48
    • Caserta, M.1    Schwarze, S.2    Voß, S.3
  • 19
    • 70349982089 scopus 로고    scopus 로고
    • A cooperative strategy for guiding the corridor method
    • M. Caserta, and S. Voß A cooperative strategy for guiding the corridor method Studies in Computational Intelligence 236 2009 273 286
    • (2009) Studies in Computational Intelligence , vol.236 , pp. 273-286
    • Caserta, M.1    Voß, S.2
  • 21
    • 71749087908 scopus 로고    scopus 로고
    • A heuristic for retrieving containers from a yard
    • Y. Lee, and Y. Lee A heuristic for retrieving containers from a yard Computers & Operations Research 37 2010 1139 1147
    • (2010) Computers & Operations Research , vol.37 , pp. 1139-1147
    • Lee, Y.1    Lee, Y.2


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