|
|
|
|
|
Bin Li, Caijie Yang and Zhongzhen Yang
In response to the evolving challenges of the integration and combination of multiple container terminal operations under berth water depth constraints, the multi-terminal dynamic and continuous berth allocation problem emerges as a critical issue. Based...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meng Yu, Yaqiong Lv, Yuhang Wang and Xiaojing Ji
Berth allocation is a critical concern in container terminal port logistics, involving the precise determination of where and when arriving vessels should dock along a quay. With berth space limitations and a continuous surge in container handling demand...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dong Yin, Yifeng Niu, Jian Yang and Shaobo Yu
In this paper, we study the static discrete berth allocation problems (BAPs) for large-scale time-critical marine-loading scenarios. The objective is to allocate the vessels to different types of berths so that all the vessels can be loaded within the mi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Edwar Lujan, Edmundo Vergara, Jose Rodriguez-Melquiades, Miguel Jiménez-Carrión, Carlos Sabino-Escobar and Flabio Gutierrez
This work introduces a fuzzy optimization model, which solves in an integrated way the berth allocation problem (BAP) and the quay crane allocation problem (QCAP). The problem is solved for multiple quays, considering vessels? imprecise arrival times. Th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hsien-Pin Hsu and Tai-Lin Chiang
The proposed Improved Shuffled Frog-Leaping Algorithm (ISFLA) can be applied to allocate berthing positions to ships calling a container terminal with the quay being used a continuous line.
|
|
|
|
|
|