메뉴 건너뛰기




Volumn 58, Issue 1, 2010, Pages 40-50

The allocation of berths and quay cranes by using a sub-gradient optimization technique

Author keywords

Berth allocation; Container terminals; Crane scheduling; Lagrangian relaxation; Sub gradient

Indexed keywords

BERTH ALLOCATION; CONTAINER TERMINAL; CRANE SCHEDULING; LAGRANGIAN RELAXATION; MIXED INTEGER PROGRAMMING MODEL; QUAY CRANES; SUB-GRADIENT OPTIMIZATION;

EID: 72049127521     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.08.002     Document Type: Article
Times cited : (95)

References (26)
  • 2
    • 0036474954 scopus 로고    scopus 로고
    • Interblock crane deployment in container terminals
    • Cheung R.K., Li C.-L., and Lin W. Interblock crane deployment in container terminals. Transportation Science 36 1 (2002) 79-93
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 79-93
    • Cheung, R.K.1    Li, C.-L.2    Lin, W.3
  • 3
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 1 (1981) 1-18
    • (1981) Management Science , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 4
    • 0002554041 scopus 로고
    • Lagrangian relaxation for integer programming
    • Geoffrion A.M. Lagrangian relaxation for integer programming. Mathematical Programming Study 2 (1974) 82-114
    • (1974) Mathematical Programming Study , vol.2 , pp. 82-114
    • Geoffrion, A.M.1
  • 5
    • 0002662534 scopus 로고
    • Multistage cutting problems of two and more dimensions
    • Gilmore P.C., and Gomory R.E. Multistage cutting problems of two and more dimensions. Operations Research 13 1 (1965) 94-120
    • (1965) Operations Research , vol.13 , Issue.1 , pp. 94-120
    • Gilmore, P.C.1    Gomory, R.E.2
  • 9
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using a continuous location space approach
    • Imai A., Sun X., Nishimura E., and Papadimitriou S. Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B 39 3 (2005) 199-221
    • (2005) Transportation Research Part B , vol.39 , Issue.3 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 10
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • Kim K.H., and Moon K.C. Berth scheduling by simulated annealing. Transportation Research Part B 37 6 (2003) 541-560
    • (2003) Transportation Research Part B , vol.37 , Issue.6 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 11
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • Kim K.H., and Park Y.-M. A crane scheduling method for port container terminals. European Journal of Operational Research 156 3 (2004) 752-768
    • (2004) European Journal of Operational Research , vol.156 , Issue.3 , pp. 752-768
    • Kim, K.H.1    Park, Y.-M.2
  • 12
    • 34948884022 scopus 로고    scopus 로고
    • Quay crane scheduling with non-interference constraints in port container terminals
    • Lee D.-H., Wang H.Q., and Miao L. Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E 44 1 (2008) 124-135
    • (2008) Transportation Research Part E , vol.44 , Issue.1 , pp. 124-135
    • Lee, D.-H.1    Wang, H.Q.2    Miao, L.3
  • 13
    • 0035899774 scopus 로고    scopus 로고
    • Berth planning and resource optimisation at a container terminal via discrete event simulation
    • Legato P., and Mazza R.M. Berth planning and resource optimisation at a container terminal via discrete event simulation. European Journal of Operational Research 133 3 (2001) 537-547
    • (2001) European Journal of Operational Research , vol.133 , Issue.3 , pp. 537-547
    • Legato, P.1    Mazza, R.M.2
  • 14
    • 60549101050 scopus 로고    scopus 로고
    • A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    • Liang C., Huang Y., and Yang Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering 56 3 (2009) 1021-1028
    • (2009) Computers & Industrial Engineering , vol.56 , Issue.3 , pp. 1021-1028
    • Liang, C.1    Huang, Y.2    Yang, Y.3
  • 15
    • 33645678746 scopus 로고    scopus 로고
    • Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
    • Liu J., Wan Y.-w., and Wang L. Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Research Logistics 53 1 (2006) 60-74
    • (2006) Naval Research Logistics , vol.53 , Issue.1 , pp. 60-74
    • Liu, J.1    Wan, Y.-w.2    Wang, L.3
  • 16
    • 60449112191 scopus 로고    scopus 로고
    • The berth allocation problem: A strong formulation solved by a Lagrangian approach
    • Monaco M.F., and Sammarra M. The berth allocation problem: A strong formulation solved by a Lagrangian approach. Transportation Science 41 2 (2007) 265-280
    • (2007) Transportation Science , vol.41 , Issue.2 , pp. 265-280
    • Monaco, M.F.1    Sammarra, M.2
  • 17
    • 0036724291 scopus 로고    scopus 로고
    • Berth scheduling for container terminals by using a sub-gradient optimization technique
    • Park K.T., and Kim K.H. Berth scheduling for container terminals by using a sub-gradient optimization technique. The Journal of the Operational Research Society 53 9 (2002) 1054-1062
    • (2002) The Journal of the Operational Research Society , vol.53 , Issue.9 , pp. 1054-1062
    • Park, K.T.1    Kim, K.H.2
  • 18
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for berth and quay cranes
    • Park Y.-M., and Kim K.H. A scheduling method for berth and quay cranes. OR Spectrum 25 1 (2003) 1-23
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 20
    • 0008144821 scopus 로고
    • Generalized Lagrange multipliers in integer programming generalized Lagrange multipliers in integer programming
    • Shapiro J.F. Generalized Lagrange multipliers in integer programming generalized Lagrange multipliers in integer programming. Operations Research 19 1 (1971) 68-76
    • (1971) Operations Research , vol.19 , Issue.1 , pp. 68-76
    • Shapiro, J.F.1
  • 21
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - A classification and literature review
    • Steenken D., Vob S., and Stahlbock R. Container terminal operation and operations research - A classification and literature review. OR Spectrum 26 1 (2004) 3-49
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Vob, S.2    Stahlbock, R.3
  • 22
    • 0037449049 scopus 로고    scopus 로고
    • Transshipment of containers at a container terminal: An overview
    • Vis I.F.A., and de Koster R. Transshipment of containers at a container terminal: An overview. European Journal of Operational Research 147 1 (2003) 1-16
    • (2003) European Journal of Operational Research , vol.147 , Issue.1 , pp. 1-16
    • Vis, I.F.A.1    de Koster, R.2
  • 23
    • 33845684733 scopus 로고    scopus 로고
    • A stochastic beam search for the berth allocation problem
    • Wang F., and Lim A. A stochastic beam search for the berth allocation problem. Decision Support Systems 42 4 (2007) 2186-2196
    • (2007) Decision Support Systems , vol.42 , Issue.4 , pp. 2186-2196
    • Wang, F.1    Lim, A.2
  • 24
    • 40849140755 scopus 로고    scopus 로고
    • A new model and hybrid approach for large scale inventory routing problems
    • Yu Y., Chen H., and Chu F. A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research 189 3 (2008) 1022-1040
    • (2008) European Journal of Operational Research , vol.189 , Issue.3 , pp. 1022-1040
    • Yu, Y.1    Chen, H.2    Chu, F.3


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