An efficient heuristic algorithm for solving a multi-vessel quay crane scheduling problem in container terminals Online publication date: Mon, 03-Apr-2023
by Yi Ding; Xiazhong Chen; Kaimin Chen
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 16, No. 3/4, 2023
Abstract: As an important node of a multimodal container transport hub, the container terminal occupies a critical position in the whole process of container transportation and the global supply chain network. With the increasing size of container vessels, improving the handling efficiency of multiple vessels at berth in a given port becomes a complex problem to solve. We formulate a mixed-integer linear programming model to minimise the vessel services time, the total completion and travel times of quay cranes (QCs) among multiple vessels. To solve the proposed model, we develop a particle swarm optimisation (PSO) algorithm incorporated with a tailored initial-solution generation algorithm. Furthermore, a couple of acceleration strategies are designed to improve the solution quality and shorten computation time. The results of numerical experiments on real-life instances validate the proposed model and the efficiency of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook