The Optimization of Container Relocation in Terminal Yards: A Computational Study Using Strategy-Iterative Deepening Branch-and-Bound Algorithm

Container relocation operations at terminal yards represent a fundamental pillar in the optimization of stowage scheduling during vessel loading, serving as a critical component of port operational efficiency. This paper focuses on the restricted container relocation problem (RCRP), in which the obj...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of marine science and engineering Vol. 13; no. 9; p. 1743
Main Authors:	Zhang, Jiangbei, Zhu, Jin
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.09.2025
Subjects:	Algorithms Branch & bound algorithms Computation Computer applications Containers Critical components Decision making Dynamic programming early stopping mechanism Efficiency Energy consumption Genetic algorithms Heuristic Heuristic methods Information storage Integer programming Mathematical programming Optimization Relocation restricted container relocation problem Stowage (onboard equipment) strategy-iterative deepening branch-and-bound algorithm strategy-oriented algorithm
ISSN:	2077-1312, 2077-1312
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!