Testing The Performance Of Plant Growth Optimization Algorithm

Mohan Rao N.*, K. V. Nageswara Rao**
*Associate Professor, Department of Mechanical Engineering, University College of Engineering, JNTU Kakinada, Vizianagaram.
** PG Scholar, Department of Mechanical Engineering, University college of Engineering, Kakinada, JNTU Kakinada.
Periodicity:May - July'2013
DOI : https://doi.org/10.26634/jfet.8.4.2357

Abstract

This paper presents an optimization algorithm called Plant Growth Optimization (PGO) and it is applied for different test functions to evaluate its performance. The PGO is based on the plant growth characteristics in which an artificial plant growth model is built including leaf growth, branching, phototropism, and spatial occupancy. The plant growth process is that a plant grows a trunk from its root; some branches will grow from the nodes on the trunk; and then some new branches will grow from the nodes on the branches. Such process is repeated, until a plant is formed. This process is simulated in this algorithm by producing new points (branch points) from initial points (roots). After producing the new points (branch points), the algorithm searches the optimum solution around these points through the operation called leaf growth (for local search). This is used to ensure the accuracy of the solution. It is one of the evolutionary algorithms like the Genetic algorithm. A MATLAB code for the plant growth optimization algorithm is developed and it is tested for three classical test functions. The results are tabulated and plotted.

Keywords

Global Optimization, Plant Growth Optimization Algorithm, Nelder-Mead Search Method, Standard Test Functions: Himmelblau’s Function, Beale’s Function and the Powell’s Quartic Function.

How to Cite this Article?

Rao , N. M., and Rao, K. V. N. (2013). Testing the Performance of Plant Growth Optimization Algorithm. i-manager’s Journal on Future Engineering and Technology, 8(4), 16-21. https://doi.org/10.26634/jfet.8.4.2357

References

[1]. Cai, W., Yang, W, & Chen, X. (2008). A Global Optimization Algorithm Based on Plant Growth Theory: Plant Growth Optimization. International Conference on Intelligent Computation Technology and Automation (ICICTA), 1, 1194-1199.
[2]. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man and Cybernetics, Part B, 26, 29–41.
[3]. Dorigo, M., & Thomas, S., (2004). Ant Colony Optimization. Cambridge: MIT Press.
[4]. Duan, H.B. (2005). Ant Colony Algorithms: Theory and Applications. Beijing: Science Press.
[5]. Kennedy, J., & Eberhart, R.C. (1995). Particle swarm optimization. Proc. of IEEE International Conference on Neural Network, Piscataway, NJ, 1942–1948.
[6]. Li, X. L., Shao Z.J., & Qian, J.X. (2002). An optimizing method based on autonomous animate: Fishswarm algorithm. System Engineering Theory and Practice, 11, 32-38.
[8]. Srinivasa, R. R., & Narasimham, S. V. L. (2008). Optimal Capacitor placement in a radial distribution system using plant growth simulation algorithm. Proceeding of World Academy of Science, Engineering and Technology, 35, 716-723.
[9]. Tong, L., Wang, C., Wang, W., & Su, W. (2005). A global optimization bionics algorithm for solving integer programming-plant growth simulation algorithm. Systems Engineering-Theory & Practice, 25, 76-85.
[10]. Wang, C., & Cheng, H. (2009). Transmission network optimal planning based on plant growth simulation algorithm. European Transactions on Electrical Power, 19, 291-301.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.