메뉴 건너뛰기




Volumn 22, Issue 3, 2011, Pages 471-479

Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning

Author keywords

Berth allocation planning; Container terminal; Multi objective hybrid genetic algorithm; Multi objective mathematical model; Number of quay cranes movements; Quay crane dynamic assignment

Indexed keywords

BERTH ALLOCATION PLANNING; CONTAINER SHIPS; CONTAINER TERMINAL; DYNAMIC ASSIGNMENT; ENCODING METHODS; HYBRID GENETIC ALGORITHMS; LOWER COST; MODERN LOGISTICS; MULTI OBJECTIVE; NUMERICAL EXPERIMENTS; OPERATION EFFICIENCIES; PRIORITY-BASED; QUAY CRANES; TRAFFIC GROWTH;

EID: 79958783397     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-009-0304-8     Document Type: Conference Paper
Times cited : (43)

References (20)
  • 1
    • 4143071403 scopus 로고    scopus 로고
    • Optimizing submarine berthing with a persistence incentive
    • 10.1002/(SICI)1520-6750(199 706)44:4<301::AID-NAV2>3.0.CO;2-A
    • G. G. Brown K. J. Cormican S. Lawphongpanich D. B. Widdis 1997 Optimizing submarine berthing with a persistence incentive Naval Research Logistics 44 4 301 318 10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A
    • (1997) Naval Research Logistics , vol.44 , Issue.4 , pp. 301-318
    • Brown, G.G.1    Cormican, K.J.2    Lawphongpanich, S.3    Widdis, D.B.4
  • 3
    • 33744484962 scopus 로고    scopus 로고
    • Berth allocation planning optimization in container terminal
    • Georgia Institute of Technology, Atlanta; National University of Singapore
    • Dai, J., Lin, W., Moorthy, R., Teo, C. P. (2004). Berth allocation planning optimization in container terminal. Working paper, Georgia Institute of Technology, Atlanta; National University of Singapore.
    • (2004) Working Paper
    • Dai, J.1    Lin, W.2    Moorthy, R.3    Teo, C.P.4
  • 12
    • 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 S. Papadimitriou 2007 Berth allocation at indented berths for mega-containerships European Journal of Operational Research 179 2 579 593 10.1016/j.ejor.2006.03.034 (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
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • DOI 10.1016/S0191-2615(02)00027-9
    • K. H. Kim K. C. Moon 2003 Berth scheduling by simulated annealing Transportation Research Part B: Methodological 37 6 541 560 10.1016/S0191- 2615(02)00027-9 (Pubitemid 36580172)
    • (2003) Transportation Research Part B: Methodological , vol.37 , Issue.6 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 14
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • 10.1016/S0377-2217(03)00133-4
    • K. H. Kim Y. M. Park 2004 A crane scheduling method for port container terminals European Journal of Operational Research 156 3 752 768 10.1016/S0377-2217(03)00133-4
    • (2004) European Journal of Operational Research , vol.156 , Issue.3 , pp. 752-768
    • Kim, K.H.1    Park, Y.M.2
  • 15
    • 57149146833 scopus 로고    scopus 로고
    • Multi-objective hybrid genetic algorithm for quay crane scheduling in berth allocation planning
    • 10.1504/IJMTM.2009.021506
    • C. J. Liang L. Lin 2009 Multi-objective hybrid genetic algorithm for quay crane scheduling in berth allocation planning International Journal of Manufacturing Technology and Management 16 1-2 127 146 10.1504/IJMTM.2009.021506
    • (2009) International Journal of Manufacturing Technology and Management , vol.16 , Issue.12 , pp. 127-146
    • Liang, C.J.1    Lin, L.2
  • 16
    • 60549101050 scopus 로고    scopus 로고
    • A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    • 10.1016/j.cie.2008.09.024
    • C. J. Liang Y. F. Huang Y. Yang 2009 A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning Computers & Industrial Engineering 56 3 1021 1028 10.1016/j.cie.2008.09.024
    • (2009) Computers & Industrial Engineering , vol.56 , Issue.3 , pp. 1021-1028
    • Liang, C.J.1    Huang, Y.F.2    Yang, Y.3
  • 17
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • PII S0167637798000108
    • A. Lim 1998 The berth planning problem Operations Research Letters 22 2-3 105 110 10.1016/S0167-6377(98)00010-8 (Pubitemid 128458164)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 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 S. Papadimitriou 2001 Berth allocation planning in the public berth system by genetic algorithms European Journal of Operational Research 131 2 282 292 10.1016/S0377-2217(00)00128-4 (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
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for Berth and Quay cranes
    • Y. M. Park K. H. Kim 2003 A scheduling method for berth and quay cranes OR Spectrum 25 1 1 23 10.1007/s00291-002-0109-z (Pubitemid 38260021)
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 20
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • 10.1007/s00291-007-0100-9
    • R. Stahlbock S. Voss 2008 Operations research at container terminals: A literature update OR Spectrum 30 1 1 52 10.1007/s00291-007-0100-9
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 1-52
    • Stahlbock, R.1    Voss, S.2


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