nach oben

Erschienen in:

2020 | OriginalPaper | Buchkapitel

16. Container Rehandling at Maritime Container Terminals: A Literature Update

verfasst von : Marco Caserta, Silvia Schwarze, Stefan Voß

Erschienen in: Handbook of Terminal Planning

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This chapter provides an updated survey on rehandling of containers at maritime container terminals. In particular, we review contributions with a particular focus on post-stacking situations, i.e., problems arising after the stacking area has already been arranged. Three types of post-stacking problems have been identified, namely (1) the re-marshalling problem, (2) the pre-marshalling problem, and (3) the relocation problem. This research area has received an increasing attention since the first version of this contribution appeared in 2011. Within this update, we discuss recent developments presented in literature. In particular, available solution approaches from the fields of exact and (meta-)heuristic methods are given and benchmark datasets are summarized. Moreover, an overview on extensions of post-stacking problems and according solution methods are discussed.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Raising Efficiency of Straddle Carrier Operations by Twin Container Handling

Nächstes Kapitel State-of-the-Art Yard Crane Scheduling and Stacking

In Table 16.1 and Fig. 16.1, a single paper being published in 2017 (see Wang et al. 2017) is assigned to 2016, the year of the online-first publication.

See Table 16.3 for the source of the benchmark and a description of the same.

See Table 16.3 for a description of this benchmark set.

See Table 16.1 from which 17 references address extensions of the BRP.

Akyüz M, Lee CY (2014) A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Nav Res Logist 61(2):101–118

Ayachi I, Kammarti R, Ksouri M, Borne P (2013) A heuristic for re-marshalling unbound and outbound containers. In: 2013 2nd International Conference on Systems and Computer Science (ICSCS), pp 291–296

Borgman B, van Asperen E, Dekker R (2010) Online rules for container stacking. OR Spectrum 32:687–716

Borjian S, Manshadi V, Barnhart C, Jaillet P (2013) Dynamic stochastic optimization of relocations in container terminals. Technical report, MIT working paper

Borjian S, Galle V, Manshadi VH, Barnhart C, Jaillet P (2015) Container relocation problem: approximation, asymptotic, and incomplete information. arXiv:1505.04229. https://arxiv.org/abs/1505.04229

Bortfeldt A, Forster F (2012) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217(3):531–540

Bruns F, Knust S, Shakhlevich NV (2016) Complexity results for storage loading problems with stacking constraints. Eur J Oper Res 249:1074–1081

Carlo H, Vis I, Roodbergen K (2014) Storage yard operations in container terminals: literature overview, trends, and research directions. Eur J Oper Res 235(2):412–430

Caserta M, Voß S (2009a) A cooperative strategy for guiding the corridor method. In: Nature inspired cooperative strategies for optimization (NICSO 2008). Springer, Berlin, pp 273–286

Caserta M, Voß S (2009b) A corridor method-based algorithm for the pre-marshalling problem. Lect Notes Comput Sci 5484:788–797

Caserta M, Voß S (2009c) Corridor selection and fine tuning for the corridor method. Lect Notes Comput Sci 5851:163–175

Caserta M, Schwarze S, Voß S (2009) A new binary description of the blocks relocation problem and benefits in a look ahead heuristic. Lect Notes Comput Sci 5482:37–48

Caserta M, Schwarze S, Voß S (2011a) Container rehandling at maritime container terminals. In: Böse JW (ed) Handbook of terminal planning. OR/CS interfaces series, vol 49. Springer, New York, pp 247–269

Caserta M, Voß S, Sniedovich M (2011b) Applying the corridor method to a blocks relocation problem. OR Spectrum 33:915–929

Caserta M, Schwarze S, Voß S (2012) A mathematical formulation and complexity considerations for the blocks relocation problem. Eur J Operat Res 219(1):96–104

Chen L, Lu Z (2012) The storage location assignment problem for outbound containers in a maritime terminal. Int J Prod Econ 135:73–80

Choe R, Park T, Oh M, Kang J, Ryu K (2011) Generating a rehandling-free intra-block remarshaling plan for an automated container yard. J Intel Manuf 22(2):201–217

Choe R, Kim T, Kim T, Ryu K (2015) Crane scheduling for opportunistic remarshaling of containers in an automated stacking yard. Flex Serv Manuf J 27(2):331–349

Cordeau JF, Legato P, Mazza RM, Trunfio R (2015) Simulation-based optimization for housekeeping in a container transshipment terminal. Comput Oper Res 53:81–95

Dayama N, Ernst A, Krishnamoorthy M, Narayanan V, Rangaraj N (2016) New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports. Euro J Trans Log 6:1–42

Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectrum 28(4):563–586

Ehleiter A, Jaehn F (2016) Housekeeping: foresightful container repositioning. Int J Prod Econ 179:203–211

Eskandari H, Azari E (2015) Notes on mathematical formulation and complexity considerations for blocks relocation problem. Sci Iran Trans E Indu Eng 22(6):2722–2728

Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega M (2012) Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst Appl 39(9):8337–8349

Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2014) A domain-specific knowledge-based heuristic for the blocks relocation problem. Adv Eng Inform 28(4):327–343

Expósito-Izquierdo C, Lalla-Ruiz E, de Armas J, Melián-Batista B, Moreno-Vega JM (2015a) A heuristic algorithm based on an improvement strategy to exploit idle time periods for the stacking problem. Comput Ind Eng 87:410–424

Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2015b) An exact approach for the blocks relocation problem. Expert Syst Appl 42:6408–6422

Felsner S, Pergel M (2008) The complexity of sorting with networks of stacks and queues. Lect Notes Comput Sci 5193:417–429

Forster F, Bortfeldt A (2012a) A tree search heuristic for the container retrieval problem. In: Operations research proceedings 2011, pp 257–262

Forster F, Bortfeldt A (2012b) A tree search procedure for the container relocation problem. Comput Oper Res 39:299–309

Galle V, Borjian Boroujeni S, Manshadi VH, Barnhart C, Jaillet P (2016) An average-case asymptotic analysis of container relocation problem. Oper Res Lett 44:723–728

Gambardella L, Rizzoli A, Zaffalon M (1998) Simulation and planning of an intermodal container terminal. Simulation 71(2):107–116

Gheith M, Eltawil A, Harraz N (2014) A rule-based heuristic procedure for the container pre-marshalling problem. In: 2014 IEEE International Conference on Industrial Engineering and Engineering Management, pp 662–666

Gheith M, Eltawil A, Harraz N (2016) Solving the container pre-marshalling problem using variable length genetic algorithms. Eng Optim 48(4):687–705

Gupta N, Nau D (1992) On the complexity of blocks-world planning. Artif Int 56(2–3):223–254

Hottung A, Tierney K (2016) A biased random-key genetic algorithm for the container pre-marshalling problem. Comput Oper Res 75:83–102

Huang S, Lin T (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62(1):13–20

Hussein MI, Petering MEH (2012) Global retrieval heuristic and genetic algorithm in block relocation problem. In: Lim G, Herrmann JW (eds) Proceedings of the 2012 industrial and systems engineering research conference

Hussein MI, Petering MEH (2013) Linear penalty relation in genetic based algorithms in block relocation problem weights. In: Krishnamurthy A, Chan WKV (eds) Proceedings of the 2013 industrial and systems engineering research conference, pp 1245–1254

Jang DW, Kim SW, Kim KH (2013) The optimization of mixed block stacking requiring relocations. Int J Prod Econom 143:256–262

Jansen K (2003) The mutual exclusion scheduling problem for permutation and comparability graphs. Inform Comput 180(2):71–81

Ji M, Guo W, Zhu H, Yang Y (2015) Optimization of loading sequence and rehandling strategy for multi-quay crane operations in container terminals. Transp Res Part E Logist Trans Rev 80:1–19

Jin B, Lim A, Zhu W (2011) A greedy look-ahead heuristic for the container relocation problem. Lect Notes Comput Sci 7906:181–190

Jin B, Zhu W, Lim A (2015) Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur J Oper Res 240:837–847

Jovanovic R, Voß S (2014) A chain heuristic for the blocks relocation problem. Comput Ind Eng 75:79–86

Jovanovic R, Tuba M, Voß S (2017) A multi-heuristic approach for solving the pre-marshalling problem. Cent Eur J Oper Res 25(1):1–28

Kang J, Oh M, Ahn E, Ryu K, Kim K (2006) Planning for intra-block remarshalling in a container terminal. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp 1211–1220

Kim K, Bae J (1998) Re-marshaling export containers in port container terminals. Comput Ind Eng 35(3):655–658

Kim KH, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940–954

Ku D, Arthanari TS (2016a) Container relocation problem with time windows for container departure. Eur J Oper Res 252(3):1031–1039

Ku D, Arthanari TS (2016b) On the abstraction method for the container relocation problem. Comput Oper Res 68:110–122

Lee Y, Chao SL (2009) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196(2):468–475

Lee Y, Hsu N (2007) An optimization model for the container pre-marshalling problem. Comput Oper Res 34(11):3295–3313

Lee Y, Lee YJ (2010) A heuristic for retrieving containers from a yard. Comput Oper Res 37:1139–1147

Legato P, Mazza RM, Trunfio R (2013) Medcenter container terminal SpA uses simulation in housekeeping operations. Interfaces 43(4):313–324

Lehnfeld J, Knust S (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297–312

Lin DY, Lee YJ, Lee Y (2015) The container retrieval problem with respect to relocation. Trans Res Part C 52:132–143

Nishi T, Konishi M (2010) An optimisation model and its effective beam search heuristics for floor-storage warehousing systems. Int J Produc Res 48(7):1947–1966

Olsen M, Gross A (2014) Average case analysis of blocks relocation heuristics. Lect Notes Comput Sci 8760:81–92

Park K, Park T, Ryu K (2009) Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms. In: SAC 2009 – Honolulu, Hawai, pp 1098–1105

Park T, Kim J, Ryu K (2010) Iterative replanning using genetic algorithms for remarshaling in a container terminal. In: Hamza H (ed) Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, pp 22–28

Park K, Park T, Ryu K (2013) Planning for selective remarshaling in an automated container terminal using coevolutionary algorithms. Int J Ind Eng 20:176–187

Petering MEH, Hussein MI (2013) A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur J Oper Res 231:120–130

Prandtstetter M (2013) A dynamic programming based branch-and-bound algorithm for the container pre-marshalling problem. Technical repot, IT Austrian institute of technology

Rei R, Pedroso JP (2012a) Heuristic search for the stacking problem. Int Trans Oper Res 19(3):379–395

Rei R, Pedroso JP (2012b) Tree search for the stacking problem. Ann Oper Res 203:371–388

Ren Z, Zhang C (2015) An iterative three-stage algorithm for the pre-marshalling problem in container terminals. In: 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp 1232–1236

Rendl A, Prandtstetter M (2013) Constraint models for the container pre-marshaling problem. In: Katsirelos G, Quimper C (eds) Modref 2013: 12th International Workshop on Constraint Modelling and Reformulation, pp 44–56

Romero AG, Alquézar R (2004) To block or not to block? Lect Notes Comput Sci 3315:134–143

Saccone S, Siri S (2009) An integrated simulation-optimization framework for the operational planning of seaport container terminals. Math Comput Model Dyn Syst 15(3):275–293

Schwarze S, Voß S (2015) A note on alternative objectives for the blocks relocation problem, working paper. University of Hamburg

Shin E, Kim K (2015) Hierarchical remarshaling operations in block stacking storage systems considering duration of stay. Comput Ind Eng 89:43–52

Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectrum 30(1):1–52

Steenken D, Voß S, Stahlbock R (2004) Container terminal operations and operations research – a classification and literature review. OR Spectrum 26(1):3–49

Tanaka S, Mizuno F (2015) Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm. In: 2015 IEEE International Conference on Automation Science and Engineering (CASE), pp 509–514

Tanaka S, Takii K (2014) A faster branch-and-bound algorithm for the block relocation problem. In: International Conference on Automation Science and Engineering (CASE). IEEE, Piscataway, pp 7–12

Tanaka S, Takii K (2016) A faster branch-and-bound algorithm for the block relocation problem. IEEE Trans Automat Sci Eng 13(1):181–190

Tang L, Ren H (2010) Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. Comput Oper Res 37:368–375

Tang L, Zhao R, Liu J (2012) Models and algorithms for shuffling problems in steel plants. Naval Res Logist 59(7):502–524

Tang L, Jiang W, Liu J, Dong Y (2015) Research into container reshuffling and stacking problems in container terminal yards. IIE Trans 47(7):751–766

Tierney K, Malitsky Y (2015) An algorithm selection benchmark of the container pre-marshalling problem. Lect Notes Comput Sci 8994:17–22

Tierney K, Voß S (2016) Solving the robust container pre-marshalling problem. Lect Notes Comput Sci 9855:131–145

Tierney K, Pacino D, Voß S (2017) Solving the pre-marshalling problem to optimality with A* and IDA*. Flex Serv Manuf J 29(2):223–259

Tricoire F, Fechter J, Beham A (2016) New solution methods for the blocks relocation problem. Department of Business Administration, University of Vienna, Working Paper. http://www.optimization-online.org/DB_FILE/2016/03/5365.pdf

Tus A, Rendl A, Raidl G (2015) Metaheuristics for the two-dimensional container pre-marshalling problem. In: International Conference on Learning and Intelligent Optimization. Springer, Berlin, pp 186–201

Ünlüyurt T, Aydin C (2012) Improved rehandling strategies for the container retrieval process. J Adv Trans 46:378–393

van Brink M, van der Zwaan R (2014) A branch and price procedure for the container premarshalling problem. Lect Notes Comput Sci 8737:798–809

Voß S (2012) Extended mis-overlay calculation for pre-marshalling containers. Lect Notes Comput Sci 7555:86–91

Wan YW, Liu J, Tsai PC (2009) The assignment of storage locations to containers for a container stack. Naval Res Logist 56(8):699–713

Wang N, Jin B, Lim A (2015) Target-guided algorithms for the container pre-marshalling problem. Omega 53:67–77

Wang N, Jin B, Zhang Z, Lim A (2017) A feasibility-based heuristic for the container pre-marshalling problem. Eur J Oper Res 256:90–101

Woo JW, Kim KH (2011) Estimating the space requirement for outbound container inventories in port container terminals. Int J Produ Econ 133:293–301

Wu KC, Ting CJ (2010) A beam search algorithm for minimizing reshuffle operations at container yards. In: Proceedings of the International Conference on Logistics and Maritime Systems, September 15–17, Busan, Korea, pp 703–710

Wu KC, Hernández R, Ting CJ (2010) Applying tabu search for minimizing reshuffle operations at container yards. J Eastern Asia Soc Trans Stud 8:2379–2393

Yun W, Choi Y (1999) Simulation model for container-terminal operation analysis using an object-oriented approach. Int J Prod Econ 59(1):221–230

Zäpfel G, Wasner M (2006) Warehouse sequencing in the steel supply chain as a generalized job shop model. Int J Prod Econ 104(2):482–501

Zehendner E, Feillet D (2014) A branch and price approach for the container relocation problem. Int J Prod Res 52(24):7159–7176

Zehendner E, Caserta M, Feillet D, Schwarze S, Voß S (2015) An improved mathematical formulation for the blocks relocation problem. Eur J Oper Res 245(2):415–422

Zehendner E, Feillet D, Jaillet P (2017) An algorithm with performance guarantee for the online container relocation problem. Eur J Oper Res 259:48–62

Zhang C, Liu J, Wan Y, Murty KG, Linn RJ (2003) Storage space allocation in container terminals. Trans Res B 37(10):883–903

Zhang H, Guo S, Zhu W, Lim A, Cheang B (2010) An investigation of IDA* algorithms for the container relocation problem. Lect Notes Comput Sci 6096:31–40

Zhang R, Jiang Z, Yun W (2015) Stack pre-marshalling problem: a heuristic-guided branch-and-bound algorithm. Int J Ind Eng 22(5):509–523

Zhang R, Liu S, Kopfer H (2016) Tree search procedures for the blocks relocation problem with batch moves. Flex Services Manuf J 28(3):397–424

Zhu M, Fan X, He Q (2010) A heuristic approach for transportation planning optimization in container yard. In: Proceedings of industrial engineering and engineering management (IEEM). IEEE, Piscataway, pp 1766–1770

Zhu W, Qin H, Lim A, Zhang H (2012) Iterative deepening A* algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9:710–722

Titel: Container Rehandling at Maritime Container Terminals: A Literature Update
verfasst von: Marco Caserta
Silvia Schwarze
Stefan Voß
Verlag: Springer International Publishing
Buch: Handbook of Terminal Planning
Print ISBN: 978-3-030-39989-4

Electronic ISBN: 978-3-030-39990-0

Copyright-Jahr: 2020
DOI: https://doi.org/10.1007/978-3-030-39990-0_16

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner