Jumping particle swarm optimisation method for solving minimum weight vertex cover problem

The minimum weight vertex cover problem (MWVCP) is one of the classic combinatorial optimisation problems. In this paper, we have proposed a modified jumping particle swarm optimisation approach, named JPS-VC, for MWVCP. This method contains two new local search approaches incorporated with the jumping particle swarm optimisation approach and it admits several remarkable features such as novel construction of feasible solution and also the quick conversion of feasible solution to optimal solution. The computed results indicate that the proposed approach has got appreciable performance over the recent state-of-the-art algorithms.

Automated summary

The paper introduces a modified jumping particle swarm optimization approach, JPS-VC, for the minimum weight vertex cover problem (MWVCP), showing significant performance improvement over recent state-of-the-art algorithms.