An Improved Particle Swarm Optimization Algorithm for Quadratic Assignment Problem
2012
In this paper, we use an improved particle swarm optimization (via presenting the concept of swap operator and swap sequence) to solve the quadratic assignment problem. The results from the experiments on different quadratic assignment problem instances show that the improved particle swarm optimization algorithm can achieve good results.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
3
Citations
NaN
KQI