Integrated berth allocation and quay crane assignment with maintenance activities

With the rapid development of worldwide container trade, quay cranes and other resources in container terminals are suffering from increasing workloads. To reduce their failure probabilities, quay cranes usually require preventive maintenance. However, these important activities are often ignored du...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 57; no. 11; pp. 3478 - 3503
Main Authors Zheng, Feifeng, Li, Ying, Chu, Feng, Liu, Ming, Xu, Yinfeng
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 03.06.2019
Taylor & Francis LLC
Subjects
Algorithms
berth allocation
Computer Science
Containers
Cranes
Cranes & hoists
genetic algorithm
Genetic algorithms
integer linear programming
Integer programming
Linear programming
maintenance activities
Operations Research
Preventive maintenance
quay crane assignment
Resource management
Sensitivity analysis
Transport buildings, stations and terminals
Vessels
berth allocation; genetic algorithm; integer linear programming; maintenance activities; quay crane assignment
Online AccessGet full text

Cover

More Information
Summary:With the rapid development of worldwide container trade, quay cranes and other resources in container terminals are suffering from increasing workloads. To reduce their failure probabilities, quay cranes usually require preventive maintenance. However, these important activities are often ignored during quay crane planning in literature. This work studies an integrated berth allocation, quay crane assignment and specific quay crane assignment problem where quay crane maintenance is involved, and establishes an integer linear programming with the objective of minimising the total turnaround time. Due to the NP-hardness of the problem, CPLEX only solves instances with up to 18 vessels. For solving larger instances, we propose Left-and-Right Vessel Move (LRVM) algorithm and improved Genetic Algorithm (GA). Experimental results reveal that GA slightly outperforms LRVM with respect to solution quality as the solution of LRVM serves as one of the initial chromosomes of GA. LRVM can output feasible solutions within seconds, even for instances with 50 vessels. We further present a sensitivity analysis of preferred berth segments, and make numerical comparison on algorithm performance for the relevant model without quay crane maintenance. Both the models and proposed heuristics in this work help in dealing with the operational management of container terminal resources in practice.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2018.1539265