A Two-Stage Allocation–Transportation Framework with Improved Holistic Swarm Optimization for Port Cargo Transportation Planning

Due to the high density of warehouse distribution, port cargo is highly susceptible to fire, humidity, and various natural disasters. When these disasters occur, they can result in severe cargo losses. Meanwhile, transportation cost control has long been a prominent research focus in port logistics due to the enormous throughput. To address these problems, this paper proposes a two-stage allocation–transportation framework based on improved holistic swarm optimization. In the allocation stage, this paper designs a warehouse zoning strategy. Based on the distance criterion, a clustering method is employed to group spatially proximate warehouses into the same zone, and distribute the same cargo across different zones. In this way, the same cargo could be prevented from being completely destroyed in a disaster. In the transportation stage, this paper designs an improved holistic swarm optimization algorithm to plan the routes of cargo transportation. In this method, this paper integrates the greedy search algorithm, ant colony optimization, and adaptive swap/reversal operations with the holistic swarm optimization algorithm, which could enhance global search capability and significantly reduce the length of transportation routes. To validate the effectiveness of the proposed algorithm, experiments are conducted on both instances of varying scales and CVRPLIB benchmark instances, and the results are compared with several baseline methods. Specifically, compared with the best-performing baseline ACO, IHSO reduces the optimal route length by up to 2.08% on the self-generated instances and by 5.24% on the CVRPLIB benchmark instances. Moreover, all improvements are statistically significant under the Wilcoxon signed-rank test (p < 0.05), confirming that the advantage of IHSO is systematic rather than incidental. The proposed algorithm demonstrates high adaptability in solving port cargo path planning problems, delivering high-quality solutions.

Authors

Institutions

Publication Details

Journal
Biomimetics
Published
2026-09-17
DOI
https://doi.org/10.3390/biomimetics11090667
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

A Two-Stage Allocation–Transportation Framework with Improved Holistic Swarm Optimization for Port Cargo Transportation Planning

Shuxiang Cai, Tangying Liu, Yi Wang, Cuihua Lu et al.
Biomimetics
Vehicle Routing Optimization Methods
article

A Two-Stage Allocation–Transportation Framework with Improved Holistic Swarm Optimization for Port Cargo Transportation Planning

Shuxiang Cai, Tangying Liu, Yi Wang, Cuihua Lu, Yunsheng Li, Lin Yang
article en

Abstract

Due to the high density of warehouse distribution, port cargo is highly susceptible to fire, humidity, and various natural disasters. When these disasters occur, they can result in severe cargo losses. Meanwhile, transportation cost control has long been a prominent research focus in port logistics due to the enormous throughput. To address these problems, this paper proposes a two-stage allocation–transportation framework based on improved holistic swarm optimization. In the allocation stage, this paper designs a warehouse zoning strategy. Based on the distance criterion, a clustering method is employed to group spatially proximate warehouses into the same zone, and distribute the same cargo across different zones. In this way, the same cargo could be prevented from being completely destroyed in a disaster. In the transportation stage, this paper designs an improved holistic swarm optimization algorithm to plan the routes of cargo transportation. In this method, this paper integrates the greedy search algorithm, ant colony optimization, and adaptive swap/reversal operations with the holistic swarm optimization algorithm, which could enhance global search capability and significantly reduce the length of transportation routes. To validate the effectiveness of the proposed algorithm, experiments are conducted on both instances of varying scales and CVRPLIB benchmark instances, and the results are compared with several baseline methods. Specifically, compared with the best-performing baseline ACO, IHSO reduces the optimal route length by up to 2.08% on the self-generated instances and by 5.24% on the CVRPLIB benchmark instances. Moreover, all improvements are statistically significant under the Wilcoxon signed-rank test (p < 0.05), confirming that the advantage of IHSO is systematic rather than incidental. The proposed algorithm demonstrates high adaptability in solving port cargo path planning problems, delivering high-quality solutions.

BiomimeticsVol. 11(9)
Yantai University (CN), Civil Aviation University of China (CN)
Climate action
Openalex Percentile: Top 11%
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.