Abstract
The quay crane scheduling problem plays an essential role in the port container terminal management paradigm, as it is closely related to the berthing time of ships. In this article, we focus on the quay crane scheduling problem based on a special strategy, which forces the quay crane to move in one direction during the process of unloading and loading the containers. The scheduling problem that arises when this strategy is applied is called the one-way scheduling problem of quay cranes in the literature. In this article, we seek a mathematical formula for the unidirectional scheduling problem of quay cranes that can be easily solved by genetic algorithms. This algorithm provides us with the best combination of containers to unload and load at the optimal time.
Highlights
Quay cranes (QC) are the most important and critical equipment and assets of the port terminal and require the greatest investment in all other facilities
quay crane scheduling problem (QCSP) is subject to two types of physical constraints
The results indicate that the B&C is more efficient than the B&B proposed by Kim and Park (2004) and the computation time doesn't exceed 2 h
Summary
Quay cranes (QC) are the most important and critical equipment and assets of the port terminal and require the greatest investment in all other facilities. The quay crane planning problem (QCSP) refers to: (1) the assignment of quay cranes to manage unloading and loading operations; (2) the quayside service sequence of each quay crane on the ship (Daganzo 1989). The quay crane is installed on the railway track next to the quay and can move with the ship to perform operations on the quay side, as shown in figure 1. Because they are installed on the same track, they do not have the right to cross, which is the interference constraint of the crane (one-way crane).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.