Multi-objective optimization plays an important role in modern design and complex engineering applications. However, achieving an effective balance between the convergence and diversity of Pareto-optimal solutions remains challenging. This paper proposes a Sobol-driven Multi-objective Whale Migration Algorithm (SMOWMA), which extends the Whale Migration Algorithm within a non-dominated sorting and elite-selection framework. A maximin scrambled Sobol initialization scheme is first employed to improve the distribution of the initial population. An archive-guided adaptive Student-t flight mechanism is then incorporated into the leader-whale position update to dynamically balance global exploration and local exploitation. In addition, archive crowding information and archive-entry success feedback are jointly used to adjust the search behavior according to both environmental diversity and recent search performance. SMOWMA is evaluated on five widely used multi-objective benchmark suites, namely ZDT, DTLZ, WFG, UF, and CF, using four performance indicators: generational distance (GD), inverted generational distance (IGD), spacing (SP), and hypervolume (HV). The results, together with Friedman tests and Holm-adjusted Wilcoxon tests, demonstrate that SMOWMA achieves competitive overall performance in terms of convergence, diversity, and objective-space coverage, although its relative advantage remains problem-dependent. The practical applicability of SMOWMA is further examined using multi-objective welded-beam design formulations, a bi-objective four-bar truss design problem, and a five-objective car side-impact design problem. The engineering results show that SMOWMA can obtain competitive and stable approximation sets for constrained design problems with different numbers of objectives, supporting its effectiveness and applicability in multi-objective engineering optimization.
The proposed Multi-Objective Narwhal Optimizer (MONO), a Pareto-based extension of the recently developed Narwhal Optimizer, incorporates Pareto dominance, external archive management, adaptive multi-leader guidance, and crowding-distance-based diversity preservation to effectively balance convergence and exploration t...
S. Medjahed, Mourad Bouatouche, Fatima Boukhatem· Journal of Supercomputing· 0 citations
This work presents an enhanced multi-objective dung beetle optimization algorithm that is implemented to tackle the multi-objective path planning optimization problem for mobile robot, and numerical simulation results verify that the method achieves sound performance in resolving practical engineering issues.
Dynamic multi-objective optimization with a variable number of objectives is difficult because objectivedimensional variations may significantly change the Pareto front and degrade algorithm adaptability. This paper proposes an unbounded archive-based transfer strategy (UATS), which maintains an unbounded archive of of...
Zhi-Yun Xiao, Ke Shang, Ya-Jun Liu et al.· 2026 8th International Confe...· 0 citations
A multi-strategy optimized mayfly optimization algorithm (MSMOA) is proposed to improve the overall optimization performance of MOA and achieves the best overall average rank among the compared algorithms and maintained competitive performance across high-dimensional settings.
Ze Yang, Jing-Jun Wang· Scientific Reports· 0 citations
The crayfish optimization algorithm (COA) is competitive in solving continuous optimization problems, but its performance deteriorates in high-dimensional and multimodal environments because random initialization may provide uneven population coverage, exploration relies excessively on the current best solution, and ex...
Bo Jin, Wei-Min Wang· Science and innovation· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.