yard assignment problem

• Help & FAQ

Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem

• Information, Decisions & Operations
• Shanghai University
• The Hong Kong Polytechnic University
• HEC Montréal

Research output : Contribution to journal › Article › peer-review

This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

• Berth allocation
• Column generation
• Quay crane assignment
• Yard management

ASJC Scopus subject areas

• Civil and Structural Engineering
• Transportation

Access to Document

• 10.1287/trsc.2018.0822

Other files and links

• Link to publication in Scopus

Fingerprint

• Column Generation Business & Economics 100%
• Assignment Problem Business & Economics 87%
• Cranes Engineering & Materials Science 78%
• Assignment Business & Economics 64%
• Integrated Business & Economics 42%
• heuristics Social Sciences 34%
• Heuristics Business & Economics 28%
• Liner Shipping Business & Economics 25%

T1 - Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem

AU - Wang, Kai

AU - Zhen, Lu

AU - Wang, Shuaian

AU - Laporte, Gilbert

PY - 2018/7/1

Y1 - 2018/7/1

N2 - This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

AB - This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

KW - Berth allocation

KW - Column generation

KW - Quay crane assignment

KW - Yard management

UR - http://www.scopus.com/inward/record.url?scp=85052148352&partnerID=8YFLogxK

U2 - 10.1287/trsc.2018.0822

DO - 10.1287/trsc.2018.0822

M3 - Article

AN - SCOPUS:85052148352

SN - 0041-1655

JO - Transportation Science

JF - Transportation Science

• Help & FAQ

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

• Civil Engineering
• Center for Interacting Urban Networks

Research output : Contribution to journal › Article › peer-review

The impact of globalization on maritime transportation has led to its enormous growth over the last decade. Due to the rapid increase in sea-borne demand, large emphasis is placed on making ports more efficient, by promoting the effective utilization of available resources. Therefore, the role of optimization becomes crucial, as port operators aim for the cost-effective option of maximizing port efficiency, rather than the costly alternative of expanding existing capacity. One of the most important seaside planning problems that has received a great deal of attention in research streams is the assignment of quay space to incoming vessels; it is known as the Berth Allocation Problem (BAP). Even though it has been studied extensively, there remain certain unaddressed gaps. Relatively little attention has been focused on the operation of bulk ports, in which terminal operators are concerned with integrating and managing the sea-side area (wharf) and the buffer area for storage. The cargo type must be explicitly known to the bulk port operator, who in turn assigns to it the best storage area and the use of appropriate specialized equipment for loading and discharging. It is evident that the integration of the BAP with yard assignment is necessary, in order to maximize efficiency and obtain the optimal berthing plan in bulk ports. Thus, the current paper studies the integrated dynamic hybrid berth allocation and yard assignment problem (BYAP) in the context of bulk ports. Important assumptions are taken into consideration in order to produce a realistic and practical model. Finally, a relevant case study is presented for the case of Mina Zayed Port in Abu Dhabi.

• Berth allocation problem
• maritime logistics.
• yard assignment

ASJC Scopus subject areas

• Theoretical Computer Science
• Computer Science Applications
• Management Science and Operations Research

Access to Document

• 10.1051/ro/2015048

Other files and links

• Link to publication in Scopus
• Link to the citations in Scopus

Fingerprint

• Assignment Problem Business & Economics 100%
• Formulation Mathematics 52%
• Assignment Mathematics 50%
• Integrated Business & Economics 48%
• Operator Mathematics 38%
• Globalization Mathematics 38%
• Mathematical operators Engineering & Materials Science 38%
• Vessel Mathematics 33%

T1 - An integrated berth allocation and yard assignment problem for bulk ports

T2 - Formulation and case study

AU - Al-Hammadi, Jasem

AU - Diabat, Ali

N2 - The impact of globalization on maritime transportation has led to its enormous growth over the last decade. Due to the rapid increase in sea-borne demand, large emphasis is placed on making ports more efficient, by promoting the effective utilization of available resources. Therefore, the role of optimization becomes crucial, as port operators aim for the cost-effective option of maximizing port efficiency, rather than the costly alternative of expanding existing capacity. One of the most important seaside planning problems that has received a great deal of attention in research streams is the assignment of quay space to incoming vessels; it is known as the Berth Allocation Problem (BAP). Even though it has been studied extensively, there remain certain unaddressed gaps. Relatively little attention has been focused on the operation of bulk ports, in which terminal operators are concerned with integrating and managing the sea-side area (wharf) and the buffer area for storage. The cargo type must be explicitly known to the bulk port operator, who in turn assigns to it the best storage area and the use of appropriate specialized equipment for loading and discharging. It is evident that the integration of the BAP with yard assignment is necessary, in order to maximize efficiency and obtain the optimal berthing plan in bulk ports. Thus, the current paper studies the integrated dynamic hybrid berth allocation and yard assignment problem (BYAP) in the context of bulk ports. Important assumptions are taken into consideration in order to produce a realistic and practical model. Finally, a relevant case study is presented for the case of Mina Zayed Port in Abu Dhabi.

AB - The impact of globalization on maritime transportation has led to its enormous growth over the last decade. Due to the rapid increase in sea-borne demand, large emphasis is placed on making ports more efficient, by promoting the effective utilization of available resources. Therefore, the role of optimization becomes crucial, as port operators aim for the cost-effective option of maximizing port efficiency, rather than the costly alternative of expanding existing capacity. One of the most important seaside planning problems that has received a great deal of attention in research streams is the assignment of quay space to incoming vessels; it is known as the Berth Allocation Problem (BAP). Even though it has been studied extensively, there remain certain unaddressed gaps. Relatively little attention has been focused on the operation of bulk ports, in which terminal operators are concerned with integrating and managing the sea-side area (wharf) and the buffer area for storage. The cargo type must be explicitly known to the bulk port operator, who in turn assigns to it the best storage area and the use of appropriate specialized equipment for loading and discharging. It is evident that the integration of the BAP with yard assignment is necessary, in order to maximize efficiency and obtain the optimal berthing plan in bulk ports. Thus, the current paper studies the integrated dynamic hybrid berth allocation and yard assignment problem (BYAP) in the context of bulk ports. Important assumptions are taken into consideration in order to produce a realistic and practical model. Finally, a relevant case study is presented for the case of Mina Zayed Port in Abu Dhabi.

KW - Berth allocation problem

KW - bulk ports

KW - maritime logistics.

KW - yard assignment

UR - http://www.scopus.com/inward/record.url?scp=84965098050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84965098050&partnerID=8YFLogxK

U2 - 10.1051/ro/2015048

DO - 10.1051/ro/2015048

M3 - Article

AN - SCOPUS:84965098050

SN - 0399-0559

JO - RAIRO - Operations Research

JF - RAIRO - Operations Research

• Help & FAQ

Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem

• Department of Logistics and Maritime Studies
• The Hong Kong Polytechnic University

Research output : Journal article publication › Journal article › Academic research › peer-review

This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

• Berth allocation
• Column generation
• Quay crane assignment
• Yard management

ASJC Scopus subject areas

• Civil and Structural Engineering
• Transportation

More information

• 10.1287/trsc.2018.0822

Other files and links

• Link to publication in Scopus

Fingerprint

• Assignment Problem Keyphrases 100%
• Berth Allocation Keyphrases 100%
• Column Generation Keyphrases 100%
• Yard Keyphrases 100%
• Quay Crane Assignment Keyphrases 100%
• Storage Yard Engineering 100%
• Storage Space Keyphrases 66%
• Column-generation-based Heuristic Keyphrases 66%

T1 - Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem

AU - Wang, Kai

AU - Zhen, Lu

AU - Wang, Shuaian

AU - Laporte, Gilbert

PY - 2018/7/1

Y1 - 2018/7/1

N2 - This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

AB - This study investigates an integrated optimization problem on the three main types of resources used in container terminals: berths, quay cranes, and yard storage space. It presents a mixed integer linear programming model, which takes account of the decisions of berth allocation, quay crane assignment, and yard storage space unit assignment for incoming vessels. In addition, since the majority of the liner shipping services operate according to a weekly arrival pattern, the periodicity of the plan is also considered in the model and in the proposed algorithm. To solve the model on large-scale instances, a column generation (CG) procedure is developed to provide a lower bound for the integrated problem, in which an exact pseudopolynomial algorithm is designed for the pricing problems. Using this procedure, we propose a CG-based heuristic with different solution strategies and apply dual stabilization techniques to accelerate the algorithm. Based on some realistic instances,we conduct extensive numerical experiments to validate the effectiveness of the proposed model and the efficiency of the algorithm. The results show that the CG-based heuristic can yield a good solution with an approximate 1% optimality gap within a much shorter computation time than that of CPLEX.

KW - Berth allocation

KW - Column generation

KW - Quay crane assignment

KW - Yard management

UR - http://www.scopus.com/inward/record.url?scp=85052148352&partnerID=8YFLogxK

U2 - 10.1287/trsc.2018.0822

DO - 10.1287/trsc.2018.0822

M3 - Journal article

AN - SCOPUS:85052148352

SN - 0041-1655

JO - Transportation Science

JF - Transportation Science

A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals

• Published: 16 May 2020
• Volume 33 , pages 1–42, ( 2021 )

Cite this article

• Damla Kizilay   ORCID: orcid.org/0000-0002-6561-8819 1 &
• Deniz Türsel Eliiyi 2  

4672 Accesses

66 Citations

1 Altmetric

Explore all metrics

Over the past decades, container transportation has achieved considerable growth, and maritime trade now constitutes 80% of the global trade. The vessel sizes increased in parallel, up to 21,400 TEU (Twenty-foot-equivalent unit container). Accordingly, global containerized trade reached up to 150 million TEU in 2017 (UNCTAD 2018 ). This growth brings the need to use scientific methods to manage and operate container terminals more economically throughout the globe. In order to manage container transshipment and to use large vessels efficiently, the docking time at the container port for each vessel should be minimized. The decrease in the docking time enables the vessel to move to its next destination faster, decreasing turnover time and facilitating more containers to be transported. Container terminals can be divided into five main areas as the berth, the quay, the storage yard, the transport area, and the gate. The vessels must be berthed in suitable positions, after which many containers have to be unloaded or loaded via quay cranes, transshipped by vehicles inside the terminal, and stacked by yard cranes to suitable positions, all by using expensive equipment. With the invention of new technologies, the bottleneck at the berth side is almost overcome; however, the yard and the quayside operations have to be further perfected to obtain efficient plans. In this comprehensive literature review study, we aim to combine the literature on both yard and quayside operations, carefully examining independently studied problems as well as integrated ones. General information about port operations and relevant literature is provided. For the quayside, the literature on quay crane assignment and scheduling problems is investigated, whereas, for the yard side, yard crane scheduling, transport vehicle dispatching and scheduling, vehicle routing and traffic control, and storage location and space planning problems are reviewed in depth. In addition to these individual problems, their integrations are also analyzed, relevant publications and their respective contributions are explained in detail. Besides the milestone papers that lead the literature on container terminals, recent publications and advances are also reviewed, and managerial insights and future research directions are identified.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations

State-of-the-Art Yard Crane Scheduling and Stacking

On double cycling for container port productivity improvement.

Agra A, Oliveira M (2018) MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur J Oper Res 264(1):138–148

MathSciNet   MATH   Google Scholar  

Al-Dhaheri N, Jebali A, Diabat A (2016) The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Comput Ind Eng 94:230–244

Google Scholar  

Azevedo AT, de Salles Neto LL, Chaves AA, Moretti AC (2018) Solving the 3D stowage planning problem integrated with the quay crane scheduling problem by representation by rules and genetic algorithm. Appl Soft Comput 65:495–516

Bae HY, Choe Ri, Park T, Ryu KR (2011) Comparison of operations of AGVs and ALVs in an automated container terminal. J Intell Manuf 22(3):413–426

Beens M-A, Ursavas E (2016) Scheduling cranes at an indented berth. Eur J Oper Res 253(2):298–313

Behjat S, Nahavandi N (2019) A mathematical model and grouping imperialist competitive algorithm for integrated quay crane and yard truck scheduling problem with non-crossing constraint. Int J Eng 32(10)

Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3):615–627

Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244:675–689

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

Boysen N, Emde S (2016) The parallel stack loading problem to minimize blockages. Eur J Oper Res 249(2):618–627

Boysen N, Emde S, Fliedner M (2012) Determining crane areas for balancing workload among interfering and noninterfering cranes. Naval Res Logist (NRL) 59

Boysen N, Briskorn D, Meisel F (2017) A generalized classification scheme for crane scheduling with interference. Eur J Oper Res 258(1):343–357

Briskorn D, Emde S, Boysen N (2016) Cooperative twin-crane scheduling. Discret Appl Math 211:40–57

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

Cao JX, Lee D-H, Chen JH, Shi Q (2010a) The integrated yard truck and yard crane scheduling problem: benders’ decomposition-based methods. Transp Res E 46(3):344–353

Cao J, Shi Q, Lee D-H (2010b) Integrated quay crane and yard truck schedule problem in container terminals. Tsinghua Sci Technol 15(4):467–474

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

MATH   Google Scholar  

Carlo HJ, Vis IFA, Roodbergen KJ (2014b) Transport operations in container terminals: literature overview, trends, research directions and classification scheme. Eur J Oper Res 236(1):1–13

Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 27(2):224–262

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

Casey B, Kozan E (2012) Optimising container storage processes at multimodal terminals. J Oper Res Soc 63(8):1126–1142

Castilla-Rodríguez I, Expósito-Izquierdo C, Melián-Batista B, Aguilar RM, Moreno-Vega JM (2020) Simulation-optimization for the management of the transshipment operations at maritime container terminals. Expert Syst Appl 139:112852

Chang Y, Zhu X (2019) A novel two-stage heuristic for solving storage space allocation problems in rail–water intermodal container terminals. Symmetry 11(10):1229

Chang D, Jiang Z, Yan W, He J (2011) Developing a dynamic rolling-horizon decision strategy for yard crane scheduling. Adv Eng Inform 25(3):485–494

Chang D, Fang T, Fan Y (2017a) Dynamic rolling strategy for multi-vessel quay crane scheduling. Adv Eng Inform 34:60–69

Chang Y, Zhu X, Yan B, Wang L (2017b) Integrated scheduling of handling operations in railway container terminals. Transp Lett 11(7):402–412  

Chen JH (2019) A note on: a flexible crane scheduling methodology for container terminals. Flex Serv Manuf J 31(1):34–40

Chen JH, Bierlaire M (2017) The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion. Eur J Oper Res 260(2):613–624

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

Chen Lu, Bostel N, Dejax P, Cai J, Xi L (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur J Oper Res 181:40–58

Chen Lu, Langevin A, Zhiqiang Lu (2013) Integrated scheduling of crane handling and truck transportation in a maritime container terminal. Eur J Oper Res 225(1):142–152

Chen JH, Lee D-H, Goh M (2014) An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem. Eur J Oper Res 232(1):198–208

Choe Ri, Park T, Myung-Seob Oh, Kang J, Ryu KR (2011) Generating a rehandling-free intra-block remarshaling plan for an automated container yard. J Intell Manuf 22(2):201–217

Choe Ri, Kim J, Ryu KR (2016) Online preference learning for adaptive dispatching of agvs in an automated container terminal. Applied Soft Computing 38:647–660

Chung SH, Chan F (2013) A workload balancing genetic algorithm for the quay crane scheduling problem. Int J Prod Res 51(16):4820–4834

Chung SH, Choy KL (2012) A modified genetic algorithm for quay crane scheduling operations. Expert Syst Appl 39(4):4213–4221

Covic F (2018) A literature review on container handling in yard blocks. In: Cerulli R, Raiconi A, Voß S (eds) Computational logistics. ICCL 2018. Lecture Notes in Computer Science, vol 11184. Springer, Cham

Daganzo CF (1989) The crane scheduling problem. Transp Res B 23(3):159–175

MathSciNet   Google Scholar  

Dayama NR, Krishnamoorthy M, Ernst A, Narayanan V, Rangaraj N (2014) Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Comput Oper Res 52:68–83

Diabat A, Theodorou E (2014) An integrated quay crane assignment and scheduling problem. Comput Ind Eng 73:115–123

Dik G, Kozan E (2017) A flexible crane scheduling methodology for container terminals. Flex Serv Manuf J 29(1):64–96

Ding Y, GuoLong L, ChengJi L (2012) Model and heuristic algorithm for quay crane scheduling at container terminal. In: Proceedings - 2012 9th international conference on fuzzy systems and knowledge discovery, FSKD 2012

Dong L, Yang Y, Sun S (2019) QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA). Cluster Comput 22(2):4331–4348

Dragović B, Tzannatos E, Park NK (2017) Simulation modelling in ports and container terminals: literature overview and analysis by research field, application area and tool. Flex Serv Manuf J 29(1):4–34

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

Eliiyi T, Deniz GM, Ozmen B (2013) Storage optimization for export containers in the Port of Izmir. PROMET 25(4):359–367

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, González-Velarde JL, Melián-Batista B, Marcos Moreno-Vega J (2013) Hybrid estimation of distribution algorithm for the quay crane scheduling problem. Appl Soft Comput 13(10):4063–4076

Fan H, Ren X, Guo Z, Li Y (2019) Truck scheduling problem considering carbon emissions under truck appointment system. Sustainability 11(22):6256

Fazli M, Fathollahi-Fard AM, Tian G (2019) Addressing a coordinated quay crane scheduling and assignment problem by red deer algorithm. Int J Eng 32(8):1186–1191

Feillet D, Parragh SN, Tricoire F (2019) A local-search based heuristic for the unrestricted block relocation problem. Comput Oper Res 108:44–56

Firmino DS, Andresson RM, Silva DA, Times VC (2019) A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time. J Heuristics 25(2):141–173

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

Fu Y-M, Diabat A (2015) A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl Math Model 39(3–4):1194–1201

Fu Y-M, Diabat A, Tsai I-T (2014) A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst Appl 41(15):6959–6965

Galle V, Barnhart C, Jaillet P (2018) Yard crane scheduling for container storage, retrieval, and relocation. Eur J Oper Res 271(1):288–316

Gawrilow E, Klimm M, Möhring RH, Stenzel B (2012) Conflict-free vehicle routing. EURO J Transp Logist 1(1):87–111

Gharehgozli A, Zaerpour N (2018) Stacking outbound barge containers in an automated deep-sea terminal. Eur J Oper Res 267(3):977–995

Gharehgozli AH, Roy D, De Koster R (2016) Sea container terminals: new technologies and or models. Marit Econ Logist 18(2):103–140

Gharehgozli AH, Vernooij FG, Zaerpour N (2017) A simulation study of the performance of twin automated stacking cranes at a seaport container terminal. Eur J Oper Res 261(1):108–128

Ghomi MSF, Javanshir H, Ganji SS, Ghomi SMTF (2014) Optimisation of yard crane scheduling considering velocity coefficient and preventive maintenance. Int J Shipp Transp Logist 6(1):88–108

Guan Y, Yang K-H, Zhou Z (2013) The crane scheduling problem: models and solution approaches. Ann Oper Res 203(1):119–139

Guo Xi, Huang SY (2012) Dynamic space and time partitioning for yard crane workload management in container terminals. Transp Sci 46(1):134–148

Guo Xi, Huang SY, Hsu WJ, Low MYH (2011) Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information. Adv Eng Inform 25(3):472–484

Guo P, Cheng W, Wang Yi (2014) A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints. Eng Optim 46(10):1411–1429

Guo P, Cheng W, Wang Y, Boysen N (2018) Gantry crane scheduling in intermodal rail-road container terminals. Int J Prod Res 56(16):5419–5436

Güven C, Eliiyi DT (2018) Modelling and optimisation of online container stacking with operational constraints. Marit Policy Manag 46(2):201–216

Hakam MH, Solvang WD, Hammervoll T (2012) A genetic algorithm approach for quay crane scheduling with non-interference constraints at narvik container terminal. Int J Logist Res Appl 15(4):269–281

Han XL, Wang Q, Huang JW (2019) Scheduling cooperative twin automated stacking cranes in automated container terminals. Comput Ind Eng 128:553–558

He J, Tan C (2018) Modelling a resilient yard template under storage demand fluctuations in a container terminal. Eng Optim 51(9):1547–1566

He J, Zhang W, Huang Y, Yan W (2013a) A simulation optimization method for internal trucks sharing assignment among multiple container terminals. Adv Eng Inform 27(4):598–614

He J, Zhang W, Huang Y, Yan W (2013b) An efficient approach for solving yard crane scheduling in a container terminal. J Shanghai Jiaotong Univ (Sci) 18(5):606–619

He J, Huang Y, Yan W (2015a) Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption. Adv Eng Inform 29(1):59–75

He J, Huang Y, Yan W, Wang S (2015b) Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption. Expert Syst Appl 42(5):2464–2487

He J, Tan C, Zhang Y (2019a) Yard crane scheduling problem in a container terminal considering risk caused by uncertainty. Adv Eng Inform 39:14–24

He Y, Wang A, Hailiang Su (2019b) The impact of incomplete vessel arrival information on container stacking. Int J Prod Res. https://doi.org/10.1080/00207543.2019.1686188

Article   Google Scholar  

Homayouni SM, Tang SH (2013) Multi objective optimization of coordinated scheduling of cranes and vehicles at container terminals. Math Probl Eng 2013:1–9

Homayouni SM, Tang SH, Motlagh O (2014) A genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals. J Comput Appl Math 270(Supplement C):545–556

Homayouni SM, Vasili MR, Kazemi SM, Tang SH (2012) Integrated scheduling of SP-AS/RS and handling equipment in automated container terminals. In: Proceedings of international conference on computers and industrial engineering, CIE

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

Hottung A, Tanaka S, Tierney K (2020) Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput Oper Res 113:104781

Hu H, Huang Y, Zhen L, Lee BK, Lee LH, Chew EP (2014) A decomposition method to analyze the performance of frame bridge based automated container terminal. Expert Syst Appl 41(2):357–365

Hu Qu, Luan X, Corman F, Lodewijks G (2016) A tabu search algorithm for inter-terminal container transport. IFAC-PapersOnLine 49(3):413–418

Hu H, Chen X, Wang T, Zhang Ye (2019a) A three-stage decomposition method for the joint vehicle dispatching and storage allocation problem in automated container terminals. Comput Ind Eng 129:90–101

Hu X, Guo J, Zhang Y (2019b) Optimal strategies for the yard truck scheduling in container terminal with the consideration of container clusters. Comput Ind Eng 137:106083

Huang SY, Li Y (2018a) A bounded two-level dynamic programming algorithm for quay crane scheduling in container terminals. Comput Ind Eng 123:303–313

Huang SY, Li Y (2018b) Optimization and evaluation of tandem quay crane performance. In: 2017 4th international conference on systems and informatics, ICSAI 2017, pp 637–642

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

Huang J, Ren Z (2011) Research on SA-based addressing model of slot in container terminal. Appl Mech Mater 97–98:985–989

Jaehn F, Kress D (2018) Scheduling cooperative gantry cranes with seaside and landside jobs. Discret Appl Math 242:53–68

Jeong Y-H, Kim KH, Woo YJ, Seo BH (2012) A simulation study on a workload-based operation planning method in container terminals. Ind Eng Manag Syst 11(1):103–113

Jiang XJ, Jin JG (2017) A branch-and-price method for integrated yard crane deployment and container allocation in transshipment yards. Transp Res B 98:62–75

Jiang X, Lee LH, Chew EP, Han Y, Tan KC (2012) A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port. Eur J Oper Res 221(1):64–73

Jiang X, Chew EP, Lee LH, Tan KC (2013a) Flexible space-sharing strategy for storage yard management in a transshipment hub port. OR Spectrum 35(2):417–439

Jiang X, Lee LH, Chew EP, Tan KC (2013b) Storage yard management for transshipment ports. In: IEEE international conference on automation science and engineering, pp 138–43

Jiang X, Chew EP, Lee LH, Tan KC (2014) Short-term space allocation for storage yard management in a transshipment hub port. OR Spectrum 36(4):879–901

Jiang XJ, Xu Y, Zhou C, Chew EP, Lee LH (2018) Frame trolley dispatching algorithm for the frame bridge based automated container terminal. Transp Sci 52(3):722–737

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

Jonker T, Duinkerken MB, Yorke-Smith N, de Waal A, Negenborn RR (2019) Coordinated optimization of equipment operations in a container terminal. Flex Serv Manuf J. https://doi.org/10.1007/s10696-019-09366-3

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

Kaveshgar N, Huynh N (2015) Integrated quay crane and yard truck scheduling for unloading inbound containers. Int J Prod Econ 159(Supplement C):168–177

Kaveshgar N, Huynh N, Rahimian SK (2012) An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Syst Appl 39(18):13108–13117

Kaveshgar N, Huynh N, Rahimian SK (2018) Solving the quay crane scheduling problem using genetic algorithm in MATLAB. In: Trb 91st annual meeting compendium of papers, Transportation Research Board, 1–20

Kaysi I, Maddah B, Nehme N, Mneimneh F (2012) An integrated model for resource allocation and scheduling in a transshipment container terminal. Transp Lett 4(3):143–152

Kemme N (2012) Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals. OR Spectrum 34(3):563–591

Kim KH, Lee H (2015) 220 International series in operations research and management science. In: Container terminal operation: current trends and future challenges.

Kim KH, Park Y-M (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3):752–768

Kizilay D, Eliiyi DT, Van Hentenryck P (2018) Constraint and mathematical programming models for integrated port container terminal operations. In: van Hoeve W-J (ed) Integration of constraint programming, artificial intelligence, and operations research. Springer, Cham, pp 344–360

Klerides E, Hadjiconstantinou E (2011) Modelling and solution approaches to the multi-load agv dispatching problem in container terminals. Marit Econ Logist 13(4):371–386. https://doi.org/10.1057/mel.2011.22

Kouismi S (2017) A discrete time heuristic for storage and scheduling unloading operations in container terminal under capacity and non-interference constraints. Int J Appl Eng Res 12(24):15018–15026

Kress D, Dornseifer J, Jaehn F (2019a) An exact solution approach for scheduling cooperative gantry cranes. Eur J Oper Res 273(1):82–101

Kress D, Meiswinkel S, Pesch E (2019b) Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas. Eur J Oper Res 279(3):732–750

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

Ku D, Arthanari TS (2016b) On double cycling for container port productivity improvement. Ann Oper Res 243(1):55–70

Ku LP, Chew EP, Lee LH, Tan KC (2011) A Novel approach to yard planning under vessel arrival uncertainty. Flex Serv Manuf J 24:274

Lau HYK, Zhao Y (2008) Integrated scheduling of handling equipment at automated container terminals. Int J Prod Econ 112(2):665–682

Lee D-H, Jin JG, Chen JH (2012a) Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs. Transp Res Rec 2273:87–95

Lee D-H, Jin JG, Chen JH (2012b) Terminal and yard allocation problem for a container transshipment hub with multiple terminals. Transp Res E 48(2):516–528

Lee C-Y, Liu M, Chu C (2015) Optimal algorithm for the general quay crane double-cycling problem. Transp Sci 49(4):721–1005

Legato P, Mazza RM (2018) A decision support system for integrated container handling in a transshipment hub. Decis Support Syst 108:45–56

Legato P, Trunfio R (2014) A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules. 4OR 12(2):123–156

Legato P, Trunfio R, Meisel F (2012) Modeling and solving rich quay crane scheduling problems. Comput Oper Res 39(9):2063–2078

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

Li W, Goh M, Yong Wu, Petering MEH, de Souza R, Wu YC (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. Int J Prod Econ 136(2):332–343

Li Y, Zhu X, Wang L, Chen X (2017) Stowage plan based slot optimal allocation in rail-water container terminal. J Control Sci Eng

Li N, Chen G, Govindan K, Jin Z (2018) Disruption management for truck appointment system at a container terminal: a green initiative. Transp Res Part D 61:261–273

Li X, Otto A, Pesch E (2019) Solving the single crane scheduling problem at rail transshipment yards. Discret Appl Math 264:134–147

Li W, Xiaoning Z, Zhengyu X (2020) Efficient container stacking approach to improve handling: efficiency in chinese rail-truck transshipment terminals. Simulation 96(1):3–15

Liang L, Lu ZQ, Zhou BH (2009) A heuristic algorithm for integrated scheduling problem of container handling system. In: 2009 international conference on computers industrial engineering, pp 40–45

Liang C, Fan L, Dehong Xu, Ding Yi, Gen M (2018) Research on coupling scheduling of quay crane dispatch and configuration in the container terminal. Comput Ind Eng 125:649–657

Liu M, Zheng F, Li J (2015) Scheduling small number of quay cranes with non-interference constraint. Optim Lett 9(2):403–412

Liu M, Xu L, Chu C, Chu F (2016a) Framework branch-and-price algorithm for yard management problem at container terminals. In: ICNSC 2016 - 13th IEEE international conference on networking, sensing and control

Liu M, Xu L, Wang S, Chu C (2016b) Efficient algorithm for quay crane scheduling with arbitrary precedence constraint. In: 2016 13th international workshop on discrete event systems, WODES 2016, pp 57–62

Liu M, Liang B, Zheng F, Chu C, Chu F (2018) Quay crane scheduling problem with the consideration of maintenance. In: ICNSC 2018 - 15th IEEE international conference on networking, sensing and control, pp 1–6.

López-Plata I, Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2017) Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals. Electron Notes Discret Math 58:127–133

Lu Y, Le M (2014) The integrated optimization of container terminal scheduling with uncertain factors. Comput Ind Eng 75(Supplement C):209–216

Lu H, Wang S (2019) A study on multi-ASC scheduling method of automated container terminals based on graph theory. Comput Ind Eng 129:404–416

Lu Z, Han X, Xi L (2011) Simultaneous berth and quay crane allocation problem in container terminal. Adv Sci Lett 4(6–7):2113

Lu Z, Han X, Xi L, Erera AL (2012) A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Comput Oper Res 39(12):2915–2928

Luo J, Yue W, Mendes AB (2016) Modelling of integrated vehicle scheduling and container storage problems in unloading process at an automated container terminal. Comput Ind Eng 94:32–44

Luo T, Chang D, Gao Y (2018) Optimization of gantry crane scheduling in container sea-rail intermodal transport yard. Math Probl Eng

Maldonado S, González-Ramírez RG, Quijada F, Ramírez-Nafarrate A (2019) Analytics meets port logistics: a decision support system for container stacking operations. Decis Support Syst 121:84–93

Meilong L, Leilei C, Youfang H (2016) Multi-yard-crane routing optimization at container terminals based on a two-stage programming. In: 2016 12th international conference on natural computation, fuzzy systems and knowledge discovery, ICNC-FSKD 2016, pp 1509–1515

Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp Sci 47(2):131–147

Mengjue X, Ning Z, Weijian M (2016) Storage allocation in automated container terminals: the upper level. Polish Marit Res 23(s1):160–174

Msakni MK, Al-Salem M, Rabadi G, Kotachi M, Diabat A (2018a) Quay crane scheduling with vessel stability. Transp Res Procedia 30:60–69

Msakni MK, Diabat A, Rabadi G, Al-Salem M, Kotachi M (2018b) Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. Comput Oper Res 99:218–233

Murty KG, Liu J, Wan Y-W, Linn R (2005) A decision support system for operations in a container terminal. Decis Support Syst 39(3):309–332

Nam H, Lee T (2013) A scheduling problem for a novel container transport system: a case of mobile harbor operation schedule. Flex Serv Manuf J 25(4):576–608

Nguyen S, Zhang M, Johnston M, Tan KC (2013) Hybrid evolutionary computation methods for quay crane scheduling problems. Comput Oper Res 40(8):2083–2093

Niu B, Xie T, Tan L, Bi Y, Wang Z (2016) Swarm intelligence algorithms for yard truck scheduling and storage allocation problems. Neurocomputing 188(Supplement C):284–293

Pap E, Bojanić V, Bojanić G, Georgijević M (2013) Quay crane scheduling for river container terminals. In: Pap E (ed) Intelligent systems: models and applications: revised and selected papers from the 9th IEEE international symposium on intelligent systems and informatics SISY 2011. Springer, Heidelberg, pp 285–300

Park T, Choe Ri, Kim YH, Ryu KR (2011) Dynamic adjustment of container stacking policy in an automated container terminal. Int J Prod Econ 133(1):385–392

Parreño-Torres C, Alvarez-Valdes R, Ruiz R (2019) Integer programming models for the pre-marshalling problem. Eur J Oper Res 274(1):142–154

Peng Y, Wang W, Song X, Zhang Q (2016) Optimal allocation of resources for yard crane network management to minimize carbon dioxide emissions. J Clean Prod 131:649–658

Petering MEH (2011) Decision support for yard capacity, fleet composition, truck substitutability, and scalability issues at seaport container terminals. Transp Res E 47(1):85–103

Petering MEH, Wu Y, Li W, Goh M, de Souza R, Murty KG (2017) Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses. Flex Serv Manuf J 29(3–4):369–402

Rashidi H, Tsang EPK (2011) A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals. Comput Math Appl 61(3):630–641

Rekik I, Elkosantini S (2019) A multi agent system for the online container stacking in seaport terminals. J Comput Sci 35:12–24

Rekik I, Elkosantini S, Chabchoub H (2015) Real-time stacking system for dangerous containers in seaport terminals. IFAC-Papers OnLine 48(3):141–148

Rekik I, Elkosantini S, Chabchoub H (2018) A case based heuristic for container stacking in seaport terminals. Adv Eng Inform 38:658–669

Rodriguez-Molins M, Salido MA, Barber F (2012) Intelligent planning for allocating containers in maritime terminals. Expert Syst Appl 39(1):978–989

Rodriguez-Molins M, Salido MA, Barber F (2014) A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds. Appl Intell 40(2):273–290

Rouky N, Abourraja MN, Boukachour J, Boudebous D, Alaoui AEH, El Khoukhi F (2019) Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem. Int J Ind Eng Comput 10(1):111–132

Saini S, Roy D, de Koster R (2017) A stochastic model for the throughput analysis of passing dual yard cranes. Comput Oper Res 87:40–51

Sha M, Zhang T, Lan Y, Zhou X, Qin T, Dayong Yu, Chen K (2017) Scheduling optimization of yard cranes with minimal energy consumption at container terminals. Comput Ind Eng 113:704–713

Sharif O, Huynh N (2012) Yard crane scheduling at container terminals: a comparative study of centralized and decentralized approaches. Marit Econ Logist 14:139–161

Shin K, Lee T (2013) Container loading and unloading scheduling for a mobile harbor system: a global and local search method. Flex Serv Manuf J 25(4):557–575

Song L, Cherrett T, Guan W (2012) Study on berth planning problem in a container seaport: using an integrated programming approach. Comput Ind Eng 62(1):119–128

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 operation and operations research—a classification and literature review. OR Spectrum 26(1):3–49

Sun D, Tang L, Baldacci R (2019) A benders decomposition-based framework for solving quay crane scheduling problems. Eur J Oper Res 273(2):504–515

Tan C, He J (2016) Integrated yard space allocation and yard crane deployment problem in resource-limited container terminals. Sci Program

Tan C, Huang Y, He J, Yan W (2017a) A resilient model of yard template generation for minimizing yard overflow risk under container volume fluctuation of shipping route. In: Advances in transdisciplinary engineering, pp 75–83.

Tan C, He J, Wang Y (2017b) Storage yard management based on flexible yard template in container terminal. Adv Eng Inform 34:101–113

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

Tanaka S, Tierney K (2018) Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm. Eur J Oper Res 264(1):165–180

Tanaka S, Tierney K, Parreño-Torres C, Alvarez-Valdes R, Ruiz R (2019) A branch and bound approach for large pre-marshalling problems. Eur J Oper Res 278(1):211–225

Tang L, Zhao J, Liu J (2014) Modeling and solution of the joint quay crane and truck scheduling problem. Eur J Oper Res 236(3):978–990

Tasoglu G, Yildiz G (2019) Simulated annealing based simulation optimization method for solving integrated berth allocation and quay crane scheduling problems. Simul Model Pract Theory 97:101948

Theodorou E, Diabat A (2015) A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results. Optim Lett 9(4):799–817

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

Ting C-J, Kun-Chih W (2017) Optimizing container relocation operations at container yards with beam search. Transp Res E 103:17–31

Trunfio R (2014) A timed petri net model for the quay crane scheduling problem. In: Proceedings - 28th European conference on modelling and simulation, ECMS 2014, pp 441–47

Trunfio R (2015) A note on: A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints. Eng Optimi 47(6):843–859

UNCTAD (2018) (United Nations Conference on Trade and Development). Review of Maritime Transport 2018. New York, NY, USA. https://unctad.org/en/PublicationsLibrary/rmt2018_en.pdf .

Ünlüyurt T, Aydın C (2012) Improved rehandling strategies for container retrieval process. J Adv Transp 46:378–393

Unsal O, Oguz C (2013) Constraint programming approach to quay crane scheduling problem. Transp Res E 59:108–122

van Asperen E, Borgman B, Dekker R (2013) Evaluating impact of truck announcements on container stacking efficiency. Flex Serv Manuf J 25(4):543–556

Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147(1):1–16

Voß A, Guckenbiehl G, Schutt H, Buer T (2017) An online storage strategy with dynamic bay reservations for container terminals. In: 2016 IEEE symposium series on computational intelligence, SSCI 2016.

Wang L, Zhu X (2014) Rail mounted gantry crane scheduling optimization in railway container terminal based on hybrid handling mode. Comput Intell Neurosci

Wang S, Zheng J, Zheng K, Guo J, Liu X (2012) Multi resource scheduling problem based on an improved discrete particle swarm optimization. Phys Procedia 25:576–582

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

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

Wang K, Zhen L, Wang S, Laporte G (2018) Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem. Transp Sci 52(4):812–834

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

Wu L, Ma W (2017) Quay crane scheduling with draft and trim constraints. Transp Res Part E 97:38–68

Wu Y, Luo J, Zhang D, Dong M (2013) An integrated programming model for storage management and vehicle scheduling at container terminals. Res Transp Econ 42(1):13–27

Xin J, Negenborn RR, Lodewijks G (2014) Energy-aware control for automated container terminals using integrated flow shop scheduling and optimal control. Transp Res C 44(Supplement C):214–230

Xin J, Negenborn RR, Corman F, Lodewijks G (2015) Control of interacting machines in automated container terminals using a sequential planning approach for collision avoidance. Transp Res C 60(Supplement C):377–396

Xing Y, Yin K, Wang B, Quadrifoglio L (2012) Dispatch problem of automated guided vehicles for serving tandem lift quay crane. Transp Res Rec J Transp Res Board 2273:79–86

Xue Z, Zhang C, Miao L, Lin W-H (2013) An ant colony algorithm for yard truck scheduling and yard location assignment problems with precedence constraints. J Syst Sci Syst Eng 22(1):21–37

Yan W, Huang Y, Chang D, He J (2011) An investigation into knowledge-based yard crane scheduling for container terminals. Adv Eng Inform 25(3):462–471

Yang KH (2012) The influence of the quay crane traveling time for the quay crane scheduling problem. Lect Notes Eng Comput Sci 2196:1298–1301

Yang Y-C (2017) Operating strategies of CO2 reduction for a container terminal based on carbon footprint perspective. J Clean Prod 141:472–480

Yang X, Zhao N, Bian Z, Chai J, Mi C (2015) An intelligent storage determining method for inbound containers in container terminals. J Coast Res 73:197–204

Yang Y, Zhong M, Dessouky Y, Postolache O (2018) An integrated scheduling method for AGV routing in automated container terminals. Comput Ind Eng 126:482–493

Yang Y, Zhu X, Haghani A (2019) Multiple equipment integrated scheduling and storage space allocation in rail–water intermodal container terminals considering energy efficiency. Transp Res Record 2673(3):199–209

Ypsilantis P, Zuidwijk R (2019) Collaborative fleet deployment and routing for sustainable transport. Sustainability 11(20):5666

Yu D, Li D, Sha M, Zhang D (2019) Carbon-efficient deployment of electric rubber-tyred gantry cranes in container terminals with workload uncertainty. Eur J Oper Res 275(2):552–569

Yu H, Ge Y-E, Fu X, Huang Y, Zhang Y, Tan C (2018a) Capturing effects of container location dispersion on quay crane performance. Proc Inst Civil Eng 171(1):25–39

Yu H, Ge Y-E, Chen J, Luo L, Tan C, Liu D (2017a) CO2 emission evaluation of yard tractors during loading at container terminals. Transp Res D 53:17–36

Yu M, Qi X (2013) Storage space allocation models for inbound containers in an automatic container terminal. Eur J Oper Res 226(1):32–45

Yu S, Wang S, Zhen L (2017b) Quay crane scheduling problem with considering tidal impact and fuel consumption. Flex Serv Manuf J 29(3–4):345–368

Yu X, Tang G, Guo Z, Song X, Yu J (2018b) Performance comparison of real-time yard crane dispatching strategies at nontransshipment container terminals. Math Probl Eng

Zaghdoud R, Mesghouni K, Dutilleul SC, Zidi K, Ghedira K (2016) A hybrid method for assigning containers to AGVs in container terminal. IFAC-Papers OnLine 49(3):96–103

Zeng Q, Feng Y, Yang Z (2019) Integrated optimization of pickup sequence and container rehandling based on partial truck arrival information. Comput Ind Eng 127:366–382

Zhang C, Wu T, Kim KH, Miao L (2014) Conservative allocation models for outbound containers in container terminals. Eur J Oper Res 238(1):155–165

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

Zhang A, Zhang W, Chen Y, Chen G, Chen X (2017) Approximate the scheduling of quay cranes with non-crossing constraints. Eur J Oper Res 258(3):820–828

Zhao N, Xia M, Mi C, Bian Z, Jin J (2015) Simulation-based optimization for storage allocation problem of outbound containers in automated container terminals. Math Probl Eng. https://doi.org/10.1155/2015/548762

Zhao J, Zhu X, Liu Y, Wang L, Yan B (2018) A practical model for inbound container distribution organization in rail-water transhipping terminal. J Control Sci Eng

Zhao Q, Ji S, Guo D, Xuemin Du, Wang H (2019) Research on cooperative scheduling of automated quayside cranes and automatic guided vehicles in automated container terminal. Math Prob Eng 2019:1–15

Zhen L (2013) A review on yard management in container terminals. Ind Eng Manag Syst 12(4):289–304

Zhen L (2014) Container yard template planning under uncertain maritime market. Transp Res E 69:199–217

Zhen L (2016) Modeling of yard congestion and optimization of yard template in container ports. Transp Res B 90:83–104

Zhen L, Zhou X, Wang K, Ding Y (2016) Multi-period yard template planning in container terminals. Transp Res B 93:700–719

Zhen L, Hongtao H, Wang W, Shi X, Ma C (2018) Cranes scheduling in frame bridges based automated container terminals. Transp Res Part C 97:369–384

Zheng S, Sha J (2019) Using path optimum algorithm to solve slot selection problems for outbound containers of different attributes in container terminals. SN Appl Sci 1(10):1260

Zheng K, Lu Z, Sun X (2010) An effective heuristic for the integrated scheduling problem of automated container handling system using twin 40’ cranes. In: 2010 second international conference on computer modeling and simulation, pp 406–410.

Zheng F, Man X, Chu F, Liu M, Chu C (2019a) A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks. Int J Prod Res 57(13):4132–4147

Zheng S, Sha J, Wang A (2019b) An improved storage-space selection model and algorithm for outbound shipping containers: considering the synchronous operation of multiple gantry cranes in port terminals worldwide. J Coast Res 35(5):1120

Zhong M, Yang Y, Zhou Y, Postolache O (2019) Adaptive autotuning mathematical approaches for integrated optimization of automated container terminal. Math Probl Eng 2019:1–14

Zhou C, Chew EP, Lee LH (2018) Information-based allocation strategy for grid-based transshipment automated container terminal. Transp Sci 52(3):707–721

Zhu H, Ji M, Guo W (2020) Two-stage search algorithm for the inbound container unloading and stacking problem. Appl Math Model 77(2):1000–1024

Zhu H, Ji M, Guo W, Wang Q, Yang Y (2019) Mathematical formulation and heuristic algorithm for the block relocation and loading problem. Naval Res Logist (NRL) 66(4):333–351

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their invaluable suggestions. This study was supported within the scope of the scientific research project, which was accepted by the Project Evaluation Commission of Yasar University under project number BAP038 and title “Solution Approaches for Integrated Liner Shipping Network Design and Container Terminal Operations”.

Author information

Authors and affiliations.

Department of Industrial Engineering, Izmir Democracy University, 35140, Karabaglar, Izmir, Turkey

Damla Kizilay

Department of Industrial Engineering, Izmir Bakircay University, 35665, Menemen, Izmir, Turkey

Deniz Türsel Eliiyi

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Damla Kizilay .

Additional information

Publisher's note.

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Kizilay, D., Eliiyi, D.T. A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals. Flex Serv Manuf J 33 , 1–42 (2021). https://doi.org/10.1007/s10696-020-09385-5

Download citation

Published : 16 May 2020

Issue Date : March 2021

DOI : https://doi.org/10.1007/s10696-020-09385-5

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Container terminals
• Quay and yard operations
• Integrated operations
• Literature review
• Find a journal
• Publish with us
• Track your research