메뉴 건너뛰기




Volumn 41, Issue 4 PART 1, 2014, Pages 1543-1550

Particle swarm optimization algorithm for the berth allocation problem

Author keywords

Berth allocation problem; Container port; Logistics; Particle swarm optimization

Indexed keywords

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; CONTAINER PORTS; DYNAMIC BERTH ALLOCATION; MIXED INTEGER PROGRAMMING MODEL; OPTIMIZATION PROBLEMS; PARTICLE SWARM OPTIMIZATION ALGORITHM; SOLUTION QUALITY;

EID: 84888389720     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2013.08.051     Document Type: Article
Times cited : (146)

References (56)
  • 1
    • 59349116768 scopus 로고    scopus 로고
    • Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem
    • T.J. Ai, and V. Kachitvichyanukul Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem Computers & Industrial Engineering 56 2009 380 387
    • (2009) Computers & Industrial Engineering , vol.56 , pp. 380-387
    • Ai, T.J.1    Kachitvichyanukul, V.2
  • 3
    • 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 European Journal of Operational Research 202 2010 615 627
    • (2010) European Journal of Operational Research , vol.202 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 7
    • 69249212363 scopus 로고    scopus 로고
    • A modified particle swarm optimization for production planning problems in the TFT Array process
    • Y.Y. Chen, and J.T. Lin A modified particle swarm optimization for production planning problems in the TFT Array process Expert Systems with Applications 36 2009 12264 12271
    • (2009) Expert Systems with Applications , vol.36 , pp. 12264-12271
    • Chen, Y.Y.1    Lin, J.T.2
  • 8
    • 44649109639 scopus 로고    scopus 로고
    • A multi-objective multi-colony ant algorithm for solving the berth allocation problem
    • Y. Liu, A. Sun, H.T. Loh, W.F. Lu, E.P. Lim, Springer-Verlag Berlin
    • C.Y. Cheong, and K.C. Tan A multi-objective multi-colony ant algorithm for solving the berth allocation problem Y. Liu, A. Sun, H.T. Loh, W.F. Lu, E.P. Lim, Advances of Computational Intelligence in Industrial Systems 2008 Springer-Verlag Berlin 333 350
    • (2008) Advances of Computational Intelligence in Industrial Systems , pp. 333-350
    • Cheong, C.Y.1    Tan, K.C.2
  • 9
  • 10
    • 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 Transportation Science 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
  • 11
  • 15
    • 17444376768 scopus 로고    scopus 로고
    • The berth allocation problem: Models and solution methods
    • DOI 10.1007/s00291-003-0140-8
    • Y. Guan, and R.K. Cheung The berth allocation problem: Models and solution methods OR Spectrum 26 2004 75 92 (Pubitemid 40549580)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 75-92
    • Guan, Y.1    Cheung, R.K.2
  • 16
    • 0036794414 scopus 로고    scopus 로고
    • A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
    • DOI 10.1016/S0167-6377(02)00147-5, PII S0167637702001475
    • Y. Guan, W.Q. Xiao, R.K. Cheung, and C.L. Li A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis Operations Research Letters 30 2002 343 350 (Pubitemid 35167682)
    • (2002) Operations Research Letters , vol.30 , Issue.5 , pp. 343-350
    • Guan, Y.1    Xiao, W.-Q.2    Cheung, R.K.3    Li, C.-L.4
  • 17
    • 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. Mladenovic Variable neighborhood search for minimum cost berth allocation European Journal of Operational Research 191 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
  • 18
    • 84901470581 scopus 로고    scopus 로고
    • Multiobjective optimization using dynamic neighborhood particle swarm optimization
    • Honolulu, USA
    • Hu, X. & Eberhart, R. (2002). Multiobjective optimization using dynamic neighborhood particle swarm optimization. In Proceedings of the Congress on Evolutionary Computation, Honolulu, USA (pp. 1677-1681).
    • (2002) Proceedings of the Congress on Evolutionary Computation , pp. 1677-1681
    • Hu, X.1    Eberhart, R.2
  • 19
    • 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 Journal of Advanced Transportation 31 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
  • 22
    • 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, and S. Papadimitriou Berth allocation at indented berths for mega-containerships European Journal of Operational Research 179 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
  • 24
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using a continuous location space approach
    • DOI 10.1016/j.trb.2004.04.004, PII S0191261504000505
    • A. Imai, X. Sun, E. Nishimura, and S. Papadimitriou Berth allocation in a container port: Using a continuous location space approach Transportation Research Part B: Methodological 39 2005 199 221 (Pubitemid 40058678)
    • (2005) Transportation Research Part B: Methodological , vol.39 , Issue.3 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 27
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • DOI 10.1016/S0191-2615(02)00027-9
    • K.H. Kim, and K.C. Moon Berth scheduling by simulated annealing Transportation Research Part B: Methodological 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
  • 30
    • 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 European Journal of Operational Research 196 2009 500 508
    • (2009) European Journal of Operational Research , vol.196 , pp. 500-508
    • Lee, Y.1    Chen, C.Y.2
  • 32
    • 33847609606 scopus 로고    scopus 로고
    • A discrete version of particle swarm optimization for flowshop scheduling problems
    • DOI 10.1016/j.cor.2005.11.017, PII S0305054805003643
    • C.J. Liao, C.T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flowshop scheduling problems Computers & Operations Research 34 2007 3099 3111 (Pubitemid 46356739)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 3099-3111
    • Liao, C.-J.1    Chao-Tang Tseng2    Luarn, P.3
  • 33
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • PII S0167637798000108
    • A. Lim The berth planning problem Operations Research Letters 22 1998 105 110 (Pubitemid 128458164)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 34
    • 80053580515 scopus 로고    scopus 로고
    • A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance
    • C.Y. Low, C.J. Hsu, and C.T. Su A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance Expert Systems with Applications 37 2010 6429 6434
    • (2010) Expert Systems with Applications , vol.37 , pp. 6429-6434
    • Low, C.Y.1    Hsu, C.J.2    Su, C.T.3
  • 37
    • 79955633708 scopus 로고    scopus 로고
    • A particle swarm optimization algorithm for open vehicle routing problem
    • S.A. MirHassani, and N. Abolghasemi A particle swarm optimization algorithm for open vehicle routing problem Expert Systems with Applications 38 2011 11547 11551
    • (2011) Expert Systems with Applications , vol.38 , pp. 11547-11551
    • Mirhassani, S.A.1    Abolghasemi, N.2
  • 38
    • 60449112191 scopus 로고    scopus 로고
    • The berth allocation problem: A strong formulation solved by a Lagrangian approach
    • M.F. Monaco, and M. Sammarra The berth allocation problem: A strong formulation solved by a Lagrangian approach Transportation Science 41 2007 265 280
    • (2007) Transportation Science , vol.41 , pp. 265-280
    • Monaco, M.F.1    Sammarra, M.2
  • 39
    • 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 2006 495 518 (Pubitemid 44386728)
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.-P.2
  • 40
    • 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 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
  • 41
    • 0036724291 scopus 로고    scopus 로고
    • Berth scheduling for container terminals by using a sub-gradient optimization technique
    • DOI 10.1057/palgrave.jors.2601412
    • K.T. Park, and K.H. Kim Berth scheduling for container terminals by using a subgradient optimization technique Journal of the Operational Research Society 53 2002 1054 1062 (Pubitemid 34964231)
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.9 , pp. 1054-1062
    • Park, K.T.1    Kim, K.H.2
  • 42
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for Berth and Quay cranes
    • Y.M. Park, and K.H. 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
  • 44
    • 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 2008 1 52
    • (2008) OR Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 45
    • 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 2004 3 49 (Pubitemid 40549578)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 46
    • 85007330944 scopus 로고    scopus 로고
    • Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
    • L. Tang, S. Li, and J. Liu Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex International Transactions in Operational Research 16 2009 87 107
    • (2009) International Transactions in Operational Research , vol.16 , pp. 87-107
    • Tang, L.1    Li, S.2    Liu, J.3
  • 47
    • 84855878217 scopus 로고    scopus 로고
    • Solving effectively the school timetabling problem using particle swarm optimization
    • I.X. Tassopoulos, and G.N. Beligiannis Solving effectively the school timetabling problem using particle swarm optimization Expert Systems with Applications 39 2012 6029 6040
    • (2012) Expert Systems with Applications , vol.39 , pp. 6029-6040
    • Tassopoulos, I.X.1    Beligiannis, G.N.2
  • 49
    • 4143122888 scopus 로고
    • Master's thesis, Operations Research, Naval Postgraduate School, Monterey, California - EUA
    • Thurman, K. P. (1989). Optimal ship berthing plans. Master's thesis, Operations Research, Naval Postgraduate School, Monterey, California - EUA.
    • (1989) Optimal Ship Berthing Plans
    • Thurman, K.P.1
  • 50
    • 84862564506 scopus 로고    scopus 로고
    • The use of particle swarm optimization for order allocation under multiple capacitated sourcing and quantity discounts
    • C.J. Ting, C.Y. Tsai, and L.W. Yeh The use of particle swarm optimization for order allocation under multiple capacitated sourcing and quantity discounts Industrial Engineering and Management Systems 6 2007 136 145
    • (2007) Industrial Engineering and Management Systems , vol.6 , pp. 136-145
    • Ting, C.J.1    Tsai, C.Y.2    Yeh, L.W.3
  • 51
  • 52
    • 79951581631 scopus 로고    scopus 로고
    • Particle swarm optimization with selective particle regeneration for data clustering
    • C.Y. Tsai, and I.W. Kao Particle swarm optimization with selective particle regeneration for data clustering Expert Systems with Applications 38 2011 6565 6576
    • (2011) Expert Systems with Applications , vol.38 , pp. 6565-6576
    • Tsai, C.Y.1    Kao, I.W.2
  • 55
    • 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 Decision Support Systems 42 2007 2186 2196 (Pubitemid 44969944)
    • (2007) Decision Support Systems , vol.42 , Issue.4 , pp. 2186-2196
    • Wang, F.1    Lim, A.2


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