Ternary Historical Memory-Based Robust Clustered Particle Swarm Optimization for Dynamic Berth Allocation and Crane Assignment Problem

Ternary Historical Memory-Based Robust Clustered Particle Swarm Optimization for Dynamic Berth Allocation and Crane Assignment Problem

The berth allocation and crane assignment problem (BACAP) is a key challenge in port logistics, particularly under dynamic and uncertain vessel arrival conditions. To address the limitations of existing methods in handling large-scale and high-disturbance scenarios, this paper proposes a novel optim...

Full description

Saved in:
Bibliographic Details
Main Authors: Ruiqi Wu, Shiming Mao, Yi Sun
Format: Article
Language:English
Published: MDPI AG 2025-08-01
Series:Mathematics
Subjects:
berth allocation and crane assignment
robust optimization
swarm intelligence
ternary historical memory
Online Access:https://www.mdpi.com/2227-7390/13/15/2516
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/13/15/2516

Similar Items