Quaternionic flower pollination algorithm
Carregando...
Arquivos
Fontes externas
Fontes externas
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Trabalho apresentado em evento
Direito de acesso
Acesso aberto
Arquivos
Fontes externas
Fontes externas
Resumo
Metaheuristic-based optimization techniques offer an elegant and easy-to-follow framework to optimize different types of problems, ranging from aerodynamics to machine learning. Though such techniques are suitable for global optimization, they can still be get trapped locally under certain conditions, thus leading to reduced performance. In this work, we propose a quaternionic-based Flower Pollination Algorithm (FPA), which extends standard FPA to possibly smoother search spaces based on hypercomplex representations. We show the proposed approach is more accurate than five other metaheuristic techniques in four benchmarking functions. We also present a parallel version of the proposed approach that runs much faster.
Descrição
Palavras-chave
Flower pollination algorithm, Metaheuristics, Quaternions
Idioma
Inglês
Citação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10425 LNCS, p. 47-58.
