arrow
Return

Optimizing continuous-time berth allocation, time-variant quay crane and yard assignment

delete2025-09-15
delete0
PRE
AI
杨志远 (Zhiyuan Yang)
M
Miaomiao Wang
S
Shuaian Wang
L
Lu Zhen *
DOI:10.1016/j.trb.2025.103317delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• We formulate a continuous-time berth allocation and yard space assignment model. • The model considers time-variant QC scheduling. • We develop an exact algorithm with some acceleration tactics. • Sensitivity analyses are conducted to derive potentially useful managerial insights.

Journal

Transportation Research Part B-Methodological cover
Transportation Research Part B-Methodological
IF:
6.3
Papers:
3.5K
Citations:
1.9W

Organization

T
The Hong Kong Polytechnic University
Scholars:
5.1K
Papers: 3.0K
Citations: 17
S
shanghai university
Scholars:
3.9W
Papers: 2.7W
Citations: 52