Skip to main content

Advertisement

Springer Nature Link
Log in

Scheduling optimization for two crossover automated stacking cranes considering relocation

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

In this paper, we focus on the two crossover automated stacking cranes (ASCs) scheduling problem that arises at a storage block in an automated container terminal. To address relocation during retrieval operations, we use two methods with job precedence constraints: (1) adjusting the operation sequence of jobs to avoid relocation operations and (2) optimizing the dispatching for relocation operations to improve the efficiency of ASCs. Therefore, the method proposed in this paper optimizes the dispatching for storage, retrieval, and relocation and the routes of the ASCs while considering interferences between the ASCs and job precedence constraints. A branch-and-cut algorithm based on the characteristics of the problem is designed to decompose the problem into two problem classes connected via logic-based Benders constraints. Numerical experiments indicate that the proposed algorithm is efficient for solving realistically sized problems. Furthermore, the influence of the number of relocations is investigated based on experimental results.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Availability of data and material

Not applicable.

References

  • Bard JF, Shao Y, Qi XT, Jarrah AI (2014) The traveling therapist scheduling problem. IIE Trans 46(7):683–706

    Article  Google Scholar 

  • Borjian S, Manshadi VH, Barnhart C, Jaillet P (2015) Managing relocation and delay in container terminals with flexible service policies. Math 4(3):113–122

    Google Scholar 

  • Briskorn D, Angeloudis P (2016) Scheduling co-operating stacking cranes with predetermined container sequences. Discrete Appl Math 201:70–85

    Article  Google Scholar 

  • Cao Z, Lee DH, Meng Q (2008) Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals. Int J Prod Econ 115(1):221–228

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Gharehgozli AH, Yu Y, de Koster R, Udding JT (2014a) An exact method for scheduling a yard crane. Eur J Oper Res 235(2):431–447

    Article  Google Scholar 

  • Gharehgozli AH, Laporte G, Yu Y, de Koster R (2014b) Scheduling twin yard cranes in a container block. Transport Sci 49(3):686–705

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107

    Article  Google Scholar 

  • Hooker J, Ottosson G (2013) Logic-based benders decomposition. Math Progr 96:33–60

    Article  Google Scholar 

  • Hu ZH, Sheu JB, Luo JX (2016) Sequencing twin automated stacking cranes in a block at automated container terminal. Transport Res C-Emer 69:208–227

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Kim KH, Kang JS, Ryu KR (2004) A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectr 26(1):93–116

    Article  Google Scholar 

  • Li W et al (2009) Discrete time model and algorithms for container yard crane scheduling. Eur J Oper Res 198(1):165–172

    Article  Google Scholar 

  • Li W et al (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. Int J Prod Econ 136(2):332–343

    Article  Google Scholar 

  • Momayezi F, Chaharsooghi SK, Sepehri MM, Kashan AH (2018) The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm. Oper Res Int J 2:1–28

    Google Scholar 

  • Nehme N, Maddah B, Kaysi IA (2019) An integrated multi-ship crane allocation in Beirut Port container terminal. Oper Res Int J 3:1–19

    Google Scholar 

  • Ng WC (2005) Crane scheduling in container yards with inter-crane interference. Eur J Oper Res 164(1):64–78

    Article  Google Scholar 

  • Ng WC, Mak KL (2005a) Yard crane scheduling in port container terminals. Appl math model 29(3):263–276

    Article  Google Scholar 

  • Ng WC, Mak KL (2005b) An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Eng Optimiz 37(8):67–877

    Article  Google Scholar 

  • Nossack J, Briskorn D, Pesch E (2018) Container dispatching and conflict-free yard crane routing in an automated container terminal. Transport Sci 52(5):1059–1076

    Article  Google Scholar 

  • Park T, Choe R, Ok SM, Ryu KR (2010) Real-time scheduling for twin rmgs in an automated container yard. OR Spectr 32(3):593–615

    Article  Google Scholar 

  • Speer U, Fischer K (2016) Scheduling of different automated yard crane systems at container terminals. Transport Sci 51(1):305–324

    Article  Google Scholar 

  • Stahlbock R, Voß S (2010) Efficiency considerations for sequencing and scheduling of double-rail-mounted gantry cranes at maritime container terminals. Int J Ship Trans Log 2(1):95–123

    Google Scholar 

  • Vis IFA, Carlo HJ (2010) Sequencing two cooperating automated stacking cranes in a container terminal. Transport Sci 44(2):169–182

    Article  Google Scholar 

  • Vis IF, Roodbergen KJ (2009) Scheduling of container storage and retrieval. Oper Res 57(2):456–467

    Article  Google Scholar 

  • Wu Y et al (2015) Scheduling multiple yard cranes with crane interference and safety distance requirement. Transport Sci 9(4):990–1005

    Article  Google Scholar 

  • Yang X et al (2015) A simulation study on the design of a novel automated container terminal. IEEE T Intell Transp 16(5):2889–2899

    Article  Google Scholar 

  • Zahran SZ et al (2020) Analysis of port efficiency using imprecise and incomplete data. Oper Res Int J 20:219–246

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Zhao W, Goodchild AV (2010) The impact of truck arrival information on container terminal rehandling. Transport Res E-Log 46(3):327–343

    Article  Google Scholar 

  • Zheng F, Man X, Chu F (2018) Two yard crane scheduling with dynamic processing time and interference. IEEE T Intell Transp 19(12):3775–3784

    Article  Google Scholar 

Download references

Funding

This work is supported by the National Natural Science Foundation of China (Grant Nos. 71372086, 71831002), Program for Innovative Research Team in University of Ministry of Education of China (Grant Nos. IRT_17R13), and the Fundamental Research Funds for the Central Universities (Grant Nos. 3132019501, 3132019502).

Author information

Authors and Affiliations

  1. School of Maritime Economics and Management, Dalian Maritime University, 1 Linghai Road, Dalian, 116026, People’s Republic of China

    Sumin Chen, Qingcheng Zeng & Yushan Hu

  2. Collaborative Innovation Center for Transport Studies of Dalian Maritime University, 1 Linghai Road, Dalian, 116026, People’s Republic of China

    Sumin Chen

Authors
  1. Sumin Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Qingcheng Zeng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yushan Hu
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

The contribution of this paper is twofold: (1) The practical factors including relocation operations and interference are simultaneously considered in the scheduling of two crossover ASCs. Relocation operations are addressed by adjusting the operation sequence to reduce relocations and optimizing the dispatching for unavoidable relocation jobs. (2) We design a logic-based Benders decomposition algorithm within a branch-and-cut framework to obtain an optimal ASC schedule. The algorithm can effectively solve real-world problems and can be implemented in practical scheduling.

Corresponding author

Correspondence to Qingcheng Zeng.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

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

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, S., Zeng, Q. & Hu, Y. Scheduling optimization for two crossover automated stacking cranes considering relocation. Oper Res Int J 22, 2099–2120 (2022). https://doi.org/10.1007/s12351-020-00601-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-020-00601-6

Keywords