메뉴 건너뛰기




Volumn 22, Issue , 2014, Pages 60-76

Biased random key genetic algorithm for the Tactical Berth Allocation Problem

Author keywords

Berth allocation; Biased random keys; Container terminal; Genetic algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; GENETIC ALGORITHMS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS; SHIPS; TRANSFER CASES (VEHICLES);

EID: 84901685041     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.04.035     Document Type: Article
Times cited : (69)

References (41)
  • 2
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • J.C. Bean Genetic algorithms and random keys for sequencing and optimization RSA J. Comput. 6 1994 154 160
    • (1994) RSA J. Comput. , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 3
    • 60649084632 scopus 로고    scopus 로고
    • Measuring and increasing the productivity model on maritime container terminals
    • B. Beškovnik Measuring and increasing the productivity model on maritime container terminals Pomorstvo 22 2 2008 171 183
    • (2008) Pomorstvo , vol.22 , Issue.2 , pp. 171-183
    • Beškovnik, B.1
  • 4
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • C. Bierwirth, and F. Meisel A survey of berth allocation and quay crane scheduling problems in container terminals Eur. J. Oper. Res. 202 3 2010 615 627
    • (2010) Eur. J. Oper. Res. , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 5
    • 77958474679 scopus 로고    scopus 로고
    • Multi-objective and prioritized berth allocation in container ports
    • C. Cheong, K. Tan, D. Liu, and C. Lin Multi-objective and prioritized berth allocation in container ports Ann. Oper. Res. 180 2010 63 103
    • (2010) Ann. Oper. Res. , vol.180 , pp. 63-103
    • Cheong, C.1    Tan, K.2    Liu, D.3    Lin, C.4
  • 6
    • 33749565621 scopus 로고    scopus 로고
    • The service allocation problem at the Gioia Tauro Maritime Terminal
    • DOI 10.1016/j.ejor.2005.09.004, PII S037722170500682X
    • J.-F. Cordeau, M. Gaudioso, G. Laporte, and L. Moccia The service allocation problem at the gioia tauro maritime terminal Eur. J. Oper. Res. 176 2 2007 1167 1184 (Pubitemid 44537604)
    • (2007) European Journal of Operational Research , vol.176 , Issue.2 , pp. 1167-1184
    • Cordeau, J.-F.1    Gaudioso, M.2    Laporte, G.3    Moccia, L.4
  • 7
    • 28244441388 scopus 로고    scopus 로고
    • Models and tabu search heuristics for the berth-allocation problem
    • DOI 10.1287/trsc.1050.0120
    • J.F. Cordeau, G. Laporte, P. Legato, and L. Moccia Models and tabu search heuristics for the berth-allocation problem Transport. Sci. 39 2005 526 538 (Pubitemid 41706012)
    • (2005) Transportation Science , vol.39 , Issue.4 , pp. 526-538
    • Cordeau, J.-F.1    Laporte, G.2    Legato, P.3    Moccia, L.4
  • 13
  • 14
    • 80053565704 scopus 로고    scopus 로고
    • Biased random-key genetic algorithms for combinatorial optimization
    • J.F. Gonçalves, and M. Resende Biased random-key genetic algorithms for combinatorial optimization J. Heuristics 17 2011 487 525
    • (2011) J. Heuristics , vol.17 , pp. 487-525
    • Gonçalves, J.F.1    Resende, M.2
  • 15
    • 33748661290 scopus 로고    scopus 로고
    • Container terminals and terminal operations
    • DOI 10.1007/s00291-006-0059-y
    • H.-O. Günter, and K.-H. Kim Container terminals and terminal operations OR Spectrum 28 2006 437 445 (Pubitemid 44386725)
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 437-445
    • Gunther, H.-O.1    Kim, K.-H.2
  • 16
    • 44649179214 scopus 로고    scopus 로고
    • Variable neighborhood search for minimum cost berth allocation
    • DOI 10.1016/j.ejor.2006.12.057, PII S0377221707001221
    • P. Hansen, C. Oguz, and N. Mladenovic Variable neighborhood search for minimum cost berth allocation Eur. J. Oper. Res. 191 3 2008 636 649 (Pubitemid 351778608)
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 636-649
    • Hansen, P.1    Oguz, C.2    Mladenovic, N.3
  • 19
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K. Nagaiwa, and C.W. Tat Efficient planning of berth allocation for container terminals in Asia J. Adv. Transport. 31 1 1997 75 94 (Pubitemid 127603112)
    • (1997) Journal of Advanced Transportation , vol.31 , Issue.1 , pp. 75-94
    • Imai, A.1    Nagaiwa, K.2    Tat, C.W.3
  • 20
    • 0035324677 scopus 로고    scopus 로고
    • The dynamic berth allocation problem for a container port
    • A. Imai, E. Nishimura, and S. Papadimitriou The dynamic berth allocation problem for a container port Transp. Res. B: Meth. 35 4 2001 401 417
    • (2001) Transp. Res. B: Meth. , vol.35 , Issue.4 , pp. 401-417
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 22
    • 84864763674 scopus 로고    scopus 로고
    • Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem
    • E. Lalla-Ruiz, B. Melián-Batista, and J. Moreno-Vega Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem Eng. Appl. Artif. Intel. 25 6 2012 1132 1141
    • (2012) Eng. Appl. Artif. Intel. , vol.25 , Issue.6 , pp. 1132-1141
    • Lalla-Ruiz, E.1    Melián-Batista, B.2    Moreno-Vega, J.3
  • 23
    • 60549101050 scopus 로고    scopus 로고
    • A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    • (Intelligent Manufacturing and Logistics)
    • C. Liang, Y. Huang, and Y. Yang A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning Comput. Ind. Eng. 56 3 2009 1021 1028 (Intelligent Manufacturing and Logistics)
    • (2009) Comput. Ind. Eng. , vol.56 , Issue.3 , pp. 1021-1028
    • Liang, C.1    Huang, Y.2    Yang, Y.3
  • 24
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • PII S0167637798000108
    • A. Lim The berth planning problem Oper. Res. Lett. 22 23 1998 105 110 (Pubitemid 128458164)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 25
    • 60449112191 scopus 로고    scopus 로고
    • Berth allocation problem: A strong formulation solved by a lagrangean approach
    • M. Monaco, and M. Sammarra Berth allocation problem: a strong formulation solved by a lagrangean approach Transport. Sci. 41 2 2007 265 280
    • (2007) Transport. Sci. , vol.41 , Issue.2 , pp. 265-280
    • Monaco, M.1    Sammarra, M.2
  • 26
    • 33748672706 scopus 로고    scopus 로고
    • Berth management in container terminal: The template design problem
    • DOI 10.1007/s00291-006-0036-5
    • R. Moorthy, and C.-P. Teo Berth management in container terminal: the template design problem OR Spectrum 28 4 2006 495 518 (Pubitemid 44386728)
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.-P.2
  • 27
    • 10644255568 scopus 로고    scopus 로고
    • A decision support system for operations in a container terminal
    • K.G. Murty, J. Liu, Y. wah Wan, and R. Linn A decision support system for operations in a container terminal Decis. Support Syst. 39 3 2005 309 332
    • (2005) Decis. Support Syst. , vol.39 , Issue.3 , pp. 309-332
    • Murty, K.G.1    Liu, J.2    Wah Wan, Y.3    Linn, R.4
  • 28
    • 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, and S. Papadimitriou Berth allocation planning in the public berth system by genetic algorithms Eur. J. Oper. Res. 131 2 2001 282 292 (Artificial Intelligence on Transportation Systems and Science). (Pubitemid 32271744)
    • (2001) European Journal of Operational Research , vol.131 , Issue.2 , pp. 282-292
    • Nishimura, E.1    Imai, A.2    Papadimitriou, S.3
  • 31
    • 0036724291 scopus 로고    scopus 로고
    • Berth scheduling for container terminals by using a sub-gradient optimization technique
    • DOI 10.1057/palgrave.jors.2601412
    • K. Park, and K. Kim Berth scheduling for container terminals by using a sub-gradient optimization technique J. Oper. Res. Soc. 53 9 2002 1054 1062 cited By (since 1996) 37 (Pubitemid 34964231)
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.9 , pp. 1054-1062
    • Park, K.T.1    Kim, K.H.2
  • 33
    • 79960006751 scopus 로고    scopus 로고
    • An enriched model for the integrated berth allocation and quay crane assignment problem
    • B. Raa, W. Dullaert, and R.V. Schaeren An enriched model for the integrated berth allocation and quay crane assignment problem Expert Syst. Appl. 38 11 2011 14136 14147
    • (2011) Expert Syst. Appl. , vol.38 , Issue.11 , pp. 14136-14147
    • Raa, B.1    Dullaert, W.2    Schaeren, R.V.3
  • 35
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Vo B Operations research at container terminals: a literature update OR Spectrum 30 2008 1 52
    • (2008) OR Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Vo, B.S.2
  • 36
    • 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 B, and R. Stahlbock Container terminal operation and operations research - a classification and literature review OR 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
  • 38
    • 84877952268 scopus 로고    scopus 로고
    • An exact algorithm for the integrated planning of berth allocation and quay crane assignment
    • I. Vacca, M. Salani, and M. Bierlaire An exact algorithm for the integrated planning of berth allocation and quay crane assignment Transport. Sci. 47 2 2013 148 161
    • (2013) Transport. Sci. , vol.47 , Issue.2 , pp. 148-161
    • Vacca, I.1    Salani, M.2    Bierlaire, M.3
  • 39
    • 0037449049 scopus 로고    scopus 로고
    • Transshipment of containers at a container terminal: An overview
    • I.F. Vis, and R. de Koster Transshipment of containers at a container terminal: an overview Eur. J. Oper. Res. 147 1 2003 1 16
    • (2003) Eur. J. Oper. Res. , vol.147 , Issue.1 , pp. 1-16
    • Vis, I.F.1    De Koster, R.2
  • 40
    • 33845684733 scopus 로고    scopus 로고
    • A stochastic beam search for the berth allocation problem
    • DOI 10.1016/j.dss.2006.06.008, PII S016792360600090X, Decision Support Systems in Emerging Economies
    • F. Wang, and A. Lim A stochastic beam search for the berth allocation problem Decis. Support Syst. 42 4 2007 2186 2196 (Pubitemid 44969944)
    • (2007) Decision Support Systems , vol.42 , Issue.4 , pp. 2186-2196
    • Wang, F.1    Lim, A.2
  • 41
    • 72049127521 scopus 로고    scopus 로고
    • The allocation of berths and quay cranes by using a sub-gradient optimization technique
    • C. Zhang, L. Zheng, Z. Zhang, L. Shi, and A.J. Armstrong The allocation of berths and quay cranes by using a sub-gradient optimization technique Comput. Ind. Eng. 58 1 2010 40 50
    • (2010) Comput. Ind. Eng. , vol.58 , Issue.1 , pp. 40-50
    • Zhang, C.1    Zheng, L.2    Zhang, Z.3    Shi, L.4    Armstrong, A.J.5


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