2017
DOI: 10.1016/j.ejor.2016.10.021
|View full text |Cite
|
Sign up to set email alerts
|

Approximate the scheduling of quay cranes with non-crossing constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 18 publications
0
16
0
Order By: Relevance
“…To stabilize the process, many control solutions have been developed over the years, yet they all have downfalls related to the complexity of the dynamics of the ship, the quay crane, the trucks, and all other means of transportation [ 46 , 47 , 48 ]. Optimization of the handling processes is a priority for all logistics companies and it is certainly a hot topic in the current literature [ 49 , 50 , 51 , 52 ], yet optimization of container handling processes only rarely takes into account the damage perspective [ 8 ], which relates to the physical impacts of containers and the surrounding infrastructure. On the other hand, novel data analytics methods are being developed along with the rising popularity of embedded IoT devices [ 53 ], which are capable of delivering adequate solutions for decision-critical operations [ 54 ].…”
Section: Review Of Recent Advancementsmentioning
confidence: 99%
“…To stabilize the process, many control solutions have been developed over the years, yet they all have downfalls related to the complexity of the dynamics of the ship, the quay crane, the trucks, and all other means of transportation [ 46 , 47 , 48 ]. Optimization of the handling processes is a priority for all logistics companies and it is certainly a hot topic in the current literature [ 49 , 50 , 51 , 52 ], yet optimization of container handling processes only rarely takes into account the damage perspective [ 8 ], which relates to the physical impacts of containers and the surrounding infrastructure. On the other hand, novel data analytics methods are being developed along with the rising popularity of embedded IoT devices [ 53 ], which are capable of delivering adequate solutions for decision-critical operations [ 54 ].…”
Section: Review Of Recent Advancementsmentioning
confidence: 99%
“…Chang et al [18] studied the quay crane allocation under a dynamic strategy. Zhang et al [19] considered the non-crossing constraint of quay cranes. The objective was to minimize the completion time of a vessel.…”
Section: Loading Operation Planningmentioning
confidence: 99%
“…Here, 0 refers to a virtual bay representing [27] No No DTIP Simulated annealing Ng and Mak [18] No No IP Branch-and-bound algorithm Gharehgozli et al [19] No No IP Branch-and-bound algorithm Ng [23] Yes No IP Dynamic program-based heuristic Galle et al [21] Yes No IP Approximate algorithm Li et al [22] Yes No MILP Rolling horizon heuristics He et al [26] Yes No MILP GA and particle swarm algorithm Briskorn et al [30] Yes No MILP Bucket brigade algorithm Sha et al [25] Yes No MILP Scheduling algorithm Zhang et al [34] Yes No MILP Approximate approach Sharif et al [20] Yes No Simulation ABM with DP Fotuhi et al [24] Yes No Simulation ABM; reinforcement learning Briskorn and Angeloudis [29] Yes No Simulation Graphical model and polynomial algorithms Ozcan and Eliiyi [31] Yes No Simulation Reward-based stacking algorithm Kress et al [32] Yes No Simulation Bounded DP Jaehn and Kress [33] Yes Yes DTIP Bucket brigade algorithm Carlo and Martínez-Acevedo [8] Yes Yes MILP Priority rules Gharehgozli et al [14] Yes Yes Simulation Priority and operation rules e container carried across the handshake bay is handled by the twin ASCs sequentially: the crane p carries the container from its original location to the handshake bay, and then, the crane c takes it from the handshake bay to the destination.…”
Section: Problem Descriptionmentioning
confidence: 99%