{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T10:02:08Z","timestamp":1789639328955,"version":"4.0.0"},"reference-count":45,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:00:00Z","timestamp":1789603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Biomimetics"],"abstract":"<jats:p>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\u2013transportation 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 &lt; 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.<\/jats:p>","DOI":"10.3390\/biomimetics11090667","type":"journal-article","created":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T08:03:17Z","timestamp":1789632197000},"page":"667","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Two-Stage Allocation\u2013Transportation Framework with Improved Holistic Swarm Optimization for Port Cargo Transportation Planning"],"prefix":"10.3390","volume":"11","author":[{"given":"Cuihua","family":"Lu","sequence":"first","affiliation":[{"name":"The Third School, Naval Aviation University, Yantai 264001, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"methodology","vocabulary":"credit"},{"role":"data-curation","vocabulary":"credit"},{"role":"formal-analysis","vocabulary":"credit"},{"role":"investigation","vocabulary":"credit"},{"role":"writing-original-draft","vocabulary":"credit"}]},{"given":"Yunsheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electromechanical and Automotive Engineering, Yantai University, Yantai 264005, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"writing-original-draft","vocabulary":"credit"},{"role":"data-curation","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"}]},{"given":"Lin","family":"Yang","sequence":"additional","affiliation":[{"name":"The Third School, Naval Aviation University, Yantai 264001, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"project-administration","vocabulary":"credit"},{"role":"data-curation","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3331-6250","authenticated-orcid":false,"given":"Tangying","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Electromechanical and Automotive Engineering, Yantai University, Yantai 264005, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"visualization","vocabulary":"credit"},{"role":"resources","vocabulary":"credit"},{"role":"data-curation","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electromechanical and Automotive Engineering, Yantai University, Yantai 264005, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"visualization","vocabulary":"credit"},{"role":"resources","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"}]},{"given":"Shuxiang","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Electromechanical and Automotive Engineering, Yantai University, Yantai 264005, China"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"project-administration","vocabulary":"credit"},{"role":"visualization","vocabulary":"credit"},{"role":"resources","vocabulary":"credit"}]}],"member":"1968","published-online":{"date-parts":[[2026,9,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1080\/13675567.2023.2187355","article-title":"A Systematic Literature Review on Port Competitiveness","volume":"28","author":"Yu","year":"2025","journal-title":"Int. J. Logist. Res. Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.32750\/2025-0209","article-title":"Ports\u2019 Contribution to the Financial and Economic Security of Logistics Systems","volume":"2","author":"Iefimova","year":"2025","journal-title":"Eur. Sci. J. Econ. Financ. Innov."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/mnsc.22.6.629","article-title":"Optimal Storage Assignment in Automatic Warehousing Systems","volume":"22","author":"Hausman","year":"1976","journal-title":"Manag. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","article-title":"Design and Control of Warehouse Order Picking: A Literature Review","volume":"182","author":"Roodbergen","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Yin, R., and Lu, P. (2022). A Cluster-First Route-Second Constructive Heuristic Method for Emergency Logistics Scheduling in Urban Transport Networks. Sustainability, 14.","DOI":"10.3390\/su14042301"},{"key":"ref_6","first-page":"251","article-title":"A Two-Stage Clustering\u2013Evolutionary Framework with Adaptive Search Control for the Vehicle Routing Problem with Time Windows","volume":"3","author":"Liu","year":"2025","journal-title":"J. Oper. Strateg. Anal."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The Vehicle Routing Problem: State of the Art Classification and Review","volume":"99","author":"Braekers","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10288-007-0063-3","article-title":"Recent Advances in Vehicle Routing Exact Algorithms","volume":"5","author":"Baldacci","year":"2007","journal-title":"4OR"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Boluf\u00e9-R\u00f6hler, A., and Tamayo-Vera, D. (2025). Machine Learning for Enhancing Metaheuristics in Global Optimization: A Comprehensive Review. Mathematics, 13.","DOI":"10.20944\/preprints202507.2611.v1"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/978-3-319-50920-4_19","article-title":"Swarm Intelligence: A Review of Algorithms","volume":"Volume 10","author":"Patnaik","year":"2017","journal-title":"Nature-Inspired Computing and Optimization"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s12046-021-01722-0","article-title":"A Branch-and-Bound-Based Solution Method for Solving Vehicle Routing Problem with Fuzzy Stochastic Demands","volume":"46","author":"Singh","year":"2021","journal-title":"S\u0101dhan\u0101"},{"key":"ref_12","unstructured":"Babaki, B., Jena, S.D., and Charlin, L. (2022, January 1). Neural Column Generation for Capacitated Vehicle Routing. Proceedings of the AAAI 2022 Workshop on Machine Learning for Operations Research, Virtual."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2017.08.015","article-title":"A Branch-and-Cut Algorithm for the Time Window Assignment Vehicle Routing Problem","volume":"89","author":"Dalmeijer","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_14","unstructured":"Alkhalifa, R., Alkhomayes, F., Almazroua, B., Alhaidan, D., Alothman, M., and Almuhaidib, J. (2025). A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem. arXiv."},{"key":"ref_15","unstructured":"Fakhravar, H. (2022). Combining Heuristics and Exact Algorithms: A Review. arXiv."},{"key":"ref_16","first-page":"934","article-title":"The Applications of Hybrid Approach Combining Exact Method and Evolutionary Algorithm in Combinatorial Optimization","volume":"10","author":"Duan","year":"2023","journal-title":"J. Comput. Des. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1007\/s10489-025-06932-1","article-title":"An Improved Graph Attention Network Combined with Reinforcement Learning for Capacitated Vehicle Routing Problem","volume":"55","author":"Bai","year":"2025","journal-title":"Appl. Intell."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Duan, L., Zhan, Y., Hu, H., Gong, Y., Wei, J., Zhang, X., and Xu, Y. (2020). Efficiently Solving the Practical Vehicle Routing Problem: A Novel Joint Learning Approach. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Virtual, 23 August 2020, ACM.","DOI":"10.1145\/3394486.3403356"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Cao, L., Wang, M., and Xiong, X. (2025). A Large Language Model-Enhanced Q-Learning for Capacitated Vehicle Routing Problem with Time Windows. arXiv.","DOI":"10.1109\/ITSC60802.2025.11423177"},{"key":"ref_20","first-page":"1","article-title":"Deep Learning Workload Scheduling in GPU Datacenters: A Survey","volume":"56","author":"Ye","year":"2024","journal-title":"ACM Comput. Surv."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Ghimire, D., Kil, D., and Kim, S. (2022). A Survey on Efficient Convolutional Neural Networks and Hardware Acceleration. Electronics, 11.","DOI":"10.3390\/electronics11060945"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Justus, D., Brennan, J., Bonner, S., and McGough, A.S. (2018). Predicting the Computational Cost of Deep Learning Models. Proceedings of the 2018 IEEE International Conference on Big Data (Big Data), Seattle, WA, USA, 10\u201313 December 2018, IEEE.","DOI":"10.1109\/BigData.2018.8622396"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1186\/s40537-022-00593-4","article-title":"Vehicle Routing Problems Based on Harris Hawks Optimization","volume":"9","author":"Alweshah","year":"2022","journal-title":"J. Big Data"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"20","DOI":"10.9734\/ajrcos\/2025\/v18i2559","article-title":"Ant Colony Optimization (ACO) for Traveling Salesman Problem: A Review","volume":"18","author":"Eido","year":"2025","journal-title":"Asian J. Res. Com. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"012001","DOI":"10.1088\/1742-6596\/1872\/1\/012001","article-title":"Grey Wolf Optimizer Algorithm for Solving the Multi Depot Vehicle Routing Problem and Its Implementation","volume":"1872","author":"Diastivena","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"012006","DOI":"10.1088\/1742-6596\/1726\/1\/012006","article-title":"Firefly Algorithm for Multi-Type Vehicle Routing Problem","volume":"1726","author":"Jamil","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"726564","DOI":"10.1155\/2012\/726564","article-title":"A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems","volume":"2012","author":"Kao","year":"2012","journal-title":"Math. Probl. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s12065-025-01048-4","article-title":"Novel Hybrid Swarm Intelligence Algorithm for Solving the Capacitated Vehicle Routing Problem Efficiently","volume":"18","author":"Pham","year":"2025","journal-title":"Evol. Intel."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"392789","DOI":"10.1155\/2013\/392789","article-title":"A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem","volume":"2013","author":"Zhou","year":"2013","journal-title":"Math. Probl. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"116583","DOI":"10.1016\/j.knosys.2026.116583","article-title":"Octopus Camouflage Optimization: A Population-State-Aware Metaheuristic","volume":"350","author":"Farek","year":"2026","journal-title":"Knowl.-Based Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.apm.2023.10.045","article-title":"Snow Geese Algorithm: A Novel Migration-Inspired Meta-Heuristic Algorithm for Constrained Engineering Optimization Problems","volume":"126","author":"Tian","year":"2024","journal-title":"Appl. Math. Model."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"104178","DOI":"10.1016\/j.asej.2026.104178","article-title":"Baboon Optimization Algorithm: A Novel Nature-Inspired Metaheuristic Algorithm for Optimization Problems","volume":"17","author":"Deng","year":"2026","journal-title":"Ain Shams Eng. J."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"118208","DOI":"10.1016\/j.cma.2025.118208","article-title":"Holistic Swarm Optimization: A Novel Metaphor-Less Algorithm Guided by Whole Population Information for Addressing Exploration-Exploitation Dilemma","volume":"445","author":"Akbari","year":"2025","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2908","DOI":"10.1007\/s10489-022-03555-8","article-title":"A Greedy Search Based Evolutionary Algorithm for Electric Vehicle Routing Problem","volume":"53","author":"Hien","year":"2023","journal-title":"Appl. Intell."},{"key":"ref_35","unstructured":"Alimoradi, A. (2025). Bi Objective Multi Depot Location Routing Problem with Time Window for EVs. [Master\u2019s Thesis, Ontario Tech University]."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"13127","DOI":"10.1007\/s00500-024-10340-x","article-title":"A Hybridization of Grey Wolf Optimizer and Genetic Algorithm for the Traveling Salesman Problems","volume":"28","author":"Rahaman","year":"2024","journal-title":"Soft Comput."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"042067","DOI":"10.1088\/1742-6596\/1952\/4\/042067","article-title":"An Improved Genetic Algorithm for Solving TSP","volume":"1952","author":"Tao","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Stodola, P., Mazal, J., Podhorec, M., and Litvaj, O. (2014). Using the Ant Colony Optimization Algorithm for the Capacitated Vehicle Routing Problem. Proceedings of the 16th International Conference on Mechatronics-Mechatronika 2014, Brno, Czech Republic, 3\u20135 December 2014, IEEE.","DOI":"10.1109\/MECHATRONIKA.2014.7018311"},{"key":"ref_39","first-page":"2231","article-title":"An Efficient Implementation of Genetic Algorithms for Constrained Vehicle Routing Problem","volume":"Volume 3","author":"Filipec","year":"1998","journal-title":"Proceedings of the SMC\u201998 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), San Diego, CA, USA, 14 October 1998"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","article-title":"Hybrid Discrete Particle Swarm Optimization Algorithm for Capacitated Vehicle Routing Problem","volume":"7","author":"Chen","year":"2006","journal-title":"J. Zhejiang Univ.-Sci. A"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Tian, A.-Q., Liu, F.-F., and Wang, X.-Y. (2026). Surrogate-Assisted Rezone-Enhanced Multi-Objective Adaptive Evolutionary Algorithm for Truck\u2013UAV Collaborative Delivery Route Optimization. J. Superintelligence, 1.","DOI":"10.3390\/superintelligence1010003"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"102490","DOI":"10.1016\/j.swevo.2026.102490","article-title":"K-DPSA: A Hierarchical Surrogate-Assisted Evolutionary Algorithm for Expensive Constrained Multi-Objective Optimization with Application to UAV Path Planning","volume":"107","author":"Tian","year":"2026","journal-title":"Swarm Evol. Comput."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"127792","DOI":"10.1016\/j.eswa.2025.127792","article-title":"A Prediction Approach Based on Long Short-Term Memory Networks for Dynamic Multiobjective Optimization","volume":"283","author":"Xu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"3866","DOI":"10.1109\/TSMC.2025.3547618","article-title":"Handling Multiobjective Optimization Problems With Complex Constraints: A Constraints Grouping-Based Approach","volume":"55","author":"Xu","year":"2025","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."}],"container-title":["Biomimetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2313-7673\/11\/9\/667\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T09:05:02Z","timestamp":1789635902000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2313-7673\/11\/9\/667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,17]]},"references-count":45,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2026,9]]}},"alternative-id":["biomimetics11090667"],"URL":"https:\/\/doi.org\/10.3390\/biomimetics11090667","relation":{},"ISSN":["2313-7673"],"issn-type":[{"value":"2313-7673","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,17]]}}}