Forma Analysis of Particle Swarm Optimisation for Permutation Problems. (14th April 2008)

• Record Type: Journal Article
• Authors: Gong, Tao; Tuson, Andrew L.
• Other Names: Poli Riccardo Academic Editor.
• Is Part Of: Journal of artificial evolution and applications. Volume 2008(2008)
• Publication Date: 2008-04-14
• Subjects: Evolutionary programming (Computer science) -- Periodicals; Evolutionary programming (Computer science); Periodicals; Electronic journals; 006.3823
• DOI: 10.1155/2008/587309
• Languages: English
• ISSNs: 1687-6229

Abstract

Abstract : Particle swarm optimisation (PSO) is an innovative and competitive optimisation technique for numerical optimisation with real-parameter representation. In this paper, we examine the working mechanism of PSO in a principled manner with forma analysis and investigate the applicability of PSO on the permutation problem domain. Particularly, our derived PSO schemes are empirically studied based on the quadratic assignment problem (QAP) benchmarks to justify its comparable performance, which in turn implies the benefits of our approach in applying PSO to the discrete problem domain.