In this paper, we build upon the previous efforts to enhance the search ability of Moead (a decomposition-based algorithm), by investigating the idea of evolving the whole population simultaneously at once. We thereby propose new alternative selection and replacement strategies that can be combined in different ways within a generic and problem-independent framework. To assess the performance o...

Slime Mould Algorithm (SMA) has been widely noticed by researchers for its powerful multi-point search capability and simple feasible structure, many advanced versions of SMA have also proposed. However, most existing methods focus on the single-objective research domain, multi-objective remains relatively scarce; moreover, basic lacks global capability, extension to domain easily leads loss so...

Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective (MOGSK), to deal with (MOPs). MOGSK employs an external archive population store nondominated solution...