Full
Outline
Transshipment hub ports typically handle high-density water-to-water transshipment, while limited port resources pose significant challenges for efficient berth scheduling. To address this issue, a berth scheduling approach integrating multiple transshipment modes is proposed by incorporating a double-berthing operation, which allows vessels to berth side-by-side at the same berth and conduct direct transshipment via quay cranes. The double-berthing operation is further integrated with indirect transshipment and improved direct transshipment to form a coordinated transshipment framework. A mixed-integer programming model is formulated to jointly determine berth allocation and transshipment mode selection, with the objective of minimizing transshipment costs and vessel-related operational costs. The model incorporates practical constraints including transshipment time windows, vessel matching relationships, and quay crane width limitations. To solve the resulting complex optimization problem, an Adaptive Large Neighborhood Search (ALNS) algorithm is developed. Multiple destroy and repair operators together with an adaptive weight updating mechanism are designed to enhance the exploration capability and computational efficiency of the algorithm. Computational experiments of different scales are conducted, and the proposed algorithm is compared with the Gurobi solver, Genetic Algorithm (GA), and Simulated Annealing (SA). In addition, weight sensitivity analysis is performed to evaluate the robustness of the model under different cost weight settings. The applicability of the proposed approach is further verified using real arrival data from feeder berths at Shanghai Yangshan Port. The results show that, compared with traditional scheduling schemes, the proposed approach significantly reduces vessel waiting time and overall completion time while substantially decreasing truck transportation and yard storage costs. Specifically, the total vessel waiting time is reduced by 63.48%, the total operational time by 5.73%, and the overall operational cost by 65.09%. Furthermore, the improved ALNS achieves solutions within 3% of those obtained by Gurobi for small-and medium-sized instances, and obtains high-quality solutions within shorter computation times than GA and SA for large-scale instances, demonstrating strong robustness and computational efficiency.
166
32
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |
关闭全屏
No. 86 Xueyuan South Road, Haidian District, Beijing
010-62662699(Operation and Technical Support)
qkjq@cast.org.cn
Copyright © 2025 China Association for Science and Technology. All rights reserved. For all open access content, the relevant licensing terms apply.
Sponsored by the Office of the Leading Group for Cybersecurity and Informatization of CAST, and supported by Science and Technology Review Publishing House
