作者
Elena C Laskari, Konstantinos E Parsopoulos, Michael N Vrahatis
发表日期
2002/5/12
研讨会论文
wcci
页码范围
1582-1587
出版商
IEEE
简介
The investigation of the performance of the particle swarm optimization (PSO) method in integer programming problems, is the main theme of the present paper. Three variants of PSO are compared with the widely used branch and bound technique, on several integer programming test problems. Results indicate that PSO handles efficiently such problems, and in most cases it outperforms the branch and bound technique.
引用总数
学术搜索中的文章
EC Laskari, KE Parsopoulos, MN Vrahatis - Proceedings of the 2002 Congress on Evolutionary …, 2002