Convergence of artificial plant optimisation algorithm
by Juanyan Fang; Changcheng Wei
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 2, 2014

Abstract: Artificial plant optimisation algorithm is one evolutionary algorithm inspired by the plant growing process, such as photosynthesis, phototropism and apical dominance phenomena. Up to now, it has been applied to many engineering problems successfully. However, the global convergence analysis is not reported yet. In this paper, we provide the global convergence for the standard version with Markov chain. The theoretical analysis shows that the artificial plant optimisation algorithm is convergent to global optimum with probability one.

Online publication date: Sat, 20-Sep-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