Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems

Abstract

Particle swarm optimization has been established to be one of the efficient algorithms for finding solutions for continuous optimization problems. The discretized form of particle swarm optimization, known as the discrete particle swarm optimization is an efficient tool for solving combinatorial optimization problems and other problems involving discrete variables. In this paper, a revised version of the discrete particle swarm optimization algorithm is proposed for solving Quadratic Assignment Problems (QAP). Instead of using the general velocity and position update procedures in particle swarm optimization algorithms, four different possible positions are found out for each particle and the best among them is accepted as the updated position. The algorithm is applied to solve some benchmark instances of QAP taken from QAP Library and the results show minute deviations from best-known solutions.

Keywords

• Discrete Particle Swarm Optimization
• Quadratic Assignment problem