Optimization of Container Handling Systems in Automated Maritime Terminal

Dkhil, Hamdi; Yassine, Adnan; Chabchoub, Habib

doi:10.1007/978-3-642-34300-1_29

Cited by 9 publications

(7 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (20) specifies the updated plan handling time of the gantry trolley of the quay crane. The actual handling time of the nth container by the yard crane is determined in constraints (21) and (22). Constraints (23) and (24) ensure that each container is served by a yard crane under the time windows.…”

Section: Phase Ii: Mathematical Formulation For Agv Schedulingmentioning

confidence: 99%

“…On the basis of the hybrid flow shop scheduling problem (HFSS), Yang [21] proposed the dual-objective joint optimization model for a quay crane, truck, and yard crane with the goal of minimizing total operation time and energy consumption. Al-Dhaheri [22] proposed an optimization model aiming at minimizing the makespan of quay crane and the number of AGVs and solved the model with Cplex. Yang [23] studied the integrated scheduling of quay crane, AGV, and yard crane for simultaneous loading and discharging operations, and designed a general algorithm based on preventive congestion rules.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint Configuration and Scheduling Optimization of a Dual-Trolley Quay Crane and Automatic Guided Vehicles with Consideration of Vessel Stability

2019

View full text Add to dashboard Cite

This study proposes a formulation to optimize operational efficiency of a dual-trolley quay crane and automatic guided vehicles (AGVs) to reduce energy consumption at an automated container terminal. A two-phase model is used to minimize energy consumption during loading and discharging operations, as well as maximize the utilization rate of the AGVs, with consideration of relevant constraints such as the capacity of buffers for the quay crane (QC) and yard, the stability of vessel, the maximum endurance of an AGV, and the available laytime for handling. We propose a constrained partial enumeration strategy to construct quay crane schedules and a genetic algorithm to solve the AGV scheduling problem. Finally, Yangshan Phase IV automated container terminal's data is used to verify the validity and applicability of the proposed model. The results of the tests provide evidence that the proposed method can improve energy efficiency.

show abstract

Section: Phase Ii: Mathematical Formulation For Agv Schedulingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Joint Configuration and Scheduling Optimization of a Dual-Trolley Quay Crane and Automatic Guided Vehicles with Consideration of Vessel Stability

2019

View full text Add to dashboard Cite

show abstract

“…The deterministic mathematical model is extended from a former one, and the proposed approach has been fully implemented in terminal operation. HamdiDkhil [16] presented a 0-1 integer programming model to resolve the planning of QC-AGV-ASC as a whole, under three different terminal layouts. It is verified that the algorithm is able to get a schedule of handling 500 containers in 1 minute.…”

Section: Related Workmentioning

confidence: 99%

Modified Hungarian Algorithm for Real-Time ALV Dispatching Problem in Huge Container Terminals

Bian¹,

Mi²,

Yang³

et al. 2014

JNW

View full text Add to dashboard Cite

It is a fundamental decision making process in container terminals to allocate container transporting works among ALVs. Nowadays, container terminals tend to be larger in storage space and more efficient in handling. As a result, estimations of ALV travel times could be inaccurate, the scale of ALV work allocation could be quite large, and a fixed handling sequence could be hardly ensured beforehand. Hence, it is presented a real-time dispatching method, consisting of an allocation model for instantaneous ALV dispatching, and a set of events which trigger a new instantaneous dispatching. A modified Hungarian Algorithm is applied to solve the instantaneous dispatching model, and it is verified that the modified Algorithm outperforms the original one, even CPLEX, in solving these allocation problems.

show abstract

“…Hu and Hu [28] studied the coordinated scheduling mechanism among the three devices, proposed the full-degree-of-freedom scheduling problem of integrated shore bridges, stacking cranes, and YTs, and established a mixed integer programming model, but AGV was not considered in this study. Dkhil et al [29] proposed the QC-AGV-ASC integrated model considering the interaction and constraints among various resources of the terminals.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

The Optimization of Automated Container Terminal Scheduling Based on Proportional Fair Priority

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

With the goal of maximizing the efficiency of automated container terminals, taking the loading and unloading time as the research object, the integrated optimization of automated container terminal scheduling with proportional fair priority is established by setting the priority parameters under the premise of balancing the operation efficiency of each container ship at the berth. The model considers separate assignments of general containers and special containers in the actual operation at the automated container terminal, which is never considered in other literatures. A proportional fairness algorithm (PFA) is designed to solve the problem, taking the maximum of the ratio of quantities of remaining loading and unloading containers of each container ship to the distance of empty AGVs/YTs as the proportional fair priority. The priority of all current tasks is ranked, and the highest priority task is fulfilled first. Different from the published literature, the study of this paper can be presented in two aspects. One is in the modeling. This includes (i) formalizing the description of the purpose of the model and (ii) conducting a real-world coordination of four types of equipment that incorporate at automated container terminals which considers different operations between general goods and special goods in the actual automated terminal operations. The other is that PFA is applied to deal with the integrated scheduling whose results are better with the balance of efficiency and fairness.

show abstract

Optimization of Container Handling Systems in Automated Maritime Terminal

Cited by 9 publications

References 9 publications

Joint Configuration and Scheduling Optimization of a Dual-Trolley Quay Crane and Automatic Guided Vehicles with Consideration of Vessel Stability

Joint Configuration and Scheduling Optimization of a Dual-Trolley Quay Crane and Automatic Guided Vehicles with Consideration of Vessel Stability

Modified Hungarian Algorithm for Real-Time ALV Dispatching Problem in Huge Container Terminals

The Optimization of Automated Container Terminal Scheduling Based on Proportional Fair Priority

Contact Info

Product

Resources

About