2009 IEEE Congress on Evolutionary Computation 2009
DOI: 10.1109/cec.2009.4983182
|View full text |Cite
|
Sign up to set email alerts
|

Inertial geometric particle swarm optimization

Abstract: Abstract-Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of a simplified form of traditional particle swarm optimization (PSO) without the inertia term that applies naturally to both continuous and combinatorial spaces. In this paper, we propose an extension of GPSO, the inertial GPSO (IGPSO), that generalizes the traditional PSO endowed with the full equation of motion of particles to generic search spaces. We then formally derive the specific IGPSO for the Hamming … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 14 publications
(12 reference statements)
0
2
0
Order By: Relevance
“…The attribute selection filter used CfsSubsetEval as the evaluator function and particle swarm optimization search algorithm with a population size of 1000. 30 This ensured that the test data were separate from the training data used to build the model in each fold. We report prediction performance using leave-one-out-cross-validation for each renal phase separately.…”
Section: Multivariate Analysismentioning
confidence: 99%
“…The attribute selection filter used CfsSubsetEval as the evaluator function and particle swarm optimization search algorithm with a population size of 1000. 30 This ensured that the test data were separate from the training data used to build the model in each fold. We report prediction performance using leave-one-out-cross-validation for each renal phase separately.…”
Section: Multivariate Analysismentioning
confidence: 99%
“…It compares the effectiveness of the basic particle swarm optimization scheme (BPSO) with each of BPSO with mutation, constriction particle swarm optimization (CPSO) with mutation, and CPSO without mutation. Alberto Moraglio and Julian Togelius [13] proposed an extension of Geometric Particle Swarm Optimization (GPSO), the inertial GPSO (IGPSO), that generalizes the traditional PSO endowed with the full equation of motion of particles to generic search spaces. Yongfang Chu and Zhihua Cui [14] developed an algorithm based on Neighborhood Sharing Particle Swarm Optimization which replaces the individual experience by the neighbor sharing information of current state and proposes the neighbourhood sharing particle swarm algorithm.…”
Section: Cmentioning
confidence: 99%