A novel multi-state particle swarm optimization for discrete combinatorial optimization problems
Particle swarm optimization (PSO) has been widely used to solve real-valued optimization problems. A variant of PSO, namely, binary particle swarm optimization (BinPSO) has been previously developed to solve discrete optimization problems. Later, many studies have been done to improve BinPSO in term...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2012
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/26946/ http://umpir.ump.edu.my/id/eprint/26946/ http://umpir.ump.edu.my/id/eprint/26946/1/A%20novel%20multi-state%20particle%20swarm%20optimization%20for%20discrete%20combinatorial%20optimization%20problems.pdf |
| Summary: | Particle swarm optimization (PSO) has been widely used to solve real-valued optimization problems. A variant of PSO, namely, binary particle swarm optimization (BinPSO) has been previously developed to solve discrete optimization problems. Later, many studies have been done to improve BinPSO in term of convergence speed, stagnation in local optimum, and complexity. In this paper, a novel multi-state particle swarm optimization (MSPSO) is proposed to solve discrete optimization problems. Instead of evolving a high dimensional bit vector as in BinPSO, the proposed MSPSO mechanism evolves states of variables involved. The MSPSO algorithm has been applied to two benchmark instances of traveling salesman problem (TSP). The experimental results show that the the proposed MSPSO algorithm consistently outperforms the BinPSO in solving the discrete combinatorial optimization problem. |
|---|