Publicação

Particle swarm and simulated annealing for multi-global optimization

Ver documento

Detalhes bibliográficos
Resumo:Particle swarm and simulated annealing optimization algorithms proved to be valid in finding a global optimum in the bound constrained optimization context. However, their original versions can only detect one global optimum even if the problem has more than one solution. In this paper we propose modifications to both algorithms. In the particle swarm optimization algorithm we introduce gradient information to enable the computation of all the global and local optima. The simulated annealing algorithm is combined with a stretching technique to be able to compute all global optima. The numerical experiments carried out with a set of well-known test problems illustrate the effectiveness of the proposed algorithms.
Autores principais:Vaz, Ismael
Outros Autores:Pereira, Ana I.; Fernandes, Edite M.G.P.
Assunto:Multi-global optimization Particle swarm optimization Simulated Annealing
Ano:2005
País:Portugal
Tipo de documento:comunicação em conferência
Tipo de acesso:acesso aberto
Instituição associada:Instituto Politécnico de Bragança
Idioma:inglês
Origem:Biblioteca Digital do IPB
_version_ 1867173197701447680
author Vaz, Ismael
author2 Pereira, Ana I.
Fernandes, Edite M.G.P.
author2_role author
author
author_facet Vaz, Ismael
Pereira, Ana I.
Fernandes, Edite M.G.P.
author_role author
contributor_name_str_mv Biblioteca Digital do IPB
country_str PT
creators_json_txt [{\"Person.name\":\"Vaz, Ismael\"},{\"Person.name\":\"Pereira, Ana I.\",\"Person.identifier.orcid\":\"0000-0003-3803-2043\"},{\"Person.name\":\"Fernandes, Edite M.G.P.\"}]
datacite.contributors.contributor.contributorName.fl_str_mv Biblioteca Digital do IPB
datacite.creators.creator.creatorName.fl_str_mv Vaz, Ismael
Pereira, Ana I.
Fernandes, Edite M.G.P.
datacite.date.Accepted.fl_str_mv 2005-01-01T00:00:00Z
datacite.date.available.fl_str_mv 2011-12-12T10:47:44Z
datacite.date.embargoed.fl_str_mv 2011-12-12T10:47:44Z
datacite.rights.fl_str_mv http://purl.org/coar/access_right/c_abf2
datacite.subjects.subject.fl_str_mv Multi-global optimization
Particle swarm optimization
Simulated Annealing
datacite.titles.title.fl_str_mv Particle swarm and simulated annealing for multi-global optimization
dc.contributor.none.fl_str_mv Biblioteca Digital do IPB
dc.creator.none.fl_str_mv Vaz, Ismael
Pereira, Ana I.
Fernandes, Edite M.G.P.
dc.date.Accepted.fl_str_mv 2005-01-01T00:00:00Z
dc.date.available.fl_str_mv 2011-12-12T10:47:44Z
dc.date.embargoed.fl_str_mv 2011-12-12T10:47:44Z
dc.format.none.fl_str_mv application/pdf
dc.identifier.none.fl_str_mv http://hdl.handle.net/10198/6423
dc.language.none.fl_str_mv eng
dc.publisher.none.fl_str_mv WSEAS
dc.rights.none.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.subject.none.fl_str_mv Multi-global optimization
Particle swarm optimization
Simulated Annealing
dc.title.fl_str_mv Particle swarm and simulated annealing for multi-global optimization
dc.type.none.fl_str_mv http://purl.org/coar/resource_type/c_5794
description Particle swarm and simulated annealing optimization algorithms proved to be valid in finding a global optimum in the bound constrained optimization context. However, their original versions can only detect one global optimum even if the problem has more than one solution. In this paper we propose modifications to both algorithms. In the particle swarm optimization algorithm we introduce gradient information to enable the computation of all the global and local optima. The simulated annealing algorithm is combined with a stretching technique to be able to compute all global optima. The numerical experiments carried out with a set of well-known test problems illustrate the effectiveness of the proposed algorithms.
dirty 0
eu_rights_str_mv openAccess
format conferencePaper
fulltext.url.fl_str_mv https://bibliotecadigital.ipb.pt/bitstreams/38fdf81b-1848-4d80-be32-60304e0d342a/download
id ipb_6efca0086bbc63b09b4d5c610fcd9d32
identifier.url.fl_str_mv http://hdl.handle.net/10198/6423
instacron_str ipb
institution Instituto Politécnico de Bragança
instname_str Instituto Politécnico de Bragança
language eng
network_acronym_str ipb
network_name_str Biblioteca Digital do IPB
oai_identifier_str oai:bibliotecadigital.ipb.pt:10198/6423
organization_str_mv urn:organizationAcronym:ipb
person_str_mv Vaz, Ismael
Pereira, Ana I.
Pereira, Ana I.
https://www.ciencia-id.pt/0716-B7C2-93E4
0716-B7C2-93E4
http://orcid.org/0000-0003-3803-2043
0000-0003-3803-2043
Fernandes, Edite M.G.P.
publishDate 2005
publisher.none.fl_str_mv WSEAS
reponame_str Biblioteca Digital do IPB
repository_id_str urn:repositoryAcronym:ipb
service_str_mv urn:repositoryAcronym:ipb
spelling engWSEASporParticle swarm and simulated annealing optimization algorithms proved to be valid in finding a global optimum in the bound constrained optimization context. However, their original versions can only detect one global optimum even if the problem has more than one solution. In this paper we propose modifications to both algorithms. In the particle swarm optimization algorithm we introduce gradient information to enable the computation of all the global and local optima. The simulated annealing algorithm is combined with a stretching technique to be able to compute all global optima. The numerical experiments carried out with a set of well-known test problems illustrate the effectiveness of the proposed algorithms.application/pdfporParticle swarm and simulated annealing for multi-global optimizationVaz, IsmaelPersonalPereira, Ana I.DSpacehttp://dspace.org/items/e9981d62-2a2b-4fef-b75e-c2a14b0e7846DSpacehttp://dspace.org/items/e9981d62-2a2b-4fef-b75e-c2a14b0e7846PereiraAna I.Ciência IDhttps://www.ciencia-id.pt0716-B7C2-93E4ORCIDhttp://orcid.org0000-0003-3803-2043Researcher IDhttps://www.researcherid.comF-3168-2010Scopus Author IDhttps://www.scopus.com15071961600Fernandes, Edite M.G.P.HostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.pt2011-12-12T10:47:44Z20052005-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/6423http://purl.org/coar/access_right/c_abf2open accessMulti-global optimizationParticle swarm optimizationSimulated Annealing420063 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/38fdf81b-1848-4d80-be32-60304e0d342a/download6th WSEAS Internacional Conference on Evolutionary Computing.Lisbon
spellingShingle Particle swarm and simulated annealing for multi-global optimization
Vaz, Ismael
Multi-global optimization
Particle swarm optimization
Simulated Annealing
status SINGLETON
subject.fl_str_mv Multi-global optimization
Particle swarm optimization
Simulated Annealing
title Particle swarm and simulated annealing for multi-global optimization
title_full Particle swarm and simulated annealing for multi-global optimization
title_fullStr Particle swarm and simulated annealing for multi-global optimization
title_full_unstemmed Particle swarm and simulated annealing for multi-global optimization
title_short Particle swarm and simulated annealing for multi-global optimization
title_sort Particle swarm and simulated annealing for multi-global optimization
topic Multi-global optimization
Particle swarm optimization
Simulated Annealing
topic_facet Multi-global optimization
Particle swarm optimization
Simulated Annealing
url http://hdl.handle.net/10198/6423
visible 1