메뉴 건너뛰기




Volumn 52, Issue 4, 2013, Pages 671-677

A heuristics-based solution to the continuous berth allocation and crane assignment problem

Author keywords

Berth Allocation Problem (BAP); Container Terminal (CT); Quay Crane Assignment Problem (QCAP); Simulated Annealing (SA)

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CRANES; HEURISTIC METHODS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS; SIMULATED ANNEALING; TRANSFER CASES (VEHICLES);

EID: 84889665791     PISSN: 11100168     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aej.2013.09.001     Document Type: Article
Times cited : (32)

References (11)
  • 1
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • Christian Bierwirth, and Frank Meisel A survey of berth allocation and quay crane scheduling problems in container terminals European Journal of Operational Research 2010 615 627
    • (2010) European Journal of Operational Research , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 3
    • 33751395932 scopus 로고    scopus 로고
    • Berth allocation at indented berths for mega-containerships
    • DOI 10.1016/j.ejor.2006.03.034, PII S0377221706001913
    • Akio Imai, Etsuko Nishimura, Masahiro Hattori, and Stratos Papadimitriou Berth allocation at indented berths for mega-containerships European Journal of Operational Research 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
  • 6
    • 0035372166 scopus 로고    scopus 로고
    • Berth allocation planning in the public berth system by genetic algorithms
    • DOI 10.1016/S0377-2217(00)00128-4, PII S0377221700001284
    • Etsuko Nishimura, Akio Imai, and Stratos 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
  • 7
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for Berth and Quay cranes
    • Young-Man Park, and Kap Hwan 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
  • 8
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • DOI 10.1016/S0191-2615(02)00027-9
    • Kap Hwan Kim, and Kyung Chan Moon Berth scheduling by simulated annealing Transportation Research Part B 37 2003 541 560 (Pubitemid 36580172)
    • (2003) Transportation Research Part B: Methodological , vol.37 , Issue.6 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 9
    • 57149135986 scopus 로고    scopus 로고
    • Heuristics for the integration of crane productivity in the berth allocation problem
    • Frank. Meisel, and Christian. Bierwirth Heuristics for the integration of crane productivity in the 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


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