A Discrete Particle Swarm Optimization for Solving Multiple Knapsack Problems

Author

Ren, Zihui ; Wang, Jian

Author_Institution

CIMS Res. Center, Tongji Univ., Shanghai, China

Volume

3

fYear

2009

fDate

14-16 Aug. 2009

Firstpage

166

Lastpage

170

Abstract

A new discrete particle swarm optimization (DPSO) is proposed to solve the multiple knapsack problems (MKP). In the DPSO, the position and velocity of the particles are redefined and the rules and athletic equations of algorithm are also renewed. The multiple knapsack problems are 0-1 programming. The 0-1 programming will be transformed to the integer programming. Then we use the DPSO to solve several multiple knapsack problems. The experimental results show that the DPSO algorithm is feasible to solve the multiple knapsack problems, especially effectively to large scale multiple knapsack problems.

Keywords

combinatorial mathematics; integer programming; knapsack problems; particle swarm optimisation; combinatorial optimization problem; discrete particle swarm optimization; integer programming; multiple knapsack problems; Ant colony optimization; Bismuth; Computer integrated manufacturing; Design methodology; Equations; Large-scale systems; Linear programming; Multidimensional systems; Particle swarm optimization; Upper bound; 0-1programming; Discrete Particle Swarm Optimization(DPSO); Multiple Knapsack Problems(MKP); comparability of particles; integer programming; mutation;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2009. ICNC '09. Fifth International Conference on

Conference_Location

Tianjin

Print_ISBN

978-0-7695-3736-8

Type

conf

DOI

10.1109/ICNC.2009.80

Filename

5366622