Effect of roots and runners in Strawberry Algorithm for optimization Problems.
DOI:
https://doi.org/10.33959/cuijca.v2i2.3Abstract
It is usually difficult for humans to solve a real world problem. Although for million of years nature has its own ways to look into these problems and solve them. Hence, now a days when man made methods do not work in these situations, they turn to Nature for problem solution. Therefore, the so called Nature inspired algorithms/ Heuristics are developing rapidly. Generally it is difficult to ï¬nd the optimum solution of the problem by using Heuristic methods. On the other hand these methods are good in approximating the solution in justiï¬able time. One of such algorithm is known as Strawberry Algorithm (SBA). Here, we propose to investigate the effect of roots and runners in SBA.
It is usually difficult for humans to solve a real world problem. Although for million of years nature has its own ways to look into these problems and solve them. Hence, now a days when man made methods do not work in these situations, they turn to Nature for problem solution. Therefore, the so called Nature inspired algorithms/ Heuristics are developing rapidly. Generally it is difficult to ï¬nd the optimum solution of the problem by using Heuristic methods. On the other hand these methods are good in approximating the solution in justiï¬able time. One of such algorithm is known as Strawberry Algorithm (SBA). Here, we propose to investigate the effect of roots and runners in SBA.
References
Y. Shi et al (2001)., “Particle swarm optimization: developments, applications and resources,†in CE.
R. Eberhart and J. Kennedy (1995), “A new optimizer using particle swarm theory,†in MHS’95.
M. Dorigo and M. Birattari (2011), “Ant colony optimization,†in Encyclopedia of Machine Learning, pp. 36–39, Springer.
M. Dorigo, M. Birattari, and T. Stu¨tzle (2006), “Ant colony optimization-artiï¬cial ants as a computational intelligence technique,†IEEE Computational Intelligence Magazine, vol. 1, no. 4, pp. 28–39.
D. Karaboga and B. Basturk (2008), “On the performance of artiï¬cial bee colony (abc) algorithm,†Appl. Soft Comput, vol. 8, no. 1, pp. 687–697.
D. Karaboga and B. Basturk (2007), “A powerful and efficient algorithm for numerical function optimization: artiï¬cial bee colony (abc) algorithm,†J. Global Optim, vol. 39, no. 3, pp. 459–471.
V. ˇCerny` (1985), “Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm,†J. Optim. Theory and Appl, vol. 45, no. 1, pp. 41–51.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi (1983), “Optimization by simulated annealing,†Science, vol. 220, no. 4598, pp. 671–680.
X.-S. Yang (2010), “Firefly algorithm, stochastic test functions and design optimisation,†Inter. J. Bio-Inspired Comput, vol. 2, no. 2, pp. 78–84.
K. M. Passino (2002), “Biomimicry of bacterial foraging for distributed optimization and control,†IEEE Control Systems, vol. 22, no. 3, pp. 52–67.
J. O. Kephart et al. (1994), “A biologically inspired immune system for computers,†in Artiï¬cial Life IV: Proceedings of the Fourth International Workshop on the Synthesis and Simulation of Living Systems, pp. 130–139.
L. N. De Castro and J. Timmis (2002), Artiï¬cial immune systems: a new computational intelligence approach. Springer Science & Business Media.
M. M. Eusuff and K. E. Lansey (2003), “Optimization of water distribution network design using the shuffled frog leaping algorithm,†J. Water Resources Planning and Management, vol. 129, no. 3, pp. 210–225.
R. Storn and K. Price (1997), “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,†J. Global Optim, vol. 11, no. 4,pp. 341–359.
R. Mallipeddi, P. N. Suganthan, Q.-K. Pan, and M. F. Tasgetiren (2011), “Differential evolution algorithm with ensemble of parameters and mutation strategies,†Appl. Soft Comput, vol. 11, no. 2, pp. 1679–1696.
E. Atashpaz-Gargari and C. Lucas (2007), “Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition,†in IEEE CEC2007., pp. 4661–4667, IEEE.
Y. Del Valle, G. K. Venayagamoorthy, S. Mohagheghi, J.-C. Hernandez, and R. G. Harley (2008), “Particle swarm optimization: basic concepts, variants and applications in power systems,†IEEE Transactions on Evolutionary Computation, vol. 12, no. 2, pp. 171–195.
M. R. AlRashidi and M. E. El-Hawary (2009), “A survey of particle swarm optimization applications in electric power systems,†IEEE Transactions on Evolutionary Computation, vol. 13, no. 4, pp. 913–918.
P. J. Fleming and R. C. Purshouse (2002), “Evolutionary algorithms in control systems engineering: a survey,†Control Engineering Practice, vol. 10, no. 11, pp. 1223–1241.
K. Ma, T. Yao, J. Yang, and X. Guan (2016), “Residential power scheduling for demand response in smart grid,†International Journal of Electrical Power & Energy Systems, vol. 78, pp. 320–325.
A. Zafar, S. Shah, R. Khalid, S. M. Hussain, H. Rahim, and N. Javaid (2017), “A meta-heuristic home energy management system,†in 31st WAINA, pp. 244–250, IEEE.
F. Merrikh-Bayat (2014), “A numerical optimization algorithm inspired by the strawberry plant,†arXiv preprint arXiv:1407.7399, 2014.
M. S. Asvini and T. Amudha (2016), “An efficient methodology for reservoir release optimization using plant propagation algorithm,†Procedia Computer Science, vol. 93, pp. 1061–1069.
M. Sulaiman and A. Salhi (2015), “A seed-based plant propagation algorithm: the feeding station model,†The Scientiï¬c World Journal, vol. 2015.
L. Davis and S. Coombs (1987), “Genetic algorithms and communication link speed design: theoretical considerations,†in Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA, Hills dale, NJ: L. Erlhaum Associates.
D. E. Goldberg and J. H. Holland (1988), “Genetic algorithms and machine learning,†Machine learning, vol. 3, no. 2, pp. 95–99.
A. E. Eiben, J. E. Smith, et al. (1999), Introduction to evolutionary computing, vol. 53.Springer, 2003.
C. A. C. Coello, “A comprehensive survey of evolutionary-based multiobjective optimization techniques,†Knowledge and Information systems, vol. 1, no. 3,pp. 269–308.
I. Fister Jr, X.-S. Yang, I. Fister, J. Brest, and D. Fister (2013), “A brief review of nature-inspired algorithms for optimization,†arXiv preprint arXiv:1307.4186.
X.-S. Yang and N.-I. M. Algorithms (2008), “Luniver press,†Beckington, UK, pp. 242–246.
H. Mu¨hlenbein, M. Schomisch, and J. Born (1991), “The parallel genetic algorithm as function optimizer,†Parallel computing, vol. 17, no. 6-7, pp. 619–632.
A. To¨rn and A. Zilinskas (1989), “Global optimization (or lecture notes in computer science; vol. 350)â€.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Nudrat Aamir, Mehwish Mushtaq, Mehwish Mushtaq, Rosemeen Riaz, Rosemeen Riaz
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
You are free to:
Share - copy and redistribute the material in any medium or format
Adapt - remix, transform, and build upon the material
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution - You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
Non Commercial - You may not use the material for commercial purposes.
No additional restrictions - You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
_.jpg)
