Particle swarm optimization for integer programming

  • Authors:
  • E. C. Laskari;K. E. Parsopoulos;M. N. Vrahatis

  • Affiliations:
  • Dept. of Math., Patras Univ., Greece;Dept. of Math., Patras Univ., Greece;Dept. of Math., Patras Univ., Greece

  • Venue:
  • CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.