Parallel ant colony optimisation algorithm for continuous domains on graphics processing unit
by Chen Wang; Zengqiang Chen
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 3, 2013

Abstract: A novel parallel approach to run continuous ant colony optimisation (CACO) algorithm on graphic processing unit (GPU) is presented in this paper for solving large scale continuous optimisation problem. CACO which is an extension to continuous domains from standard ACO is a kind of population-based meta-heuristics in essence. The mechanism of algorithm is described in detail. Its parallel implementation on compute unified device architecture (CUDA) is proposed in our work. The experiment results on actual hardware to optimise many-dimensions test functions are given. The results and analyses show the excellent performance of algorithm.

Online publication date: Sat, 10-May-2014

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 Computing Science and Mathematics (IJCSM):
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