An Improved Multi-State Particle Swarm Optimization for Discrete Optimization Problems

Particle swarm optimization (PSO) has been successfully applied to solve various optimization problems. Recently, a state-based algorithm called multi-state particle swarm optimization (MSPSO) has been proposed to solve discrete combinatorial optimization problems. The algorithm operates based on a simplified mechanism of transition between two states. However, the MSPSO algorithm has to deal with the production of infeasible solutions and hence, additional step to convert the infeasible solution to feasible solution is required. In this paper, the MSPSO is improved by introducing a strategy that directly produces feasible solutions. The performance of the improved multi-state particle swarm optimization (IMSPSO) is empirically evaluated based on a set of travelling salesman problems (TSPs). The experimental results showed the newly introduced approach is promising and consistently outperformed the binary PSO algorithm