Jumping particle swarm optimisation method for solving minimum weight vertex cover problem
by S. Balaji; S.T. Vikram; G. Kanagasabapathy
International Journal of Bio-Inspired Computation (IJBIC), Vol. 18, No. 3, 2021

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.

Online publication date: Mon, 29-Nov-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com