An Improved Evolutionary Multitasking Algorithm for Multitasking Berth Allocation Problem

The terminal’s resource management is a significant topic in maritime technology that directly affects the operational efficiency of ports. As an important resource in the terminal, the berth allocation problem (BAP) has been widely studied. In this article, to meet the requirement for unified management of multiple independent BAPs by terminal managers, we model such a complex BAP variant as a multitasking BAP (MBAP) that dealing with multiple berths simultaneously. To efficiently solve the MBAP, we propose an improved evolutionary multitask algorithm (IEMA) to simultaneously minimize the total waiting time with three novel designs. Firstly, the solution space is represented by a single population of multiple variables, which is suitable for implicit knowledge transfer and can avoid infeasible solutions. Secondly, a first come first served strategy is adopted to reinitialize a part of individuals to accelerate convergence. Finally, we develop a hybrid genetic mechanism based on the two-dimensional representation characteristics of the MBAP. Experimental results on a series of generated cases show the effectiveness and superiority of the proposed approach.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11042967
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Evolutionary Multitasking Algorithm for Multitasking Berth Allocation Problem

Zhi‐Hui Zhan, Si-Cheng Wang, Fei Ji, Xin-Xin Xu et al.
Advanced Manufacturing and Logistics Optimization
article

An Improved Evolutionary Multitasking Algorithm for Multitasking Berth Allocation Problem

Zhi‐Hui Zhan, Si-Cheng Wang, Fei Ji, Xin-Xin Xu, Rong Wang, Jun Hong
article en

Abstract

The terminal’s resource management is a significant topic in maritime technology that directly affects the operational efficiency of ports. As an important resource in the terminal, the berth allocation problem (BAP) has been widely studied. In this article, to meet the requirement for unified management of multiple independent BAPs by terminal managers, we model such a complex BAP variant as a multitasking BAP (MBAP) that dealing with multiple berths simultaneously. To efficiently solve the MBAP, we propose an improved evolutionary multitask algorithm (IEMA) to simultaneously minimize the total waiting time with three novel designs. Firstly, the solution space is represented by a single population of multiple variables, which is suitable for implicit knowledge transfer and can avoid infeasible solutions. Secondly, a first come first served strategy is adopted to reinitialize a part of individuals to accelerate convergence. Finally, we develop a hybrid genetic mechanism based on the two-dimensional representation characteristics of the MBAP. Experimental results on a series of generated cases show the effectiveness and superiority of the proposed approach.

Nankai University (CN), Ocean University of China (CN), South China University of Technology (CN)
National Natural Science Foundation of China, Nankai University, Fundamental Research Funds for the Central Universities, Research and Development
Openalex Percentile: Top 79%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Improved Evolutionary Multitasking Algorithm for Multitasking Berth Allocation Problem — Zhi‐Hui Zhan, Si-Cheng Wang, et al. · (2025) | TGRS Research Map | TGRS