A selective approach to parallelise Bees Swarm Optimisation metaheuristic: application to MAX-W-SAT
by Souhila Sadeg, Habiba Drias
International Journal of Innovative Computing and Applications (IJICA), Vol. 1, No. 2, 2007

Abstract: In this paper, we present a parallel version of the Bees Swarm Optimisation (BSO) metaheuristic. Firstly, we present a sequential algorithm, then we expose the original and innovative approach used for its parallelisation. Experiments comparing the performances of the sequential and the parallel algorithms in solving instances of the weighted maximum satisfiability problem are presented. A comparison is also done between BSO and other metaheuristics performances.

Online publication date: Tue, 22-Jan-2008

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 Innovative Computing and Applications (IJICA):
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