Nearest-Better Clustering-Based Memetic Algorithm for Berth Allocation and Crane Assignment Problem
The growth of international trade has accelerated the development of waterway transportation, thereby increasing the demand for the construction of container terminals. Optimizing the Berth Allocation and Crane Assignment Problem (BACAP) is a critical aspect of this process. In this paper, we invest...
Saved in:
| Main Author: | Jiawei Wu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10990245/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bridging the Gap Between Theory and Practice: Fitness Landscape Analysis of Real-World Problems with Nearest-Better Network
by: Yiya Diao, et al.
Published: (2025-03-01) -
Nearest-Better Network-Assisted Fitness Landscape Analysis of Contaminant Source Identification in Water Distribution Network
by: Yiya Diao, et al.
Published: (2024-12-01) -
Berth Allocation and Quay Crane Assignment Considering the Uncertain Maintenance Requirements
by: Siwei Li, et al.
Published: (2025-01-01) -
Ternary Historical Memory-Based Robust Clustered Particle Swarm Optimization for Dynamic Berth Allocation and Crane Assignment Problem
by: Ruiqi Wu, et al.
Published: (2025-08-01) -
Engineering optimization by constrained differential evolution with nearest neighbor comparison
by: Pham Hoang Anh
Published: (2016-06-01)