A stochastic model for the throughput analysis of passing dual yard cranes

Saini, Suruchika; Roy, Debjit; Koster, René de

doi:10.1016/j.cor.2017.05.012

Cited by 17 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the twin ASC scheduling study, Nguyen and Kim [8] established a mixed integer programming model to solve the priority loading and unloading order of the target container based on the buffer capacity constraint and time window constraint. Saini et al [9] constructed a two-level random model to analyze the performance of twin YCs. It was found that the interference effect between cranes would reduce the handling capacity of cranes by about 35%, and the interference delay increase with the number of shelves in the stack.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In the chromosome coding system, the gene of ASC and AGV segments corresponds to the initial task, and the corresponding container operation sequence of ASC and AGV can be obtained by decoding in turn according to the task sequence in the task segment. According to Figure 7, the decoding results show that the job sequence of seaside ASC is (1, 3, 4, 6, 8, 10, 14, 17, 19, 23); the job sequence of landside ASC is (2,5,7,9,11,12,13,16,20,22); the job sequence of agv1 is (4,14,23); the job sequence of agv2 is (3,10,17,19); and the job sequence of agv3 is (1, 6, 8).…”

Section: Chromosome Encoding and Decodingmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Scheduling of AGV and ASC in Automation Container Terminal Relay Operation Mode

Zhang

Duan

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The key problem of operation optimization for automated container terminal is the coordinated scheduling of automated quay crane (QC), automated guided vehicle (AGV), and automated stacking crane (ASC). In order to solve this problem, this paper proposed a new method to optimize the scheduling of ASC and AGV. In the automated container terminal, each container block is equipped with twin ASCs. At the same time, buffer zones are set at both ends of the container block to achieve the decoupling operation among ASC, AGV, and container truck. Considering the buffer capacity constraint and twin ASC operation interference, and introducing the design of handshake area, this paper developed a collaborative scheduling model of AGV and ASC in automatic terminal relay operation mode. This model is designed based on the genetic algorithm. The model aims to minimize the AGV waiting time and the ASC running time. The results indicated that the introduction of handshake area can effectively reduce the ASC operation interference by 10.56% on average. Also, it can be found that increasing buffer capacity can reduce the waiting time of AGV by about 4.25% on average, and the effect of relay operation is more obvious in large-scale operation. It was proved that buffer zone and handshake area can reduce task delay time and improve coordination between AGV and ASC.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Chromosome Encoding and Decodingmentioning

confidence: 99%

Cooperative Scheduling of AGV and ASC in Automation Container Terminal Relay Operation Mode

Zhang

Duan

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…In the second stage, the throughput estimates are adopted to estimate the expected sojourn time of the vessel for both loading and unloading operations. Saini et al (2017) develop a Markov-chain based model to estimate the crane interference delays in a twin-crane operated stack. Lee et al (2014) use a Markov-chain based model to estimate the port capacity.…”

Section: Literature Reviewmentioning

confidence: 99%

Effect of Service Priority and Resource Synchronization Choices on Landside Terminal Queues: Exact Analysis and Approximations

Roy

Ommeren²,

Koster

et al. 2020

SSRN Journal

Self Cite

View full text Add to dashboard Cite

With the growth of ocean transport and with increasing vessel sizes, managing congestion at the landside of container terminals has become a major challenge. A terminal landside handles containers that arrive or depart via train or truck. Large terminals have to handle thousands of trucks and dozens of trains per day. As trains run on fixed schedule, their containers are prioritized in stacking and internal transport handling. This has consequences for the service of other modes, which might be subject to delays. We analyze the dynamic interactions between the landside resources using a stochastic stylized semi-open queuing network model with bulk arrivals, shared resources, and multi-class containers. We use the theory of regenerative processes and Markov chain analysis to analyze the network. The proposed network solution algorithm works for large-scale systems and yields sufficiently accurate estimates for performance measurement. The model can capture priority service for containers at shared resources (such as stack cranes), while preserving strict handling priorities. The model is used to explore the choice of different internal transport vehicles (coupled versus decoupled operations at stack and train gantry cranes) to understand the effect on delays. Our results show that decoupled transport resources can mitigate both the delays of containers that arrive by trucks and by trains. When train arrival rates are low, prioritizing the handling of train containers at the stack cranes significantly reduces their delays. Further, this priority has little effect on the delays of handling external truck containers.

show abstract

“…Based on the properties of twin automated cranes system, Gharehgozli et al [27] formulate the multicrane scheduling problem as a multiple asymmetric generalized traveling salesman problem and develop an adaptive large neighbourhood search heuristic to solve it. In addition, Saini et al [28] present a stochastic model for two passing dual yard cranes and obtain closed-form expressions for the crane throughput capacity with interference delays. Besides, for both balanced and unbalanced stack configuration, an approximate model is developed to estimate the expected throughput times.…”

Section: Yc Scheduling Within a Single Blockmentioning

confidence: 99%

MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal

Yang

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.

show abstract

A stochastic model for the throughput analysis of passing dual yard cranes

Cited by 17 publications

References 11 publications

Cooperative Scheduling of AGV and ASC in Automation Container Terminal Relay Operation Mode

Cooperative Scheduling of AGV and ASC in Automation Container Terminal Relay Operation Mode

Effect of Service Priority and Resource Synchronization Choices on Landside Terminal Queues: Exact Analysis and Approximations

MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal

Contact Info

Product

Resources

About