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

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. | Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems