Optimizing manpower-dependent berth allocation problem in automotive terminals

• Berth allocation problem is extended by integrating manpower assignment. • Tidal time window is different for port side and starboard side vessels. • Congestion-induced manpower ability loss is considered in manpower assignment. • Vessel-specific manpower capacity restricts manpower assignment. • Our proposed hybrid metaheuristic can solve large-scale instances effectively. This paper studies a manpower-dependent berth allocation problem arising in automotive terminals. Here, manpower refers to groups of drivers responsible for transporting cars between vessels and storage yards. We extend the classical berth allocation problem by jointly deciding berth allocations and manpower assignments, where vessel loading and unloading are constrained by limited baseline manpower ability, congestion-induced manpower ability loss, vessel-specific manpower capacity, and tidal time windows. To solve this problem, we formulate a mixed-integer linear programming model and propose a Hybrid Adaptive Large Neighborhood Search (HALNS) framework consisting of two phases: initialization using a Two-stage Parallel Genetic Algorithm (TPGA) and an ALNS-based improvement phase. Structurally, this hybrid framework integrates the global exploration capacity of TPGA with the local improvement of ALNS. Computationally, to address the complexity introduced by manpower-related features, we develop two dedicated algorithms, one for each phase, to generate high-quality solutions efficiently. Extensive numerical experiments on realistic instances demonstrate the effectiveness of the proposed methods and validate the contributions of algorithmic operators. To benchmark solution quality, we further develop a column generation algorithm that provides tighter lower bounds than the 0-1 relaxation of the MILP. Finally, sensitivity results show that a 5% increase in baseline manpower ability reduces average turnaround time by 3.81%, and improved car-flow congestion management in the terminal can reduce it by up to 10.53%.

Authors

Institutions

Publication Details

Journal
Transportation Research Part E Logistics and Transportation Review
Published
2026-04-13
DOI
https://doi.org/10.1016/j.tre.2026.104851
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Optimizing manpower-dependent berth allocation problem in automotive terminals

Ziqiao Mei, Di Zhang, Feng Chen
Transportation Research Part E Logistics and Transportation Review
Vehicle Routing Optimization Methods
article

Optimizing manpower-dependent berth allocation problem in automotive terminals

Ziqiao Mei, Di Zhang, Feng Chen
article en

Abstract

• Berth allocation problem is extended by integrating manpower assignment. • Tidal time window is different for port side and starboard side vessels. • Congestion-induced manpower ability loss is considered in manpower assignment. • Vessel-specific manpower capacity restricts manpower assignment. • Our proposed hybrid metaheuristic can solve large-scale instances effectively. This paper studies a manpower-dependent berth allocation problem arising in automotive terminals. Here, manpower refers to groups of drivers responsible for transporting cars between vessels and storage yards. We extend the classical berth allocation problem by jointly deciding berth allocations and manpower assignments, where vessel loading and unloading are constrained by limited baseline manpower ability, congestion-induced manpower ability loss, vessel-specific manpower capacity, and tidal time windows. To solve this problem, we formulate a mixed-integer linear programming model and propose a Hybrid Adaptive Large Neighborhood Search (HALNS) framework consisting of two phases: initialization using a Two-stage Parallel Genetic Algorithm (TPGA) and an ALNS-based improvement phase. Structurally, this hybrid framework integrates the global exploration capacity of TPGA with the local improvement of ALNS. Computationally, to address the complexity introduced by manpower-related features, we develop two dedicated algorithms, one for each phase, to generate high-quality solutions efficiently. Extensive numerical experiments on realistic instances demonstrate the effectiveness of the proposed methods and validate the contributions of algorithmic operators. To benchmark solution quality, we further develop a column generation algorithm that provides tighter lower bounds than the 0-1 relaxation of the MILP. Finally, sensitivity results show that a 5% increase in baseline manpower ability reduces average turnaround time by 3.81%, and improved car-flow congestion management in the terminal can reduce it by up to 10.53%.

Transportation Research Part E Logistics and Transportation ReviewVol. 211
Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 15%
Vehicle Routing Optimization Methods
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.