메뉴 건너뛰기




Volumn 29, Issue , 2012, Pages 63-74

A decision support system for managing combinatorial problems in container terminals

Author keywords

Artificial intelligence; Berth allocation problem; Container Stacking Problem; Decision support system; Metaheuristic techniques; Quay Crane Assignment Problem

Indexed keywords

ANALYTICAL FORMULAS; ASSIGNMENT PROBLEMS; BERTH ALLOCATION PROBLEM; CARGO CONTAINERS; COMBINATORIAL PROBLEM; CONTAINER TERMINAL; CONTAINER YARD; DECISION SUPPORTS; LAND VEHICLES; MARITIME CONTAINER TERMINAL; META-HEURISTIC TECHNIQUES; QUAY CRANES; TERMINAL OPERATORS; TRANSPORT VEHICLES;

EID: 84857369955     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2011.06.021     Document Type: Conference Paper
Times cited : (47)

References (34)
  • 1
    • 84857359334 scopus 로고    scopus 로고
    • Global container terminal operators annual review and forecast
    • Global container terminal operators annual review and forecast, Annual Report, 2010.
    • (2010) Annual Report
  • 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
  • 4
    • 0002840481 scopus 로고    scopus 로고
    • Simulation and Genetic Algorithms for Ship Planning and Shipyard Layout
    • A. Bruzzone, and R. Signorile Simulation and genetic algorithms for ship planning and shipyard layout Simulation 71 1998 74 83 (Pubitemid 128493594)
    • (1998) Simulation , vol.71 , Issue.2 , pp. 74-83
    • Bruzzone, A.1    Signorile, R.2
  • 5
    • 70449529547 scopus 로고    scopus 로고
    • Forecasting container throughputs at ports using genetic programming
    • S.H. Chen, and J.N. Chen Forecasting container throughputs at ports using genetic programming Expert Systems with Applications 37 3 2010 2054 2058
    • (2010) Expert Systems with Applications , vol.37 , Issue.3 , pp. 2054-2058
    • Chen, S.H.1    Chen, J.N.2
  • 8
    • 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 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
  • 10
    • 0000538138 scopus 로고    scopus 로고
    • Simulation and Planning of an Intermodal Container Terminal
    • L.M. Gambardella, A.E. Rizzoli, and M. Zaffalon Simulation and planning of an intermodal container terminal Simulation 71 1998 107 116 (Pubitemid 128493597)
    • (1998) Simulation , vol.71 , Issue.2 , pp. 107-116
    • Gambardella, L.M.1    Rizzoli, A.E.2    Zaffalon, M.3
  • 13
    • 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 1 2004 75 92 (Pubitemid 40549580)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 75-92
    • Guan, Y.1    Cheung, R.K.2
  • 14
    • 77958011560 scopus 로고    scopus 로고
    • Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
    • C. Gutiérrez, and I. García-Magariño Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem Knowledge-Based Systems 24 1 2011 102 112
    • (2011) Knowledge-Based Systems , vol.24 , Issue.1 , pp. 102-112
    • Gutiérrez, C.1    García-Magariño, I.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. Ceyda Oguz, 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
  • 17
    • 79251516823 scopus 로고    scopus 로고
    • Overview of transshipment operations and simulation
    • Malta, April
    • L. Henesey, overview of transshipment operations and simulation, in: MedTrade Conference, Malta, April 2006, pp. 6-7.
    • (2006) MedTrade Conference , pp. 6-7
    • Henesey, L.1
  • 18
    • 13444301819 scopus 로고    scopus 로고
    • The metric-ff planning system: Translating ignoring delete lists to numeric state variables
    • Jörg Hoffmann The metric-ff planning system: translating ignoring delete lists to numeric state variables Journal of Artificial Intelligence Research 20 1 2003 291 341
    • (2003) Journal of Artificial Intelligence Research , vol.20 , Issue.1 , pp. 291-341
    • Hoffmann, Jö.1
  • 19
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K.I. Nagaiwa, and Chan Weng Tat Efficient planning of berth allocation for container terminals in Asia Journal of Advanced Transportation 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
    • 27144527849 scopus 로고    scopus 로고
    • A heuristic rule for relocating blocks
    • DOI 10.1016/j.cor.2004.08.005, PII S0305054804001959, Part Special Issue: Optimization Days 2003
    • K.H. Kim, and G.P. Hong A heuristic rule for relocating blocks Computers and Operations Research 33 4 2006 940 954 (Pubitemid 41492058)
    • (2006) Computers and Operations Research , vol.33 , Issue.4 , pp. 940-954
    • Kim, K.H.1    Hong, G.-P.2
  • 22
    • 34047098303 scopus 로고    scopus 로고
    • An optimization model for the container pre-marshalling problem
    • DOI 10.1016/j.cor.2005.12.006, PII S030505480500403X
    • Yusin Lee, and Nai-Yun Hsu An optimization model for the container pre-marshalling problem Computers and Operations Research 34 11 2007 3295 3313 (Pubitemid 46517858)
    • (2007) Computers and Operations Research , vol.34 , Issue.11 , pp. 3295-3313
    • Lee, Y.1    Hsu, N.-Y.2
  • 24
    • 33847157512 scopus 로고    scopus 로고
    • On-line monitoring of plan execution: A distributed approach
    • DOI 10.1016/j.knosys.2006.11.010, PII S0950705106002036, AI 2006
    • R. Micalizio, and P. Torasso On-line monitoring of plan execution: a distributed approach Knowledge-Based Systems 20 2 2007 134 142 (Pubitemid 46282458)
    • (2007) Knowledge-Based Systems , vol.20 , Issue.2 , pp. 134-142
    • Micalizio, R.1    Torasso, P.2
  • 25
    • 75849165458 scopus 로고    scopus 로고
    • Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan
    • B. Naderi, R. Tavakkoli-Moghaddam, and M. Khalili Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan Knowledge-Based Systems 23 2 2010 77 85
    • (2010) Knowledge-Based Systems , vol.23 , Issue.2 , pp. 77-85
    • Naderi, B.1    Tavakkoli-Moghaddam, R.2    Khalili, M.3
  • 26
    • 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
  • 27
    • 72949118507 scopus 로고    scopus 로고
    • Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms
    • ACM
    • K. Park, T. Park, and K.R. Ryu Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms Proceedings of the 2009 ACM Symposium on Applied Computing 2009 ACM 1098 1105
    • (2009) Proceedings of the 2009 ACM Symposium on Applied Computing , pp. 1098-1105
    • Park, K.1    Park, T.2    Ryu, K.R.3
  • 30
    • 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


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