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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of marine science and engineering Ročník 13; číslo 9; s. 1743
Hlavní autoři:	Zhang, Jiangbei, Zhu, Jin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Basel MDPI AG 01.09.2025
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!