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

Authors: S. Balaji; S.T. Vikram; G. Kanagasabapathy

Addresses: Department of Mathematics, SASTRA Deemed University, Thanjavur 613-401, India ' Department of Mathematics, SASTRA Deemed University, Thanjavur 613-401, India ' Department of Computer Applications, Anjalai Ammal Mahalingam Engineering College, Thiruvarur, 614-403, India

Abstract: 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.

Keywords: minimum weight vertex cover; discrete particle swarm optimisation; DPSO; computational methods; combinatorial optimisation.

DOI: 10.1504/IJBIC.2021.119198

International Journal of Bio-Inspired Computation, 2021 Vol.18 No.3, pp.143 - 152

Accepted: 27 Sep 2020
Published online: 29 Nov 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article