DocumentCode
1635859
Title
Particle swarm optimization for integer programming
Author
Laskari, E.C. ; Parsopoulos, K.E. ; Vrahatis, M.N.
Author_Institution
Dept. of Math., Patras Univ., Greece
Volume
2
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
1582
Lastpage
1587
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
Keywords
evolutionary computation; integer programming; optimisation; branch and bound technique; integer programming; particle swarm optimization; Artificial intelligence; Combinatorial mathematics; Graph theory; Linear programming; Logic; Neural networks; Particle swarm optimization; Production; Productivity; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-7282-4
Type
conf
DOI
10.1109/CEC.2002.1004478
Filename
1004478
Link To Document