This paper presents a discrete particle swarm
optimization to solve the task assignment problem using
discrete binary variables. The particle swarm optimization
involves a population of particles through a problem space on
the basis of information about each particle’s local best
solution and global best solution of all particles. Most versions
of the particle swarm have operated in continuous variables.
The task assignment problem of distributed system is to assign
some tasks to distributed processors system, which relative
tasks have to exchange information on different processors.
The objective is to minimize the maximum cost of the
processors, which includes computing cost and communication
cost. Simulation results show the assignment problem can be
solved by the proposed method efficiently.
Shih-Tang Lo, Der-Fang Shiau, Ruey-Maw Chen, Yi-Chun Lin, A Discrete Version of Particle Swarm Optimization for Distributed System Task Assignment Problem, The 2nd International Conference on Advanced Computer Science and Engineering (ICACTE 2009) Pages. 1507-1516, September 25 -27,2009