메뉴 건너뛰기




Volumn 17, Issue 4, 2006, Pages 479-492

Load scheduling for multiple quay cranes in port container terminals

Author keywords

Container terminals; Genetic algorithm; Load scheduling; Simulated annealing

Indexed keywords

CONTAINERS; ENCODING (SYMBOLS); GENETIC ALGORITHMS; MATERIALS HANDLING; NUMERICAL ANALYSIS; PROBLEM SOLVING; SHIP CRANES; SIMULATED ANNEALING; TURNAROUND TIME;

EID: 33747639832     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-005-0020-y     Document Type: Article
Times cited : (78)

References (13)
  • 3
    • 0010155341 scopus 로고
    • The automatic planning and sequencing of containers for containership loading and unloading
    • Pitkin, Roche & Williams, (Eds.). Asterdam: North-Holland Publishing Co
    • Cojeen, H. P., & Dyke, P. V. (1976). The automatic planning and sequencing of containers for containership loading and unloading. In Pitkin, Roche & Williams, (Eds.), Ship Operation Automation. Asterdam: North-Holland Publishing Co. (pp. 415-423).
    • (1976) Ship Operation Automation , pp. 415-423
    • Cojeen, H.P.1    Dyke, P.V.2
  • 5
    • 17444425276 scopus 로고    scopus 로고
    • A beam search algorithm for the load sequencing of outbound containers in port container terminals
    • Kim, K. H., Kang, J. S., & Ryu, K. R. (2004). A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectrum, 26, 93-116.
    • (2004) OR Spectrum , vol.26 , pp. 93-116
    • Kim, K.H.1    Kang, J.S.2    Ryu, K.R.3
  • 6
    • 0002767793 scopus 로고    scopus 로고
    • An optimal routing algorithm for a yard crane in port container terminals
    • Kim, K. H., & Kim, K. Y. (1999). An optimal routing algorithm for a yard crane in port container terminals. Transportation Science, 33(1), 17-33.
    • (1999) Transportation Science , vol.33 , Issue.1 , pp. 17-33
    • Kim, K.H.1    Kim, K.Y.2
  • 7
    • 0043022071 scopus 로고    scopus 로고
    • Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
    • Kim K. Y., & Kim, K. H. (2003). Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals. Naval Research Logistics, 50(5), 498-514.
    • (2003) Naval Research Logistics , vol.50 , Issue.5 , pp. 498-514
    • Kim, K.Y.1    Kim, K.H.2
  • 8
    • 84885901838 scopus 로고    scopus 로고
    • Genetic algorithms to schedule container transfers at multimodal terminals
    • Kozan, E., & Preston, P. (1999). Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research, 6, 311-329.
    • (1999) International Transactions in Operational Research , vol.6 , pp. 311-329
    • Kozan, E.1    Preston, P.2
  • 9
    • 0037320091 scopus 로고    scopus 로고
    • A heuristic for dynamic yard crane deployment in a container terminal
    • Linn, R. J., & Zhang, C.-Q. (2003). A heuristic for dynamic yard crane deployment in a container terminal. IIE Transactions, 35, 161-174.
    • (2003) IIE Transactions , vol.35 , pp. 161-174
    • Linn, R.J.1    Zhang, C.-Q.2
  • 11
    • 0036475313 scopus 로고    scopus 로고
    • Analysis and algorithms for the transtainer routing problem in container port operations
    • Narasimhan, A., & Palekar. U. S. (2002). Analysis and algorithms for the transtainer routing problem in container port operations. Transportation Science, 56(1), 63-78.
    • (2002) Transportation Science , vol.56 , Issue.1 , pp. 63-78
    • Narasimhan, A.1    Palekar, U.S.2
  • 12
    • 10444233579 scopus 로고    scopus 로고
    • Crane scheduling in container yards with inter-crane interference
    • Ng, W. C. (2005). Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research, 164, 64-78.
    • (2005) European Journal of Operational Research , vol.164 , pp. 64-78
    • Ng, W.C.1
  • 13


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