%0 Conference Paper
%B IEEE Swarm Intelligence Symposium, 2009. SIS '09
%D 2009
%T A cooperative combinatorial Particle Swarm Optimization algorithm for side-chain packing
%A Lapizco-Encinas,G.
%A Kingsford, Carl
%A Reggia, James A.
%K Algorithm design and analysis
%K Amino acids
%K combinatorial mathematics
%K cooperative combinatorial particle swarm optimization algorithm
%K Design optimization
%K Encoding
%K Feedback
%K numerical optimization
%K Optimization methods
%K particle swarm optimisation
%K Particle swarm optimization
%K Partitioning algorithms
%K Proteins
%K proteomics
%K proteomics optimization
%K Robustness
%K side-chain packing
%X Particle Swarm Optimization (PSO) is a well-known, competitive technique for numerical optimization with real-parameter representation. This paper introduces CCPSO, a new Cooperative Particle Swarm Optimization algorithm for combinatorial problems. The cooperative strategy is achieved by splitting the candidate solution vector into components, where each component is optimized by a particle. Particles move throughout a continuous space, their movements based on the influences exerted by static particles that then get feedback based on the fitness of the candidate solution. Here, the application of this technique to side-chain packing (a proteomics optimization problem) is investigated. To verify the efficiency of the proposed CCPSO algorithm, we test our algorithm on three side-chain packing problems and compare our results with the provably optimal result. Computational results show that the proposed algorithm is very competitive, obtaining a conformation with an energy value within 1% of the provably optimal solution in many proteins.
%B IEEE Swarm Intelligence Symposium, 2009. SIS '09
%I IEEE
%P 22 - 29
%8 2009/04/30/March
%@ 978-1-4244-2762-8
%G eng
%R 10.1109/SIS.2009.4937840