Adaptive particle swarm optimizer with nonextensive schedule

Aristoklis D. Anastasiadis; George Georgoulas; George Magoulas; Anthony Tzes

doi:10.1145/1276958.1276982

Adaptive particle swarm optimizer with nonextensive schedule

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of GECCO 2007
Subtitle of host publication	Genetic and Evolutionary Computation Conference
Pages	168
Number of pages	1
DOIs	https://doi.org/10.1145/1276958.1276982
State	Published - 2007
Event	9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 - London, United Kingdom Duration: Jul 7 2007 → Jul 11 2007

Publication series

Name	Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Other

Other	9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007
Country/Territory	United Kingdom
City	London
Period	7/7/07 → 7/11/07

Keywords

Global search
Nonextensive statistical mechanics
Particle swarm optimizer
Swarm intelligence

ASJC Scopus subject areas

Artificial Intelligence
Software
Theoretical Computer Science

Access to Document

10.1145/1276958.1276982

Cite this

Adaptive particle swarm optimizer with nonextensive schedule. / Anastasiadis, Aristoklis D.; Georgoulas, George; Magoulas, George et al.
Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007. p. 168 (Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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. Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference, pp. 168, 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007, London, United Kingdom, 7/7/07. https://doi.org/10.1145/1276958.1276982

@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 Anthony Tzes",

year = "2007",

doi = "10.1145/1276958.1276982",

language = "English (US)",

isbn = "1595936971",

series = "Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference",

pages = "168",

booktitle = "Proceedings of GECCO 2007",

note = "9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 ; Conference date: 07-07-2007 Through 11-07-2007",

}

TY - GEN

T1 - Adaptive particle swarm optimizer with nonextensive schedule

AU - Anastasiadis, Aristoklis D.

AU - Georgoulas, George

AU - Magoulas, George

AU - Tzes, Anthony

PY - 2007

Y1 - 2007

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

T3 - Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

SP - 168

BT - Proceedings of GECCO 2007

T2 - 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007

Y2 - 7 July 2007 through 11 July 2007

ER -

Adaptive particle swarm optimizer with nonextensive schedule

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this