Adaptive particle swarm optimizer with nonextensive schedule

Aristoklis D. Anastasiadis, George Georgoulas, George Magoulas, Antonios Tzes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper introduces a class of adaptive particle swarm optimization (PSO) methods that build on the theory of nonextensive statistical mechanics. These methods combine the traditional position update rule with an annealing schedule that is based on the nonextensive entropy. Comparative experiments conducted on benchmark functions, have showed that the tested algorithms outperform the standard PSO.

Original languageEnglish (US)
Title of host publicationProceedings of GECCO 2007
Subtitle of host publicationGenetic and Evolutionary Computation Conference
Number of pages1
DOIs
StatePublished - Aug 27 2007
Event9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 - London, United Kingdom
Duration: Jul 7 2007Jul 11 2007

Other

Other9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007
CountryUnited Kingdom
CityLondon
Period7/7/077/11/07

Fingerprint

Particle Swarm Optimizer
Particle swarm optimization (PSO)
Particle Swarm Optimization
Schedule
Nonextensive Entropy
Nonextensive Statistical Mechanics
Statistical mechanics
Annealing
Optimization Methods
Entropy
Update
Benchmark
Experiment
Experiments
Class
Standards

Keywords

  • Global search
  • Nonextensive statistical mechanics
  • Particle swarm optimizer
  • Swarm intelligence

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science

Cite this

Anastasiadis, A. D., Georgoulas, G., Magoulas, G., & Tzes, A. (2007). Adaptive particle swarm optimizer with nonextensive schedule. In Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference https://doi.org/10.1145/1276958.1276982

Adaptive particle swarm optimizer with nonextensive schedule. / Anastasiadis, Aristoklis D.; Georgoulas, George; Magoulas, George; Tzes, Antonios.

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Anastasiadis, AD, Georgoulas, G, Magoulas, G & Tzes, A 2007, Adaptive particle swarm optimizer with nonextensive schedule. in Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007, London, United Kingdom, 7/7/07. https://doi.org/10.1145/1276958.1276982
Anastasiadis AD, Georgoulas G, Magoulas G, Tzes A. Adaptive particle swarm optimizer with nonextensive schedule. In Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007 https://doi.org/10.1145/1276958.1276982
Anastasiadis, Aristoklis D. ; Georgoulas, George ; Magoulas, George ; Tzes, Antonios. / Adaptive particle swarm optimizer with nonextensive schedule. Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007.
@inproceedings{41266e2dc20445d5b30b31f3ad1ad5ce,
title = "Adaptive particle swarm optimizer with nonextensive schedule",
abstract = "This paper introduces a class of adaptive particle swarm optimization (PSO) methods that build on the theory of nonextensive statistical mechanics. These methods combine the traditional position update rule with an annealing schedule that is based on the nonextensive entropy. Comparative experiments conducted on benchmark functions, have showed that the tested algorithms outperform the standard PSO.",
keywords = "Global search, Nonextensive statistical mechanics, Particle swarm optimizer, Swarm intelligence",
author = "Anastasiadis, {Aristoklis D.} and George Georgoulas and George Magoulas and Antonios Tzes",
year = "2007",
month = "8",
day = "27",
doi = "10.1145/1276958.1276982",
language = "English (US)",
isbn = "1595936971",
booktitle = "Proceedings of GECCO 2007",

}

TY - GEN

T1 - Adaptive particle swarm optimizer with nonextensive schedule

AU - Anastasiadis, Aristoklis D.

AU - Georgoulas, George

AU - Magoulas, George

AU - Tzes, Antonios

PY - 2007/8/27

Y1 - 2007/8/27

N2 - This paper introduces a class of adaptive particle swarm optimization (PSO) methods that build on the theory of nonextensive statistical mechanics. These methods combine the traditional position update rule with an annealing schedule that is based on the nonextensive entropy. Comparative experiments conducted on benchmark functions, have showed that the tested algorithms outperform the standard PSO.

AB - This paper introduces a class of adaptive particle swarm optimization (PSO) methods that build on the theory of nonextensive statistical mechanics. These methods combine the traditional position update rule with an annealing schedule that is based on the nonextensive entropy. Comparative experiments conducted on benchmark functions, have showed that the tested algorithms outperform the standard PSO.

KW - Global search

KW - Nonextensive statistical mechanics

KW - Particle swarm optimizer

KW - Swarm intelligence

UR - http://www.scopus.com/inward/record.url?scp=34548083412&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548083412&partnerID=8YFLogxK

U2 - 10.1145/1276958.1276982

DO - 10.1145/1276958.1276982

M3 - Conference contribution

AN - SCOPUS:34548083412

SN - 1595936971

SN - 9781595936974

BT - Proceedings of GECCO 2007

ER -