The vertex cover problem seeks a minimum-cardinality set of vertices in a graph such that every edge is incident to at least one selected vertex. As an NP-hard combinatorial optimisation challenge, it ...

In this study, a multi-objective particle swarm optimization (MOIPSO) algorithm is proposed to address complex optimization problems, including real-world engineering challenges. The algorithm retains ...