| Autor: |
Lu, Yongjin, Li, Kai, Lin, Rui, Wang, Yunlong, Han, Hairong |
| Zdroj: |
Journal of Marine Science & Engineering; Nov2024, Vol. 12 Issue 11, p1971, 21p |
| Abstrakt: |
Ship piping arrangement is a nondeterministic polynomial problem. Based on the advantages of the grey wolf optimization (GWO) algorithm, which is simple, easy to implement, and has few adjustment parameters and fast convergence speed, the study adopts the grey wolf optimization (GWO) algorithm to solve the ship piping arrangement problem. First, a spatial model of ship piping arrangement is established. The grid cell model and the simplified piping arrangement environment model are established using the raster method. Considering the piping arrangement constraint rules, the mathematical optimization model of piping arrangement is constructed. Secondly, the grey wolf optimization algorithm was optimized and designed. A nonlinear convergence factor adjustment strategy is adopted for its convergence factor. Powell's algorithm is introduced to improve its local search capability, which solves the problem that the grey wolf algorithm easily falls into the local optimum during the solving process. Simulation experiments show that compared with the standard grey wolf algorithm, the improved algorithm can improve the path layout effect by 38.03% and the convergence speed by 36.78%. The improved algorithm has better global search ability, higher solution stability, and faster convergence speed than the standard grey wolf optimization algorithm. At the same time, the algorithm is applied to the actual ship design, and the results meet the design expectations. The improved algorithm can be used for other path-planning problems. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
