scholarly journals A Simulation–based Optimization Approach for Stochastic Yard Crane Scheduling Problem with Crane Mobility Constraints

Author(s):  
Frobin M. Mnale ◽  
Mohamed S. Gheith ◽  
Amr B. Eltawil
Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2236
Author(s):  
Hsien-Pin Hsu ◽  
Chia-Nan Wang ◽  
Hsin-Pin Fu ◽  
Thanh-Tuan Dang

The joint scheduling of quay cranes (QCs), yard cranes (YCs), and yard trucks (YTs) is critical to achieving good overall performance for a container terminal. However, there are only a few such integrated studies. Especially, those who have taken the vessel stowage plan (VSP) into consideration are very rare. The VSP is a plan assigning each container a stowage position in a vessel. It affects the QC operations directly and considerably. Neglecting this plan will cause problems when loading/unloading containers into/from a ship or even congest the YT and YC operations in the upstream. In this research, a framework of simulation-based optimization methods have been proposed firstly. Then, four kinds of heuristics/metaheuristics has been employed in this framework, such as sort-by-bay (SBB), genetic algorithm (GA), particle swarm optimization (PSO), and multiple groups particle swarm optimization (MGPSO), to deal with the yard crane scheduling problem (YCSP), yard truck scheduling problem (YTSP), and quay crane scheduling problem (QCSP) simultaneously for export containers, taking operational constraints into consideration. The objective aims to minimize makespan. Each of the simulation-based optimization methods includes three components, load-balancing heuristic, sequencing method, and simulation model. Experiments have been conducted to investigate the effectiveness of different simulation-based optimization methods. The results show that the MGPSO outperforms the others.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Wenqian Liu ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Baicheng Yan ◽  
Xuewei Zhang

As the core operational issue in container terminals, yard crane scheduling problem directly affects the overall operation efficiency of port connecting highway or railway transportation and sea transportation. In practice, the scheduling of yard cranes is subject to many uncertain factors, so the scheme may be inapplicable and needs to be adjusted. From the perspective of proactive strategy, considering fluctuations in arrival time of external trucks as well as varied handling volume of yard cranes, a stochastic programming model is established in this paper to obtain a fixed scheme with the minimum expected value of yard crane makespan and total task waiting time over all the scenarios. The scheme does not require rescheduling when facing different situations. Subsequently, two algorithms based on certain rules are proposed to obtain the yard crane operation scheme in the deterministic environment, which are taken as the basic solution in the uncertain conditions, and then a tailored genetic algorithm is adopted to find the optimal solution with good adaptability to the uncertain scenarios. Finally, we use small-scale examples to compare the performance of algorithms in the deterministic and uncertain environment and then analyze the relationship between different yard crane configurations and the number of tasks. Large-scale experiments are performed to study the operation efficiency of the storage yard with different handling volumes assigned to each yard crane.


2017 ◽  
Vol 107 (04) ◽  
pp. 288-292
Author(s):  
M. Kück ◽  
J. Ehm ◽  
T. Hildebrandt ◽  
M. Prof. Freitag ◽  
E. M. Prof. Frazzon

Der Trend zur Fertigung individualisierter Produkte in kleinen Losgrößen erfordert hochflexible Produktionssysteme. Durch die damit verbundene Systemdynamik wird die Reihenfolgeplanung zu einem komplexen Planungsproblem. Der Beitrag beschreibt ein simulationsbasiertes Optimierungsverfahren, welches Echtzeitinformationen zur adaptiven Selektion geeigneter Prioritätsregeln verwendet. Das Potenzial des Ansatzes wird anhand eines Anwendungsfalls aus der Halbleiterindustrie demonstriert.   The trend to manufacturing individualized products in small-scale series demands highly flexible production systems. Because of the dynamic nature of such production systems, scheduling becomes a complex planning problem with frequent need for rescheduling. This article describes a data-driven simulation-based optimization approach using real-time information for adaptive job shop scheduling. The potential of the approach is demonstrated by a use case from semiconductor industry.


2018 ◽  
Vol 108 (04) ◽  
pp. 221-227
Author(s):  
T. Donhauser ◽  
L. Baier ◽  
T. Ebersbach ◽  
J. Franke ◽  
P. Schuderer

Die Kalksandsteinherstellung weist aufgrund prozesstechnisch und zeitlich divergierender Teilprozesse einen hohen Planungs- sowie Steuerungsaufwand auf. Durch Einsatz eines simulationsgestützten Optimierungsverfahrens kann diese Komplexität bewältigt werden. Um bei hoher Lösungsqualität eine Laufzeit zu erreichen, die einen operativen Einsatz des Verfahrens gestattet, wird auf Basis einer vorangegangenen Studie ein Dekompositionsansatz implementiert und dessen Eignung durch Testläufe validiert.   Calcium silicate masonry production requires a great deal of planning and control due to the fact that subprocesses vary in terms of process technology and time. To overcome this complexity, a simulation-based optimization approach is applied. As a short runtime that allows the method to be used operationally and yet still offers a high quality of solution is crucial, a decomposition approach is implemented on the basis of a previous study and its suitability is validated by means of test runs.


Sign in / Sign up

Export Citation Format

Share Document