Selecting Decision Variables for Artificial Bee Colony using a Self-adaptive Variable Matrix
Resumo
Artificial Bee Colony (ABC) is a Swarm Intelligence optimization algorithm well-know for its versatility. The selection of decision variables to up-date is purely stochastic, incurring in several issues to the local search capability of the ABC. To address these issues, a self-adaptive decision variable selec-tion mechanism is proposed with the goal of balancing the degree of explorationand exploitation throughout the execution of the algorithm. This selection,named Adaptive Decision Variable Matrix (ADVM) represents both stochasticand deterministic parameter selection in a binary matrix and regulates the ex-tent of how much each selection is employed based on the estimation of thesparsity of the solutions in the search space. Influence of the proposed approachto performance and robustness of the original algorithm is validated by experi-menting on fifteen highly multimodal benchmark optimization problems. ADVMis integrated into the original ABC and variations in order to showcase the flex-ibility of the method. Numerical comparison is made against the ABC and theirvariants, as well as to other population-based algorithms (e.g., Particle SwarmOptimization and Differential Evolution). Results show an improvement of theperformance of the algorithms with the ADVM in the most difficult instances.
Referências
Akay, B. and Karaboga, D. (2015). A survey on the applications of artificial bee colony in signal, image, and video processing. Signal, Image and Video Processing, 9(4):967–990.
Akay, B. B. and Karaboga, D. (2017). Artificial bee colony algorithm variants on constrained optimization. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 7(1):98–111.
Aydın, D., Yavuz, G., and Stützle, T. (2017). Abc-x: a generalized, automatically configurable artificial bee colony framework. Swarm Intelligence, 11(1):1–38.
Bäck, T. and Hoffmeister, F. (1991). Extended selection mechanisms in genetic algorithms.
Gatto, B. B. and dos Santos, E. M. (2017). Discriminative canonical correlation analysis network for image classification. In Image Processing (ICIP), 2017 IEEE International Conference on. IEEE.
Gatto, B. B., dos Santos, E. M., and Fukui, K. (2017). Subspace-based convolutional network for handwritten character recognition. In 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR), volume 1. IEEE.
Gavana, A. (2019). Global optimization benchmarks and ampgo. Accessed Apr.
Karaboga, D. (2005a). An idea based on honey bee swarm for numerical optimization. Technical report, Erciyes University.
Karaboga, D. (2005b). An idea based on honey bee swarm for numerical optimization. Technical report, Technical report-tr06, Erciyes university, engineering faculty, computer engineering department.
Kennedy, J. and Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE Int. Conf. on Neural Networks, pages 1942–1948. IEEE, IEEE Press.
Locatelli, M. and Schoen, F. (2013). Global optimization: theory, algorithms, and applications, volume 15. Siam.
Mc Ginley, B., Maher, J., O’Riordan, C., and Morgan, F. (2011). Maintaining healthy population diversity using adaptive crossover, mutation, and selection. IEEE Transactions on Evolutionary Computation, 15(5):692–714.
Miranda, V. and Fonseca, N. (2002). Epso-evolutionary particle swarm optimization, a new algorithm with applications in power systems. In Transmission and Distribution Conference and Exhibition 2002: Asia Pacific. IEEE/PES, volume 2, pages 745–750. IEEE.
Mollinetti, M. A. F., Neto, M. T. R. S., and Kuno, T. (2018). Deterministic parameter selection of artificial bee colony based on diagonalization. In International Conference on Hybrid Intelligent Systems.
Morrison, R. W. (2013). Designing evolutionary algorithms for dynamic environments. Springer Science & Business Media.
Storn, R. and Price, K. (1997). Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4):341–359.
Ursem, R. K. (2002). Diversity-guided evolutionary algorithms. In International Conference on Parallel Problem Solving from Nature, pages 462–471. Springer.
Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE transactions on evolutionary computation, 1(1):67–82.
Zhu, G. and Kwong, S. (2010). Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied mathematics and computation, 217(7):3166–3173.
