메뉴 건너뛰기




Volumn 25, Issue 6, 2012, Pages 1132-1141

Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem

Author keywords

Artificial intelligence; Berth allocation; Path relinking; Port logistics; Tabu search

Indexed keywords

BERTH ALLOCATION; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL TIME; DYNAMIC BERTH ALLOCATION; HYBRID ALGORITHMS; HYBRID HEURISTICS; METAHEURISTIC; OPTIMAL SOLUTIONS; OPTIMAL VALUES; OPTIMALITY; PATH RELINKING; PORT LOGISTICS; PROBLEM SIZE; TABU SEARCH ALGORITHMS;

EID: 84864763674     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2012.06.001     Document Type: Article
Times cited : (74)

References (24)
  • 1
    • 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
  • 2
    • 79952042407 scopus 로고    scopus 로고
    • Models for the discrete berth allocation problem: A computational comparison
    • K. Buhrkal, S. Zuglian, S. Ropke, J. Larsen, and R. Lusby Models for the discrete berth allocation problem: a computational comparison Transp. Res. E 47 4 2011 461 473
    • (2011) Transp. Res. e , vol.47 , Issue.4 , pp. 461-473
    • Buhrkal, K.1    Zuglian, S.2    Ropke, S.3    Larsen, J.4    Lusby, R.5
  • 3
    • 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 Transpor. Sci. 39 4 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
  • 5
    • 84864773583 scopus 로고    scopus 로고
    • ENO Transportation Foundation
    • ENO Transportation Foundation. 〈 http://www.enotrans.com/ 〉.
  • 8
    • 0347899800 scopus 로고    scopus 로고
    • Fundamentals of scatter search and path relinking
    • F. Glover, M. Laguna, and R. Martí Fundamentals of scatter search and path relinking Control Cybern. 39 3 2000 653 684
    • (2000) Control Cybern. , vol.39 , Issue.3 , pp. 653-684
    • Glover, F.1    Laguna, M.2    Martí, R.3
  • 9
    • 44649179214 scopus 로고    scopus 로고
    • Variable neighborhood search for minimum cost berth allocation
    • DOI 10.1016/j.ejor.2006.12.057, PII S0377221707001221
    • P. Hansen, C. Oģuz, and N. Mladenović 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
  • 12
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K. Nagaiwa, and W.T. Chan Efficient planning of berth allocation for container terminals in asia J. Adv. Transp. 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
  • 13
    • 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 Methodol. 35 4 2001 401 407
    • (2001) Transp. Res. B Methodol. , vol.35 , Issue.4 , pp. 401-407
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 16
    • 58149231340 scopus 로고    scopus 로고
    • An optimization heuristic for the berth scheduling problem
    • Y. Lee, and C.-Y. Chen An optimization heuristic for the berth scheduling problem Eur. J. Oper. Res. 196 2 2009 500 508
    • (2009) Eur. J. Oper. Res. , vol.196 , Issue.2 , pp. 500-508
    • Lee, Y.1    Chen, C.-Y.2
  • 17
    • 60549101050 scopus 로고    scopus 로고
    • A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    • 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
    • (2009) Comput. Ind. Eng. , vol.56 , Issue.3 , pp. 1021-1028
    • Liang, C.1    Huang, Y.2    Yang, Y.3
  • 18
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • A. Lim The berth planning problem Oper. Res. Lett. 22 2-3 1998 100 105
    • (1998) Oper. Res. Lett. , vol.22 , Issue.23 , pp. 100-105
    • Lim, A.1
  • 19
    • 60449112191 scopus 로고    scopus 로고
    • The berth allocation problem: A strong formulation solved by a Lagrangean approach
    • M.F. Monaco, and M. Sammarra The berth allocation problem: a strong formulation solved by a Lagrangean approach Transpor. Sci. 41 2 2007 265 280
    • (2007) Transpor. Sci. , vol.41 , Issue.2 , pp. 265-280
    • Monaco, M.F.1    Sammarra, M.2
  • 20
    • 80855123529 scopus 로고    scopus 로고
    • A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem
    • V.-P. Nguyen, C. Prins, and C. Prodhon A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem Eng. Appl. Artif. Intell. 25 1 2012 56 71
    • (2012) Eng. Appl. Artif. Intell. , vol.25 , Issue.1 , pp. 56-71
    • Nguyen, V.-P.1    Prins, C.2    Prodhon, C.3
  • 21
    • 84864744309 scopus 로고    scopus 로고
    • Berthing ships at a multi-user container terminal with a limited quay capacity
    • V.M.D. Silva, A.S. Coelho, and S.F. Mayerle Berthing ships at a multi-user container terminal with a limited quay capacity Investigaç ão Oper. 26 2008 31 43
    • (2008) Investigação Oper. , vol.26 , pp. 31-43
    • Silva, V.M.D.1    Coelho, A.S.2    Mayerle, S.F.3
  • 22
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Voß Operations research at container terminals: a literature update OR Spectrum 30 1 2008 1 52
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 23
    • 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ß, and R. Stahlbock Container terminal operation and operations research - a classification and literature review OR Spectrum 26 1 2004 3 49 (Pubitemid 40549578)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 24
    • 0037449049 scopus 로고    scopus 로고
    • Transshipment of containers at a container terminal: An overview
    • I.F.A. 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.A.1    De Koster, R.2


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