Abstract
Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. But research on the Quadratic Assignment Problem (QAP) has not much been investigated. In this paper, we introduce a novel approach based on PSO for QAPs. The representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is proposed between the particles in the swarm and the problem space in an efficient way. We evaluate the performance of the proposed approach with Ant Colony Optimization (ACO) algorithm. Empirical results illustrate that the approach can be applied for solving quadratic assignment problems and it has outperforms ACO in the completion time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kennedy, J., Eberhart, R.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Clerc, M.: Particle Swarm Optimization. ISTE Publishing Company, London (2006)
Eberhart, R.C., Shi, Y.: Comparison between genetic algorithms and particle swarm optimization. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 611–616. IEEE Computer Society Press, Los Alamitos (1998)
Settles, M., Rodebaugh, B., Soule, T.: Comparison of genetic algorithm and particle swarm optimizer when evolving a recurrent neural network. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 148–149. Springer, Heidelberg (2003)
Boeringer, D.W., Werner, D.H.: Particle swarm optimization versus genetic algorithms for phased array synthesis. IEEE Transactions on Antennas and Propagation 52(3), 771–779 (2004)
Parsopoulos, K.E., Vrahatis, M.N.: Recent Approaches to Global Optimization Problems through Particle Swarm Optimization. Natural Computing 1, 235–306 (2002)
Schute, J.F., Groenwold, A.A.: A study of global optimization using particle swarms. Journal of Global Optimization 31, 93–108 (2005)
Abraham, A., Guo, H., Liu, H.: Swarm Intelligence: Foundations, Perspectives and Applications. In: Nedjah, N., Mourelle, L. (eds.) Swarm Intelligent Systems. Studies in Computational Intelligence, pp. 3–25. Springer, Heidelberg (2006)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of International Conference on Systems, Man, and Cybernetics, pp. 4104–4108. IEEE Computer Society Press, Los Alamitos (1997)
Shi, X., Xing, X., Wang, Q., et al.: A discrete PSO method for generalized TSP problem. In: Proceedings of International Conference on Machine Learning and Cybernetics, pp. 2378–2383. IEEE Computer Society Press, Los Alamitos (2004)
Pang, W., et al.: Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In: Proceedings of the Fourth International Conference on Computer and Information Technology, pp. 796–800. IEEE Computer Society Press, Los Alamitos (2004)
Abraham, A., et al.: Job Scheduling on Computational Grids Using Fuzzy Particle Swarm Algorithm. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds.) KES 2006. LNCS (LNAI), vol. 4252, pp. 500–507. Springer, Heidelberg (2006)
Koopmans, T.C., Beckman, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Stützle, T.: Iterated local search for the quadratic assignment problem. European Journal of Operational Research. In: Press, Corrected Proof, Science Direct Available online 13 May 2005 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Angel, E., Zissimopoulos, V.: On the hardness of the quadratic assignment problem with metaheuristics. Journal of Heuristics 8, 399–414 (2002)
Misevicivs, A.: A tabu search algorithm for the quadratic assignment problem. Computational Optimization and Applications 30, 95–111 (2005)
Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowlege and Data Engineering 11(5), 769–778 (1999)
Drezner, Z., Hann, P.M., Taillard, E.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Annals of Operations Research 139, 65–94 (2005)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50, 167–176 (1999)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Abraham, A., Zhang, J. (2007). A Particle Swarm Approach to Quadratic Assignment Problems. In: Saad, A., Dahal, K., Sarfraz, M., Roy, R. (eds) Soft Computing in Industrial Applications. Advances in Soft Computing, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70706-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-70706-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70704-2
Online ISBN: 978-3-540-70706-6
eBook Packages: EngineeringEngineering (R0)