arrow
返回

Research on Ship Replenishment Path Planning Based on the Modified Whale Optimization Algorithm

delete2025-03-13
delete0
delete
OA
AI
Q
Qinghua Chen
G
Gang Yao
L
Lin F. Yang *
T
Tangying Liu
孙
孙进 (Jin Sun)
蔡树向 封面图
蔡树向 (Shuxiang Cai)
DOI:10.3390/biomimetics10030179delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Ship replenishment path planning has always been a critical concern for researchers in the field of security. This study proposes a modified whale optimization algorithm (MWOA) to address single-task ship replenishment path planning problems. To ensure high-quality initial solutions and maintain population diversity, a hybrid approach combining the nearest neighbor search with random search is employed for initial population generation. Additionally, crossover operations and destroy and repair operators are integrated to update the whale's position, significantly enhancing the algorithm's search efficiency and optimization performance. Furthermore, variable neighborhood search is utilized for local optimization to refine the solutions. The proposed MWOA has been tested against several algorithms, including the original whale optimization algorithm, genetic algorithm, ant colony optimization, hybrid particle swarm optimization, and simulated annealing, using traveling salesman problems as benchmarks. Results demonstrate that MWOA outperforms these algorithms in both solution quality and stability. Moreover, when applied to ship replenishment path planning problems of varying scales, MWOA consistently achieves superior performance compared to the other algorithms. The proposed algorithm demonstrates high adaptability in addressing diverse ship replenishment path planning problems, delivering efficient, high-quality, and reliable solutions.
Keyword:
ship replenishment path planning
modified whale optimization algorithm
nearest neighbor search
cross operation
destroy and repair operators
variable neighborhood search
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

B
Biomimetics
IF:
3.9
论文数:
3.3K
被引数:
5.1K

机构

Y
Yantai University
学者数:
8.4K
论文数: 5.7K
被引数: 9.9K
引用论文

引用论文

暂无论文信息