1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (
DOI: 10.1109/icec.1998.699326
|View full text |Cite
|
Sign up to set email alerts
|

Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
162
0
4

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 293 publications
(170 citation statements)
references
References 3 publications
0
162
0
4
Order By: Relevance
“…It aims at increasing the probability of encountering global extremum points without performing a comprehensive search of the entire search space. PSO can easily be implemented and its performance is comparable to other stochastic optimization technique, such as genetic algorithm and simulated annealing [14].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…It aims at increasing the probability of encountering global extremum points without performing a comprehensive search of the entire search space. PSO can easily be implemented and its performance is comparable to other stochastic optimization technique, such as genetic algorithm and simulated annealing [14].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…However, so far it has not been used for the determination of unsaturated hydraulic properties. PSO is a relatively new algorithm for evolutionary computation methodology, but its performance has proven to be comparable to various other, more established methodologies (Kennedy and Spears, 1998;Shi et al, 1999). One of the main advantages of PSO is the easiness of its implementation (Liang et al, 2006).…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Eberhart and Kennedy found PSO performs on par with GA on the Schaffer f6 function [4], [9]. In work by Kennedy and Spears [10], a version of PSO outperforms GA in a factorial time-series experiment. Fourie showed that PSO appears to outperform GA in optimizing several standard size and shape design problems [6].…”
Section: Introductionmentioning
confidence: 99%