Abstract
In this chapter we introduce a hybrid plant propagation algorithm which combines the standard PPA which uses runners as a means for search and SbPPA which uses seeds as a means for search. Runners are more suited for exploitation while seeds, when propagated by animals and birds, are more suited for exploration. Combining the two is a natural development to design an effective global optimisation algorithm. PPA and SbPPA will be recalled. The hybrid algorithm is then presented and comparative computational results are reported.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The symbol “– ” denotes an empty cell.
References
Akay, B., Karaboga, D.: A modified artificial bee colony algorithm for real-parameter optimization. Information Sciences (2010)
Akay, B., Karaboga, D.: Artificial bee colony algorithm for large-scale problems and engineering design optimization. J. Intell. Manuf. 23(4), 1001–1014 (2012)
Ang, A.H., Tang, W.H.: Probability concepts in engineering. Planning 1(4), 1–3 (2004)
Arora, J.: Introduction to optimum design. Academic Press (2004)
Belegundu, A.D., Arora, J.: A study of mathematical programming methods for structural optimization. Part I: Theory. Int. J. Numer. Methods Eng. 21(9), 1583–1599 (1985)
Cagnina, L.C., Esquivel, S.C., Coello, C.A.C.: Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica (Slovenia) 32(3), 319–326 (2008)
Cooper, R.B.: Introduction to queueing theory (1972)
Cuevas, E., Cienfuegos, M.: A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst. Appl. Int. J. 41(2), 412–425 (2014)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Micro machine and human science, 1995. MHS’95., Proceedings of the Sixth International Symposium on micro machine and human science, pp. 39–43. IEEE (1995)
Gandomi, A.H., Yang, X.S., Alavi, A.H.: Mixed variable structural optimization using firefly algorithm. Comput. Struct. 89(23), 2325–2336 (2011)
Golinski, J.: An adaptive optimization system applied to machine synthesis. Mech. Mach. Theory 8(4), 419–436 (1974)
He, Q., Wang, L.: A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl. Math. Comput. 186(2), 1407–1422 (2007)
Hong-Yuan, W., Xiu-Jie, D., Qi-Cai, C., Fu-Hua, C.: An improved isomap for visualization and classification of multiple manifolds. In: Lee, M., Hirose, A., Hou, Z.G., Kil, R. (eds.) Neural Information Processing, Lecture Notes in Computer Science, vol. 8227, pp. 1–12. Springer, Berlin Heidelberg (2013). doi:10.1007/978-3-642-42042-9_1. http://dx.doi.org/10.1007/978-3-642-42042-9_1
Hooke, R., Jeeves, F.: Direct search solution of numerical and statistical problems. J. Assoc. Comput. Mach. 8 (1961)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, Erciyes Univ. Press, Erciyes (2005)
Karaboga, D., Akay, B.: A modified artificial bee colony (abc) algorithm for constrained optimization problems. Appl. Soft Comput. 11(3), 3021–3031 (2011)
Kıran, M.S., Gündüz, M.: A recombination-based hybridization of particle swarm optimization and artificial bee colony algorithm for continuous optimization problems. Appl. Soft Comput. 13(4), 2188–2203 (2013)
Lawrence, J.A., Pasternack, B.A.: Applied management science. Wiley New York (2002)
Liang, J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P., Coello, C.C., Deb, K.: Problem definitions and evaluation criteria for the cec 2006 special session on constrained real-parameter optimization. J. Appl. Mech. 41 (2006)
Rahnamayan, S., Tizhoosh, H., Salama, M.: Opposition-based differential evolution. IEEE Trans. Evol. Comput. 12(1), 64–79 (2008)
Salhi, A., Fraga, E.: Nature-inspired optimisation approaches and the new plant propagation algorithm. In: Proceedings of the The International Conference on Numerical Analysis and Optimization (ICeMATH ’11), Yogyakarta, Indonesia pp. K2-1–K2-8 (2011)
Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization. Nanyang Technological University, Singapore, Tech. Rep 2005005 (2005)
Sulaiman, M., Salhi, A.: The 5th international conference on metaheuristics and nature inspired computing, Morocco. http://meta2014.sciencesconf.org/40158 (2014)
Sulaiman, M., Salhi, A.: A seed-based plant propagation algorithm: the feeding station model. Sci. World J. (2015)
Sulaiman, M., Salhi, A., Selamoglu, B.I., Kirikchi, O.B.: A plant propagation algorithm for constrained engineering optimisation problems. Math. Probl. Eng. 627416, 10 pp. (2014) doi:10.1155/2014/627416
Yang, X.S.: Nature-inspired Metaheuristic Algorithms. Luniver Press (2011)
Yang, X.S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix
Constrained Global Optimization Problems
1.1 CP1
where bounds are \(0 \le x_i \le 1 (i = 1, \ldots , 9, 13), 0 \le x_i \le 100 (i= 10, 11, 12)\). The global optimum is at \(x^* = (1, 1, 1, 1, 1, 1, 1, 1, 1, , 3, 3, 3, 1), f(x^*)= -15\).
1.2 CP2
where \(78 \le x_1\le 102\), \(33 \le x_2 \le 45\), \(27 \le x_i\le 45\) \((i = 3, 4, 5)\). The optimum solution is \(x^* = (78, 33, 29.995256025682, 45, 36.775812905788)\), where \(f(x^*)= - 30665.539\). Constraints \(g_1\) and \(g_6\) are active.
1.3 CP3
where \(13 \le x_1 \le 100 \) and \(0 \le x_2 \le 100\). The optimum solution is \(x^* = (14.095, 0.84296)\) where \(f(x^*)= -6961.81388\). Both constraints are active.
1.4 CP4
where \(-10 \le x_i \le 10\) \((i = 1,\ldots , 10)\). The global optimum is \(x^* = (2.171996, 2.363683, 8.773926, 5.095984, 0.9906548, 1.430574, 1.321644, 9.828726, 8.280092, 8.375927)\), where \(f(x^*) = 24.3062091\). Constraints \(g_1, g_2, g_3, g_4, g_5\) and \(g_6\) are active.
1.5 CP5
where \(1 \le x_1 \le 1\), \(1 \le x_2 \le 1\). The optimum solution is \(x^*= (\pm 1/\sqrt{(2)}, 1/2)\),
where \(f(x^*) = 0.7499\).
1.6 Welded Beam Design Optimisation
The welded beam design is a standard test problem for constrained design optimisation, [6, 27]. There are four design variables: the width w and length L of the welded area, the depth d and thickness h of the main beam. The objective is to minimise the overall fabrication cost, under the appropriate constraints of shear stress \(\tau \), bending stress \(\sigma \), buckling load P and maximum end deflection \(\delta \). The optimization model is summarized as follows, where \(x^T=(w,L,d,h).\)
subject to
where
The simple limit or bounds are \(0.1 \le L,d \le 10\) and \(0.1 \le w,h \le 2.0.\)
1.7 Spring Design Optimisation
The main objective of this problem, [4, 5] is to minimize the weight of a tension/compression string, subject to constraints of minimum deflection, shear stress, surge frequency, and limits on outside diameter and on design variables. There are three design variables: the wire diameter \(x_1\), the mean coil diameter \(x_2\), and the number of active coils \(x_3\), [6]. The mathematical formulation of this problem, where \(x^T=(x_1,x_2,x_3)\), is as follows.
subject to
The simple limits on the design variables are \(0.05\le x_1\le 2.0 \), \(0.25 \le x_2 \le 1.3\) and \(2.0\le x_3\le 15.0.\)
1.8 Speed Reducer Design Optimization
The problem of designing speed reducer, [11], is a standard test problem, it consists of the design variables as: face width \(x_1\), module of teeth \(x_2\), number of teeth on pinion \(x_3\), length of the first shaft between bearings \(x_4\), length of the second shaft between bearings \(x_5\), diameter of the first shaft \(x_6\), and diameter of the first shaft \(x_7\) (all variables continuous except \(x_3\) that is integer). The weight of the speed reducer is to be minimized subject to constraints on bending stress of the gear teeth, surface stress, transverse deflections of the shafts and stresses in the shaft, [6]. The mathematical formulation of the problem, where \(x^T=(x_1,x_2,x_3,x_4,x_5,x_6,x_7)\), is as follows.
subject to
The simple limits on the design variables are \(2.6\le x_1\le 3.6 \), \(0.7 \le x_2 \le 0.8\), \(17\le x_3\le 28\), \(7.3\le x_4\le 8.3 \), \(7.8 \le x_5 \le 8.3\), \(2.9\le x_6\le 3.9\) and \(5.0\le x_7\le 5.5\).
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Sulaiman, M., Salhi, A. (2016). A Hybridisation of Runner-Based and Seed-Based Plant Propagation Algorithms. In: Yang, XS. (eds) Nature-Inspired Computation in Engineering. Studies in Computational Intelligence, vol 637. Springer, Cham. https://doi.org/10.1007/978-3-319-30235-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-30235-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30233-1
Online ISBN: 978-3-319-30235-5
eBook Packages: EngineeringEngineering (R0)