Quaternionic flower pollination algorithm

Detalhes bibliográficos
Autor(a) principal: Rosa, Gustavo H. [UNESP]
Data de Publicação: 2017
Outros Autores: Afonso, Luis C. S., Baldassin, Alexandro [UNESP], Papa, João P. [UNESP], Yang, Xin-She
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1007/978-3-319-64698-5_5
http://hdl.handle.net/11449/179133
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.
id UNSP_cc0504b318184629f4178e4b45ccc243
oai_identifier_str oai:repositorio.unesp.br:11449/179133
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Quaternionic flower pollination algorithmFlower pollination algorithmMetaheuristicsQuaternionsMetaheuristic-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.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)School of Sciences UNESP - São Paulo State UniversityDepartment of Computing UFSCar - Federal University of São CarlosInstitute of Natural Sciences and Technology UNESP - São Paulo State UniversitySchool of Science and Technology Middlesex UniversitySchool of Sciences UNESP - São Paulo State UniversityInstitute of Natural Sciences and Technology UNESP - São Paulo State UniversityFAPESP: #2014/12236-1FAPESP: #2014/16250-9FAPESP: #2015/25739-4FAPESP: #2016/21243-7CNPq: #306166/2014-3Universidade Estadual Paulista (Unesp)Universidade Federal de São Carlos (UFSCar)Middlesex UniversityRosa, Gustavo H. [UNESP]Afonso, Luis C. S.Baldassin, Alexandro [UNESP]Papa, João P. [UNESP]Yang, Xin-She2018-12-11T17:33:53Z2018-12-11T17:33:53Z2017-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject47-58http://dx.doi.org/10.1007/978-3-319-64698-5_5Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10425 LNCS, p. 47-58.1611-33490302-9743http://hdl.handle.net/11449/17913310.1007/978-3-319-64698-5_52-s2.0-85028465902Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)0,295info:eu-repo/semantics/openAccess2024-04-23T16:11:19Zoai:repositorio.unesp.br:11449/179133Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T16:02:04.542800Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Quaternionic flower pollination algorithm
title Quaternionic flower pollination algorithm
spellingShingle Quaternionic flower pollination algorithm
Rosa, Gustavo H. [UNESP]
Flower pollination algorithm
Metaheuristics
Quaternions
title_short Quaternionic flower pollination algorithm
title_full Quaternionic flower pollination algorithm
title_fullStr Quaternionic flower pollination algorithm
title_full_unstemmed Quaternionic flower pollination algorithm
title_sort Quaternionic flower pollination algorithm
author Rosa, Gustavo H. [UNESP]
author_facet Rosa, Gustavo H. [UNESP]
Afonso, Luis C. S.
Baldassin, Alexandro [UNESP]
Papa, João P. [UNESP]
Yang, Xin-She
author_role author
author2 Afonso, Luis C. S.
Baldassin, Alexandro [UNESP]
Papa, João P. [UNESP]
Yang, Xin-She
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Universidade Federal de São Carlos (UFSCar)
Middlesex University
dc.contributor.author.fl_str_mv Rosa, Gustavo H. [UNESP]
Afonso, Luis C. S.
Baldassin, Alexandro [UNESP]
Papa, João P. [UNESP]
Yang, Xin-She
dc.subject.por.fl_str_mv Flower pollination algorithm
Metaheuristics
Quaternions
topic Flower pollination algorithm
Metaheuristics
Quaternions
description 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.
publishDate 2017
dc.date.none.fl_str_mv 2017-01-01
2018-12-11T17:33:53Z
2018-12-11T17:33:53Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/978-3-319-64698-5_5
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10425 LNCS, p. 47-58.
1611-3349
0302-9743
http://hdl.handle.net/11449/179133
10.1007/978-3-319-64698-5_5
2-s2.0-85028465902
url http://dx.doi.org/10.1007/978-3-319-64698-5_5
http://hdl.handle.net/11449/179133
identifier_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10425 LNCS, p. 47-58.
1611-3349
0302-9743
10.1007/978-3-319-64698-5_5
2-s2.0-85028465902
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
0,295
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 47-58
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808128597169274880

Registros relacionados