Abstract
This paper presents dynamic version of the tree growth algorithm. Tree growth algorithm is a novel optimization approach that belongs to the group of swarm intelligence metaheuristics. Only few papers addressed this method so far. This algorithm simulates the competition between the trees for resources such as food and light. The dynamic version of the tree growth algorithm introduces dynamical adjustment of exploitation and exploration search parameters. The efficiency and robustness of the proposed method were tested on a well-known set of standard global unconstrained benchmarks. Besides numerical results obtained by dynamic tree growth algorithm, in the experimental part of this paper, we have also shown comparative analysis with the original tree growth algorithm, as well as comparison with other methods, which were tested on the same benchmark set. Since many problems from the domains of industrial and service systems can be modeled as global optimization tasks, dynamic tree growth algorithm shows great potential in this area and can be further adapted for tackling many real-world unconstrained and constrained optimization challenges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Leusin, M.E., Frazzon, E.M., Maldonado, M.U., Kück, M., Freitag, M.: Solving the job-shop scheduling problem in the Industry 4.0 era. Technologies 6(4) (2018). https://doi.org/10.3390/technologies6040107
Strumberger, I., Beko, M., Tuba, M., Minovic, M., Bacanin, N.: Elephant herding optimization algorithm for wireless sensor network localization problem. In: Camarinha-Matos, L.M., Adu-Kankam, K.O., Julashokri, M. (eds.) DoCEIS 2018. IAICT, vol. 521, pp. 175–184. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78574-5_17
Abraham, A., Das, S., Roy, S.: Swarm intelligence algorithms for data clustering. In: Maimon, O., Rokach, L. (eds.) Soft Computing for Knowledge Discovery and Data Mining, pp. 279–313. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-69935-6_12
Ducatelle, F., Gianni, A.D., Luca, M.G.: Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intell. 4(3), 173–198 (2010)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, Perth, WA, Australia, pp. 1942–1948 (1995). https://doi.org/10.1109/icnn.1995.488968
Bacanin, N., Tuba, M.: Artificial Bee Colony (ABC) algorithm for constrained optimization improved with genetic operators. Stud. Inform. Control 21(2), 137–146 (2012)
Yang, X.-S., He, X.: Firefly algorithm: recent advances and applications. Int. J. Swarm Intelligence 1(1), 36–50 (2013). https://doi.org/10.1504/IJSI.2013.05580
Strumberger, I., Tuba, E., Bacanin, N., Beko, M., Tuba, M.: Bare bones fireworks algorithm for the RFID network planning problem. In: 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, pp. 1–8 (2018). https://doi.org/10.1109/cec.2018.8477990
Wang, G.-G., Deb, S., Cui, Z.: Monarch butterfly optimization. In: Neural Computing and Applications, pp. 1–20 (2015)
Tuba, M., Bacanin, N.: Hybridized bat algorithm for multi-objective radio frequency identification (RFID) network planning. In: 2015 IEEE Congress on Evolutionary Computation (CEC), Sendai, pp. 499–506 (2015). https://doi.org/10.1109/cec.2015.725693
Nouiri, M., Jemai, A., Ammari, A.C., Bekrar, A., Trentesaux D., Niar, S.: Using IoT in breakdown tolerance: PSO solving FJSP. In: 2016 11th International Design & Test Symposium (IDT), Hammamet, pp. 19–24 (2016). https://doi.org/10.1109/idt.2016.7843008
Masdari, M., Salehi, F., Jalali, M., et al.: A survey of PSO-based scheduling algorithms in cloud computing. J. Netw. Syst. Manage. 25(1), 122–158 (2017). https://doi.org/10.1007/s10922-016-9385-9
Strumberger, I., Tuba, E., Bacanin, N., Beko, M., Tuba, M.: Monarch butterfly optimization algorithm for localization in wireless sensor networks. In: 2018 28th International Conference Radioelektronika (RADIOELEKTRONIKA), Prague, pp. 1–6 (2018). https://doi.org/10.1109/radioelek.2018.8376387
Tuba, M., Alihodzic, A., Bacanin, N.: Cuckoo search and bat algorithm applied to training feed-forward neural networks. In: Yang, X.-S. (ed.) Recent Advances in Swarm Intelligence and Evolutionary Computation. SCI, vol. 585, pp. 139–162. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-13826-8_8
Tuba, E., Alihodzic, A., Tuba, M.: Multilevel image thresholding using elephant herding optimization algorithm. In: 2017 14th International Conference on Engineering of Modern Electric Systems (EMES), Oradea, pp. 240–243 (2017). https://doi.org/10.1109/EMES.2017.7980424
França da Silva, G.C., Valente, T.L.A., Silva, A.C., Cardoso de Paiva, A., Gattass, A.: Convolutional neural network-based PSO for lung nodule false positive reduction on CT images. Comput. Methods Programs Biomed. 162, 109–118 (2018). https://doi.org/10.1016/j.cmpb.2018.05.006
Cheraghalipour, A., Hajiaghaei-Keshteli, M.: Tree Growth Algorithm (TGA): an effective metaheuristic algorithm inspired by trees’ behavior. In: 13th International Conference on Industrial Engineering, vol. 13 (2017)
Cheraghalipour, A., Hajiaghaei-Keshteli, M., Paydar, M.M.: Tree Growth Algorithm (TGA): a novel approach for solving optimization problems. Eng. Appl. Artif. Intell. 72, 393–414 (2018). https://doi.org/10.1016/j.engappai.2018.04.021
Li, D., Li, K., Liang, J., Ouyang, A.: A hybrid particle swarm optimization algorithm for load balancing of MDS on heterogeneous computing systems. Neurocomputing (2018, in press). https://doi.org/10.1016/j.neucom.2018.11.034
Kalra, M., Singh, S.: A review of metaheuristic scheduling techniques in cloud computing. Egypt. Inform. Journal 16(3), 275–295 (2015). https://doi.org/10.1016/j.eij.2015.07.001
Acknowledgements
This research is supported by the Ministry of Education, Science and Technological Development of Republic of Serbia, Grant No. III-44006. The work of M. Beko was supported in part by Fundação para a Ciência e a Tecnologia under Projects UID/MULTI/04111/0213 and UID/MULTI/04111/0216, UID/EEA/00066/2013 and foRESTER PCIF/SSI/0102/2017, and Grant IF/00325/2015.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 IFIP International Federation for Information Processing
About this paper
Cite this paper
Strumberger, I., Tuba, E., Zivkovic, M., Bacanin, N., Beko, M., Tuba, M. (2019). Dynamic Search Tree Growth Algorithm for Global Optimization. In: Camarinha-Matos, L., Almeida, R., Oliveira, J. (eds) Technological Innovation for Industry and Service Systems. DoCEIS 2019. IFIP Advances in Information and Communication Technology, vol 553. Springer, Cham. https://doi.org/10.1007/978-3-030-17771-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-17771-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17770-6
Online ISBN: 978-3-030-17771-3
eBook Packages: Computer ScienceComputer Science (R0)
