Highlights Study integrated model for discrete berth allocation, quay crane assignment and yard assignment problem. Consider both transshipment activities and import/export activities. An iterative heuristic is developed to solve the model on large-scale instances. Computational experiments are conducted to verify the effectiveness of the algorithm and model.
Abstract This study investigates a problem regarding simultaneous allocations of berths, quay cranes, and yards in transshipment hubs. Transshipment and import/export activities, general quay crane assignment decisions, and productivity losses incurred by quay crane interference are considered. A mixed-integer programming model is proposed to minimize the total cost, including speed-up cost, delay cost, penalty cost of vessels, and operational cost on container loading and unloading. An iterative heuristic is developed to solve the proposed model. Extensive numerical experiments are conducted to validate the effectiveness of the proposed model and the efficiency of the algorithm.
Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations
2019-11-16
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Cranes for shipbuilding berths
Engineering Index Backfile | 1907
|Cooperative allocation method and device for continuous berths and time-varying quay cranes of wharf
Europäisches Patentamt | 2024
|Design Approach for West Quay Berths at Chennai Port
British Library Conference Proceedings | 2001
|Mobile cranes for railway yards
Engineering Index Backfile | 1930
Lifting cranes in shipbuilding yards
Engineering Index Backfile | 1919