Particle swarm optimization for integer programming

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 indi...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) Vol. 2; pp. 1582 - 1587 vol.2
Main Authors Laskari, E.C., Parsopoulos, K.E., Vrahatis, M.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Artificial intelligence
Combinatorial mathematics
Graph theory
Linear programming
Logic
Neural networks
Particle swarm optimization
Production
Productivity
Testing
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0780372824
9780780372825
DOI:10.1109/CEC.2002.1004478