@inproceedings{a1123d7980a5402b9f44e5756fd9a320,
title = "Crowd avoidance strategy in particle swarm algorithm",
abstract = "To improve the linearly varying inertia weigh particle swarm optimization method (LPSO), a new concept of Crowd Avoidance is introduced in this paper. In this newly developed LPSO (CA-LPSO), particles can avoid entering into a crowded space while collaborate with other particles searching for optimum. Four well-known benchmarks were used to evaluate the performance of CA-LPSO in comparison with LPSO. The simulation results show that, although CA-LPSO falls behind LPSO when optimizing simple unimodal problems, it is more effective than LPSO for most complex functions. The crowd avoidance strategy enables the particles to explore more areas in the search space and thus decreases the chance of premature convergence.",
author = "Guimin Chen and Qi Han and Jianyuan Jia and Wenchao Song",
year = "2005",
doi = "10.1007/11596448\_98",
language = "英语",
isbn = "3540308180",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "663--668",
booktitle = "Computational Intelligence and Security - International Conference, CIS 2005, Proceedings",
note = "International Conference on Computational Intelligence and Security, CIS 2005 ; Conference date: 15-12-2005 Through 19-12-2005",
}