An Effective Integrated Metaheuristic Algorithm For Solving Engineering Problems

• Autorzy: Alihodzic Adis , Delalic Sead , Gusic Dzenan

Identyfikatory

DOI

10.15439/2020F81

• Konferencja: Federated Conference on Computer Science and Information Systems (15 ; 06-09.09.2020 ; Sofia, Bulgaria)
• Języki publikacji: EN

Abstrakty

EN

To tackle a specific class of engineering problems, in this paper, we propose an effectively integrated bat algorithm with simulated annealing for solving constrained optimization problems. Our proposed method (I-BASA) involves simulated annealing, Gaussian distribution, and a new mutation operator into the simple Bat algorithm to accelerate the search performance as well as to additionally improve the diversification of the whole space. The proposed method performs balancing between the grave exploitation of the Bat algorithm and global exploration of the Simulated annealing. The standard engineering benchmark problems from the literature were considered in the competition between our integrated method and the latest swarm intelligence algorithms in the area of design optimization. The simulations results show that I-BASA produces high-quality solutions as well as a low number of function evaluations.

Słowa kluczowe

EN

Gaussian distribution; particle swarm optimisation; search problems; simulated annealing; swarm intelligence

PL

Rozkład Gaussa; optymalizacja roju cząstek; problemy wyszukiwawcze; symulowane wyżarzanie; inteligencja roju

• Wydawca: Polskie Towarzystwo Informatyczne
• Czasopismo: Annals of Computer Science and Information Systems
• Rocznik: 2020
• Tom: Vol. 21
• Strony: 207--214
• Opis fizyczny: Bibliogr. 23 poz., wz., tab.

Twórcy

autor

Alihodzic Adis

• University of Sarajevo, BiH Department of Mathematics, ul. Zmaja od Bosne, 33-35, Sarajevo

autor

Delalic Sead

• University of Sarajevo, BiH Department of Mathematics, ul. Zmaja od Bosne, 33-35, Sarajevo

autor

Gusic Dzenan

• University of Sarajevo, BiH Department of Mathematics, ul. Zmaja od Bosne, 33-35, Sarajevo

Bibliografia

• 1. A. H. Gandomi, X. S. Yang, and A. H. Alavi, “Mixed variable structural optimization using Firefly Algorithm,” Computers and Structures, vol. 89, no. 23-24, pp. 2325–2336, December 2011. http://dx.doi.org/https://doi.org/10.1016/j.compstruc.2011.08.002
• 2. X.-S. Yang, “Review of meta-heuristics and generalised evolutionary walk algorithm,” International Journal of Bio-Inspired Computation, vol. 3, no. 2, pp. 77–84„ 2011. doi: https://doi.org/10.1504/IJBIC.2011.039907
• 3. M. Črepinšek, S.-H. Liu, and M. Mernik, “Exploration and exploitation in evolutionary algorithms: A survey,” ACM Comput. Surv., vol. 45, no. 3, pp. 35:1–35:33, July 2013. http://dx.doi.org/https://doi.org/10.1145/2480741.2480752
• 4. X.-S. Yang, “Free lunch or no free lunch: That is not just a question?” International Journal on Artificial Intelligence Tools, vol. 21, no. 3, pp. 5360–5366, 2012. http://dx.doi.org/https://doi.org/10.1142/S0218213012400106
• 5. X.-S. Yang, “Efficiency analysis of swarm intelligence and randomization techniques,” Journal of Computational and Theoretical Nanoscience, vol. 9, no. 2, pp. 189–198, 2012. http://dx.doi.org/https://doi.org/10.1166/jctn.2012.2012
• 6. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Technical Report - TR06, pp. 1–10, 2005.
• 7. M. Tuba and R. Jovanovic, “Improved ant colony optimization algorithm with pheromone correction strategy for the traveling salesman problem,” International Journal of Computers, Communications & Control, vol. 8, no. 3, pp. 477–485, June 2013. http://dx.doi.org/https://doi.org/10.15837/ijccc.2013.3.7
• 8. N. Bacanin and M. Tuba, “Artificial bee colony (ABC) algorithm for constrained optimization improved with genetic operators,” Studies in Informatics and Control, vol. 21, no. 2, pp. 137–146, June 2012. http://dx.doi.org/https://doi.org/10.24846/v21i2y201203
• 9. I. Brajevic and M. Tuba, “An upgraded artificial bee colony algorithm (abc) for constrained optimization problems,” Journal of Intelligent Manufacturing, vol. 24, no. 4, pp. 729–740, August 2013. doi: https://doi.org/10.1007/s10845-011-0621-6
• 10. I. Fister, J. Fister, X. Yang, and J. Brest, “A comprehensive review of firefly algorithms,” Swarm and Evolutionary Computation, vol. 13, no. 1, pp. 34–46, 2013. http://dx.doi.org/https://doi.org/10.1016/j.swevo.2013.06.001
• 11. N. Bacanin and M. Tuba, “Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint,” The Scientific World Journal, vol. 2014, pp. 115–139, April 2014. http://dx.doi.org/https://doi.org/10.1155/2014/721521
• 12. M. Tuba, N. Bacanin, and A. Alihodzic, “Firefly algorithm for multi-objective RFID network planning problem,” Telecommunications Forum Telfor (TELFOR), pp. 95–98, September 2014. http://dx.doi.org/https://doi.org/10.1109/TELFOR.2014.7034365
• 13. A. H. Gandomi, X. S. Yang, and A. H. Alavi, “Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems,” Engineering with Computers, vol. 29, no. 1, pp. 17–35, January 2013. http://dx.doi.org/https://doi.org/10.1007/s00366-011-0241-y
• 14. W. Long, X. Liang, Y. Huang, and Y. Chen, “An effective hybrid cuckoo search algorithm for constrained global optimization,” Neural Computing and Applications, vol. 25, no. 3-4, pp. 911–926, September 2014. http://dx.doi.org/https://doi.org/10.1007/s00521-014-1577-1
• 15. X.-S. Yang, “A new metaheurisitic bat-inspired algorithm,” Stud- ies in Computational Intelligence, vol. 284, pp. 65–74, 2010. http://dx.doi.org/https://doi.org/10.1007/978-3-642-12538-6%5F6
• 16. A. H. Gandomi, Yang, A. H. Alavi, and S. Talatahari, “Bat algorithm for constrained optimization tasks,” Neural Computing and Applications, vol. 22, no. 6, pp. 1239–1255, May 2013. http://dx.doi.org/https://doi.org/10.1007/s00521-012-1028-9
• 17. A. Alihodzic and M. Tuba, “Improved bat algorithm applied to multilevel image thresholding,” The Scientific World Journal, vol. 2014, no. Article ID 176718, p. 16, July 2014. http://dx.doi.org/https://doi.org/10.1155/2014/176718
• 18. M. Tuba, A. Alihodzic, and N. Bacanin, “Cuckoo Search and Bat Algorithm Applied to Training Feed-Forward Neural Networks,” vol. 585, pp. 139–162, 2014. http://dx.doi.org/https://doi.org/10.1007/978-3-319-13826-8%5F8
• 19. A. Alihodzic and M. Tuba, “Improved hybridized bat algorithm for global numerical optimization,” 16th IEEE International Conference on Computer Modelling and Simulation, UKSim-AMSS 2014, pp. 57–62, March 2014. http://dx.doi.org/https://doi.org/10.1109/UKSim.2014.97
• 20. S. M. Nigdeli, G. Bekdaş, and X.-S. Yang, “Application of the Flower Pollination Algorithm in Structural Engineering,” Modeling and Optimization in Science and Technologies, vol. 7, pp. 25–42, December 2015. http://dx.doi.org/https://doi.org/10.1007/978-3-319-26245-1%5F2
• 21. J. M. P. V. S. Kirkpatrick, C. D. Gelatt, “Optimization by Simulated Annealing,” Science, vol. 220, no. 4598, pp. 671–680, May 1983. http://dx.doi.org/https://doi.org/10.1126/science.220.4598.671
• 22. H. Yu, H. Fang, P. Yao, and Y. Yuan, “A combined genetic algorithm/simulated annealing algorithm for large scale system energy integration,” Computers & Chemical Engineering, vol. 24, no. 8, pp. 2023–2035, September 2000. http://dx.doi.org/https://doi.org/10.1016/S0098-1354(00)00601-3
• 23. X. shi He, W.-J. Ding, and X.-S. Yang, “Bat algorithm based on simulated annealing and Gaussian perturbations,” Neural Computing & Applications, vol. 25, no. 2, pp. 459–468, September 2013. http://dx.doi.org/https://doi.org/10.1007/s00521-013-1518-4

Uwagi

1. Track 1: Artificial Intelligence

2. Technical Session: 13th International Workshop on Computational Optimization

3. Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).